Spectrum of large random asymmetric matrices

Networked dynamic systems with higher-order interactions: stability versus complexity

The stability of complex systems is profoundly affected by underlying structures, which are often modeled as networks where nodes indicate system components and edges indicate pairwise interactions between nodes. However, such networks cannot encode the overall complexity of networked systems with higher-order interactions among more than two nodes. Set structures provide a natural description of pairwise and higher-order interactions where nodes are grouped into multiple sets based on their shared traits. Here we derive the stability criteria for networked systems with higher-order interactions by employing set structures. In particular, we provide a simple rule showing that the higher-order interactions play a double-sided role in community stability-networked systems with set structures are stabilized if the expected number of common sets for any two nodes is less than one. Moreover, although previous knowledge suggests that more interactions (i.e. complexity) destabilize networked systems, we report that, with higher-order interactions, networked systems can be stabilized by forming more local sets. Our findings are robust with respect to degree heterogeneous structures, diverse equilibrium states and interaction types.

Neuronal firing rate diversity lowers the dimension of population covariability

Populations of neurons produce activity with two central features. First, neuronal responses are very diverse - specific stimuli or behaviors prompt some neurons to emit many action potentials, while other neurons remain relatively silent. Second, the trial-to-trial fluctuations of neuronal response occupy a low dimensional space, owing to significant correlations between the activity of neurons. These two features define the quality of neuronal representation. We link these two aspects of population response using a recurrent circuit model and derive the following relation: the more diverse the firing rates of neurons in a population, the lower the effective dimension of population trial-to-trial covariability. This surprising prediction is tested and validated using simultaneously recorded neuronal populations from numerous brain areas in mice, non-human primates, and in the motor cortex of human participants. Using our relation we present a theory where a more diverse neuronal code leads to better fine discrimination performance from population activity. In line with this theory, we show that neuronal populations across the brain exhibit both more diverse mean responses and lower-dimensional fluctuations when the brain is in more heightened states of information processing. In sum, we present a key organizational principle of neuronal population response that is widely observed across the nervous system and acts to synergistically improve population representation.

Unraveling emergent network indeterminacy in complex ecosystems: A random matrix approach

Indeterminacy of ecological networks-the unpredictability of ecosystem responses to persistent perturbations-is an emergent property of indirect effects a species has on another through interaction chains. Thus, numerous indirect pathways in large, complex ecological communities could make forecasting the long-term outcomes of environmental changes challenging. However, a comprehensive understanding of ecological structures causing indeterminacy has not yet been reached. Here, using random matrix theory (RMT), we provide mathematical criteria determining whether network indeterminacy emerges across various ecological communities. Our analytical and simulation results show that indeterminacy intricately depends on the characteristics of species interaction. Specifically, contrary to conventional wisdom, network indeterminacy is unlikely to emerge in large competitive and mutualistic communities, while it is a common feature in top-down regulated food webs. Furthermore, we found that predictable and unpredictable perturbations can coexist in the same community and that indeterminate responses to environmental changes arise more frequently in networks where predator-prey relationships predominate than competitive and mutualistic ones. These findings highlight the importance of elucidating direct species relationships and analyzing them with an RMT perspective on two fronts: It aids in 1) determining whether the network's responses to environmental changes are ultimately indeterminate and 2) identifying the types of perturbations causing less predictable outcomes in a complex ecosystem. In addition, our framework should apply to the inverse problem of network identification, i.e., determining whether observed responses to sustained perturbations can reconstruct their proximate causalities, potentially impacting other fields such as microbial and medical sciences.

Eigenvalue spectra of finely structured random matrices

Random matrix theory allows for the deduction of stability criteria for complex systems using only a summary knowledge of the statistics of the interactions between components. As such, results like the well-known elliptical law are applicable in a myriad of different contexts. However, it is often assumed that all components of the complex system in question are statistically equivalent, which is unrealistic in many applications. Here we introduce the concept of a finely structured random matrix. These are random matrices with element-specific statistics, which can be used to model systems in which the individual components are statistically distinct. By supposing that the degree of "fine structure" in the matrix is small, we arrive at a succinct "modified" elliptical law. We demonstrate the direct applicability of our results to the niche and cascade models in theoretical ecology, as well as a model of a neural network, and a directed network with arbitrary degree distribution. The simple closed form of our central results allow us to draw broad qualitative conclusions about the effect of fine structure on stability.

Niche overlap and Hopfield-like interactions in generalized random Lotka-Volterra systems

We study communities emerging from generalized random Lotka-Volterra dynamics with a large number of species with interactions determined by the degree of niche overlap. Each species is endowed with a number of traits, and competition between pairs of species increases with their similarity in trait space. This leads to a model with random Hopfield-like interactions. We use tools from the theory of disordered systems, notably dynamic mean-field theory, to characterize the statistics of the resulting communities at stable fixed points and determine analytically when stability breaks down. Two distinct types of transition are identified in this way, both marked by diverging abundances but differing in the behavior of the integrated response function. At fixed points only a fraction of the initial pool of species survives. We numerically study the eigenvalue spectra of the interaction matrix between extant species. We find evidence that the two types of dynamical transition are, respectively, associated with the bulk spectrum or an outlier eigenvalue crossing into the right half of the complex plane.

Geometry of population activity in spiking networks with low-rank structure

Recurrent network models are instrumental in investigating how behaviorally-relevant computations emerge from collective neural dynamics. A recently developed class of models based on low-rank connectivity provides an analytically tractable framework for understanding of how connectivity structure determines the geometry of low-dimensional dynamics and the ensuing computations. Such models however lack some fundamental biological constraints, and in particular represent individual neurons in terms of abstract units that communicate through continuous firing rates rather than discrete action potentials. Here we examine how far the theoretical insights obtained from low-rank rate networks transfer to more biologically plausible networks of spiking neurons. Adding a low-rank structure on top of random excitatory-inhibitory connectivity, we systematically compare the geometry of activity in networks of integrate-and-fire neurons to rate networks with statistically equivalent low-rank connectivity. We show that the mean-field predictions of rate networks allow us to identify low-dimensional dynamics at constant population-average activity in spiking networks, as well as novel non-linear regimes of activity such as out-of-phase oscillations and slow manifolds. We finally exploit these results to directly build spiking networks that perform nonlinear computations.

Generalized Lotka-Volterra Equations with Random, Nonreciprocal Interactions: The Typical Number of Equilibria

We compute the typical number of equilibria of the generalized Lotka-Volterra equations describing species-rich ecosystems with random, nonreciprocal interactions using the replicated Kac-Rice method. We characterize the multiple-equilibria phase by determining the average abundance and similarity between equilibria as a function of their diversity (i.e., of the number of coexisting species) and of the variability of the interactions. We show that linearly unstable equilibria are dominant, and that the typical number of equilibria differs with respect to the average number.

Feasibility and stability in large Lotka Volterra systems with interaction structure

Complex system stability can be studied via linear stability analysis using random matrix theory (RMT) or via feasibility (requiring positive equilibrium abundances). Both approaches highlight the importance of interaction structure. Here we show, analytically and numerically, how RMT and feasibility approaches can be complementary. In generalized Lotka-Volterra (GLV) models with random interaction matrices, feasibility increases when predator-prey interactions increase; increasing competition/mutualism has the opposite effect. These changes have crucial impact on the stability of the GLV model.

Breakdown of Random-Matrix Universality in Persistent Lotka-Volterra Communities

The eigenvalue spectrum of a random matrix often only depends on the first and second moments of its elements, but not on the specific distribution from which they are drawn. The validity of this universality principle is often assumed without proof in applications. In this Letter, we offer a pertinent counterexample in the context of the generalized Lotka-Volterra equations. Using dynamic mean-field theory, we derive the statistics of the interactions between species in an evolved ecological community. We then show that the full statistics of these interactions, beyond those of a Gaussian ensemble, are required to correctly predict the eigenvalue spectrum and therefore stability. Consequently, the universality principle fails in this system. We thus show that the eigenvalue spectra of random matrices can be used to deduce the stability of "feasible" ecological communities, but only if the emergent non-Gaussian statistics of the interactions between species are taken into account.

Path integral approach to universal dynamics of reservoir computers

In this work, we give a characterization of the reservoir computer (RC) by the network structure, especially the probability distribution of random coupling constants. First, based on the path integral method, we clarify the universal behavior of the random network dynamics in the thermodynamic limit, which depends only on the asymptotic behavior of the second cumulant generating functions of the network coupling constants. This result enables us to classify the random networks into several universality classes, according to the distribution function of coupling constants chosen for the networks. Interestingly, it is revealed that such a classification has a close relationship with the distribution of eigenvalues of the random coupling matrix. We also comment on the relation between our theory and some practical choices of random connectivity in the RC. Subsequently, we investigate the relationship between the RC's computational power and the network parameters for several universality classes. We perform several numerical simulations to evaluate the phase diagrams of the steady reservoir states, common-signal-induced synchronization, and the computational power in the chaotic time series inference tasks. As a result, we clarify the close relationship between these quantities, especially a remarkable computational performance near the phase transitions, which is realized even near a nonchaotic transition boundary. These results may provide us with a new perspective on the designing principle for the RC.

Relating local connectivity and global dynamics in recurrent excitatory-inhibitory networks

How the connectivity of cortical networks determines the neural dynamics and the resulting computations is one of the key questions in neuroscience. Previous works have pursued two complementary approaches to quantify the structure in connectivity. One approach starts from the perspective of biological experiments where only the local statistics of connectivity motifs between small groups of neurons are accessible. Another approach is based instead on the perspective of artificial neural networks where the global connectivity matrix is known, and in particular its low-rank structure can be used to determine the resulting low-dimensional dynamics. A direct relationship between these two approaches is however currently missing. Specifically, it remains to be clarified how local connectivity statistics and the global low-rank connectivity structure are inter-related and shape the low-dimensional activity. To bridge this gap, here we develop a method for mapping local connectivity statistics onto an approximate global low-rank structure. Our method rests on approximating the global connectivity matrix using dominant eigenvectors, which we compute using perturbation theory for random matrices. We demonstrate that multi-population networks defined from local connectivity statistics for which the central limit theorem holds can be approximated by low-rank connectivity with Gaussian-mixture statistics. We specifically apply this method to excitatory-inhibitory networks with reciprocal motifs, and show that it yields reliable predictions for both the low-dimensional dynamics, and statistics of population activity. Importantly, it analytically accounts for the activity heterogeneity of individual neurons in specific realizations of local connectivity. Altogether, our approach allows us to disentangle the effects of mean connectivity and reciprocal motifs on the global recurrent feedback, and provides an intuitive picture of how local connectivity shapes global network dynamics.

Evaluating the statistical similarity of neural network activity and connectivity via eigenvector angles

Neural systems are networks, and strategic comparisons between multiple networks are a prevalent task in many research scenarios. In this study, we construct a statistical test for the comparison of matrices representing pairwise aspects of neural networks, in particular, the correlation between spiking activity and connectivity. The "eigenangle test" quantifies the similarity of two matrices by the angles between their ranked eigenvectors. We calibrate the behavior of the test for use with correlation matrices using stochastic models of correlated spiking activity and demonstrate how it compares to classical two-sample tests, such as the Kolmogorov-Smirnov distance, in the sense that it is able to evaluate also structural aspects of pairwise measures. Furthermore, the principle of the eigenangle test can be applied to compare the similarity of adjacency matrices of certain types of networks. Thus, the approach can be used to quantitatively explore the relationship between connectivity and activity with the same metric. By applying the eigenangle test to the comparison of connectivity matrices and correlation matrices of a random balanced network model before and after a specific synaptic rewiring intervention, we gauge the influence of connectivity features on the correlated activity. Potential applications of the eigenangle test include simulation experiments, model validation, and data analysis.

Eigenvalue spectra and stability of directed complex networks

Quantifying the eigenvalue spectra of large random matrices allows one to understand the factors that contribute to the stability of dynamical systems with many interacting components. This work explores the effect that the interaction network between components has on the eigenvalue spectrum. We build on previous results, which usually only take into account the mean degree of the network, by allowing for nontrivial network degree heterogeneity. We derive closed-form expressions for the eigenvalue spectrum of the adjacency matrix of a general weighted and directed network. Using these results, which are valid for any large well-connected complex network, we then derive compact formulas for the corrections (due to nonzero network heterogeneity) to well-known results in random matrix theory. Specifically, we derive modified versions of the Wigner semicircle law, the Girko circle law, and the elliptic law and any outlier eigenvalues. We also derive a surprisingly neat analytical expression for the eigenvalue density of a directed Barabási-Albert network. We are thus able to deduce that network heterogeneity is mostly a destabilizing influence in complex dynamical systems.

Designing non-Hermitian real spectra through electrostatics

Non-hermiticity presents a vast newly opened territory that harbors new physics and applications such as lasing and sensing. However, only non-Hermitian systems with real eigenenergies are stable, and great efforts have been devoted in designing them through enforcing parity-time (PT) symmetry. In this work, we exploit a lesser-known dynamical mechanism for enforcing real-spectra, and develop a comprehensive and versatile approach for designing new classes of parent Hamiltonians with real spectra. Our design approach is based on a new electrostatics analogy for modified non-Hermitian bulk-boundary correspondence, where electrostatic charge corresponds to density of states and electric fields correspond to complex spectral flow. As such, Hamiltonians of any desired spectra and state localization profile can be reverse-engineered, particularly those without any guiding symmetry principles. By recasting the diagonalization of non-Hermitian Hamiltonians as a Poisson boundary value problem, our electrostatics analogy also transcends the gain/loss-induced compounding of floating-point errors in traditional numerical methods, thereby allowing access to far larger system sizes.

The spectrum of covariance matrices of randomly connected recurrent neuronal networks with linear dynamics

A key question in theoretical neuroscience is the relation between the connectivity structure and the collective dynamics of a network of neurons. Here we study the connectivity-dynamics relation as reflected in the distribution of eigenvalues of the covariance matrix of the dynamic fluctuations of the neuronal activities, which is closely related to the network dynamics’ Principal Component Analysis (PCA) and the associated effective dimensionality. We consider the spontaneous fluctuations around a steady state in a randomly connected recurrent network of stochastic neurons. An exact analytical expression for the covariance eigenvalue distribution in the large-network limit can be obtained using results from random matrices. The distribution has a finitely supported smooth bulk spectrum and exhibits an approximate power-law tail for coupling matrices near the critical edge. We generalize the results to include second-order connectivity motifs and discuss extensions to excitatory-inhibitory networks. The theoretical results are compared with those from finite-size networks and the effects of temporal and spatial sampling are studied. Preliminary application to whole-brain imaging data is presented. Using simple connectivity models, our work provides theoretical predictions for the covariance spectrum, a fundamental property of recurrent neuronal dynamics, that can be compared with experimental data.

Here we study the distribution of eigenvalues, or spectrum, of the neuron-to-neuron covariance matrix in recurrently connected neuronal networks. The covariance spectrum is an important global feature of neuron population dynamics that requires simultaneous recordings of neurons. The spectrum is essential to the widely used Principal Component Analysis (PCA) and generalizes the dimensionality measure of population dynamics. We use a simple model to emulate the complex connections between neurons, where all pairs of neurons interact linearly at a strength specified randomly and independently. We derive a closed-form expression of the covariance spectrum, revealing an interesting long tail of large eigenvalues following a power law as the connection strength increases. To incorporate connectivity features important to biological neural circuits, we generalize the result to networks with an additional low-rank connectivity component that could come from learning and networks consisting of sparsely connected excitatory and inhibitory neurons. To facilitate comparing the theoretical results to experimental data, we derive the precise modifications needed to account for the effect of limited time samples and having unobserved neurons. Preliminary applications to large-scale calcium imaging data suggest our model can well capture the high dimensional population activity of neurons.

Complex Dynamics of Noise-Perturbed Excitatory-Inhibitory Neural Networks With Intra-Correlative and Inter-Independent Connections

Real neural system usually contains two types of neurons, i.e., excitatory neurons and inhibitory ones. Analytical and numerical interpretation of dynamics induced by different types of interactions among the neurons of two types is beneficial to understanding those physiological functions of the brain. Here, we articulate a model of noise-perturbed random neural networks containing both excitatory and inhibitory (E&I) populations. Particularly, both intra-correlatively and inter-independently connected neurons in two populations are taken into account, which is different from the most existing E&I models only considering the independently-connected neurons. By employing the typical mean-field theory, we obtain an equivalent system of two dimensions with an input of stationary Gaussian process. Investigating the stationary autocorrelation functions along the obtained system, we analytically find the parameters’ conditions under which the synchronized behaviors between the two populations are sufficiently emergent. Taking the maximal Lyapunov exponent as an index, we also find different critical values of the coupling strength coefficients for the chaotic excitatory neurons and for the chaotic inhibitory ones. Interestingly, we reveal that the noise is able to suppress chaotic dynamics of the random neural networks having neurons in two populations, while an appropriate amount of correlation coefficient in intra-coupling strengths can enhance chaos occurrence. Finally, we also detect a previously-reported phenomenon where the parameters region corresponds to neither linearly stable nor chaotic dynamics; however, the size of the region area crucially depends on the populations’ parameters.

Eigenvalues of Random Matrices with Generalized Correlations: A Path Integral Approach

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical systems. In this Letter, we study the eigenvalue spectrum of an ensemble of random matrices with correlations between any pair of elements. To this end, we introduce an analytical method that maps the resolvent of the random matrix onto the response functions of a linear dynamical system. The response functions are then evaluated using a path integral formalism, enabling us to make deductions about the eigenvalue spectrum. Our central result is a simple, closed-form expression for the leading eigenvalue of a large random matrix with generalized correlations. This formula demonstrates that correlations between matrix elements that are not diagonally opposite, which are often neglected, can have a significant impact on stability.

Dynamical systems on large networks with predator-prey interactions are stable and exhibit oscillations

We analyze the stability of linear dynamical systems defined on sparse, random graphs with predator-prey, competitive, and mutualistic interactions. These systems are aimed at modeling the stability of fixed points in large systems defined on complex networks, such as ecosystems consisting of a large number of species that interact through a food web. We develop an exact theory for the spectral distribution and the leading eigenvalue of the corresponding sparse Jacobian matrices. This theory reveals that the nature of local interactions has a strong influence on a system's stability. We show that, in general, linear dynamical systems defined on random graphs with a prescribed degree distribution of unbounded support are unstable if they are large enough, implying a tradeoff between stability and diversity. Remarkably, in contrast to the generic case, antagonistic systems that contain only interactions of the predator-prey type can be stable in the infinite size limit. This feature for antagonistic systems is accompanied by a peculiar oscillatory behavior of the dynamical response of the system after a perturbation, when the mean degree of the graph is small enough. Moreover, for antagonistic systems we also find that there exist a dynamical phase transition and critical mean degree above which the response becomes nonoscillatory.

High-order correlations in species interactions lead to complex diversity-stability relationships for ecosystems

How ecosystems maintain stability is an active area of research. Inspired by applications of random matrix theory in nuclear physics, May showed decades ago that in an ecosystem model with many randomly interacting species, increasing species diversity decreases the stability of the ecosystem. There have since been many additions to May's efforts, one being an improved understanding the effect of mutualistic, competitive, or predator-prey-like correlations between pairs of species. Here we extend a random matrix technique developed in the context of spin-glass theory to study the effect of high-order correlations among species interactions. The resulting analytically solvable models include next-to-nearest-neighbor correlations in the species interaction network, such as the enemy of my enemy is my friend, as well as higher-order correlations. We find qualitative differences from May and others' models, including nonmonotonic diversity-stability relationships. Furthermore, inclusion of particular next-to-nearest-neighbor correlations in predator-prey as opposed to mutualist-competitive networks causes the former to transition to being more stable at higher species diversity. We discuss potential applicability of our results to microbiota engineering and to the ecology of interpredator interactions, such as cub predation between lions and hyenas as well as companionship between humans and dogs.

Eikonal formulation of large dynamical random matrix models

The standard approach to dynamical random matrix models relies on the description of trajectories of eigenvalues. Using the analogy from optics, based on the duality between the Fermat principle (rays) and the Huygens principle (wavefronts), we formulate the Hamilton-Jacobi dynamics for large random matrix models. The resulting equations describe a broad class of random matrix models in a unified way, including normal (Hermitian or unitary) as well as strictly non-normal dynamics. This formalism applied to Brownian bridge dynamics allows one to calculate the asymptotics of the Harish-Chandra-Itzykson-Zuber integrals.

Non-Hermitian physics for optical manipulation uncovers inherent instability of large clusters

Intense light traps and binds small particles, offering unique control to the microscopic world. With incoming illumination and radiative losses, optical forces are inherently nonconservative, thus non-Hermitian. Contrary to conventional systems, the operator governing time evolution is real and asymmetric (i.e., non-Hermitian), which inevitably yield complex eigenvalues when driven beyond the exceptional points, where light pumps in energy that eventually "melts" the light-bound structures. Surprisingly, unstable complex eigenvalues are prevalent for clusters with ~10 or more particles, and in the many-particle limit, their presence is inevitable. As such, optical forces alone fail to bind a large cluster. Our conclusion does not contradict with the observation of large optically-bound cluster in a fluid, where the ambient damping can take away the excess energy and restore the stability. The non-Hermitian theory overturns the understanding of optical trapping and binding, and unveils the critical role played by non-Hermiticity and exceptional points, paving the way for large-scale manipulation.

Random generators of Markovian evolution: A quantum-classical transition by superdecoherence

Continuous-time Markovian evolution appears to be manifestly different in classical and quantum worlds. We consider ensembles of random generators of N-dimensional Markovian evolution, quantum and classical ones, and evaluate their universal spectral properties. We then show how the two types of generators can be related by superdecoherence. In analogy with the mechanism of decoherence, which transforms a quantum state into a classical one, superdecoherence can be used to transform a Lindblad operator (generator of quantum evolution) into a Kolmogorov operator (generator of classical evolution). We inspect spectra of random Lindblad operators undergoing superdecoherence and demonstrate that, in the limit of complete superdecoherence, the resulting operators exhibit spectral density typical to random Kolmogorov operators. By gradually increasing strength of superdecoherence, we observe a sharp quantum-to-classical transition. Furthermore, we define an inverse procedure of supercoherification that is a generalization of the scheme used to construct a quantum state out of a classical one. Finally, we study microscopic correlation between neighboring eigenvalues through the complex spacing ratios and observe the horseshoe distribution, emblematic of the Ginibre universality class, for both types of random generators. Remarkably, it survives both superdecoherence and supercoherification.

Analytic approach for the number statistics of non-Hermitian random matrices

We introduce a powerful analytic method to study the statistics of the number N_{A}(γ) of eigenvalues inside any smooth Jordan curve γ∈C for infinitely large non-Hermitian random matrices A. Our generic approach can be applied to different random matrix ensembles of a mean-field type, even when the analytic expression for the joint distribution of eigenvalues is not known. We illustrate the method on the adjacency matrices of weighted random graphs with asymmetric couplings, for which standard random-matrix tools are inapplicable, and obtain explicit results for the diluted real Ginibre ensemble. The main outcome is an effective theory that determines the cumulant generating function of N_{A} via a path integral along γ, with the path probability distribution following from the numerical solution of a nonlinear self-consistent equation. We derive expressions for the mean and the variance of N_{A} as well as for the rate function governing rare fluctuations of N_{A}(γ). All theoretical results are compared with direct diagonalization of finite random matrices, exhibiting an excellent agreement.

Persistent individual bias in a voter model with quenched disorder

Many theoretical studies of the voter model (or variations thereupon) involve order parameters that are population-averaged. While enlightening, such quantities may obscure important statistical features that are only apparent on the level of the individual. In this work, we ask which factors contribute to a single voter maintaining a long-term statistical bias for one opinion over the other in the face of social influence. To this end, a modified version of the network voter model is proposed, which also incorporates quenched disorder in the interaction strengths between individuals and the possibility of antagonistic relationships. We find that a sparse interaction network and heterogeneity in interaction strengths give rise to the possibility of arbitrarily long-lived individual biases, even when there is no population-averaged bias for one opinion over the other. This is demonstrated by calculating the eigenvalue spectrum of the weighted network Laplacian using the theory of sparse random matrices.

Weakly correlated synapses promote dimension reduction in deep neural networks

By controlling synaptic and neural correlations, deep learning has achieved empirical successes in improving classification performances. How synaptic correlations affect neural correlations to produce disentangled hidden representations remains elusive. Here we propose a simplified model of dimension reduction, taking into account pairwise correlations among synapses, to reveal the mechanism underlying how the synaptic correlations affect dimension reduction. Our theory determines the scaling of synaptic correlations requiring only mathematical self-consistency for both binary and continuous synapses. The theory also predicts that weakly correlated synapses encourage dimension reduction compared to their orthogonal counterparts. In addition, these synapses attenuate the decorrelation process along the network depth. These two computational roles are explained by a proposed mean-field equation. The theoretical predictions are in excellent agreement with numerical simulations, and the key features are also captured by deep learning with Hebbian rules.

ASYMMETRY HELPS: EIGENVALUE AND EIGENVECTOR ANALYSES OF ASYMMETRICALLY PERTURBED LOW-RANK MATRICES

This paper is concerned with the interplay between statistical asymmetry and spectral methods. Suppose we are interested in estimating a rank-1 and symmetric matrixM ⋆ ∈ ℝ n × n , yet only a randomly perturbed version M is observed. The noise matrix M - M ⋆ is composed of independent (but not necessarily homoscedastic) entries and is, therefore, not symmetric in general. This might arise if, for example, we have two independent samples for each entry of M ⋆ and arrange them in an asymmetric fashion. The aim is to estimate the leading eigenvalue and the leading eigenvector of M ⋆. We demonstrate that the leading eigenvalue of the data matrix M can be O ( n ) times more accurate (up to some log factor) than its (unadjusted) leading singular value of M in eigenvalue estimation. Moreover, the eigen-decomposition approach is fully adaptive to heteroscedasticity of noise, without the need of any prior knowledge about the noise distributions. In a nutshell, this curious phenomenon arises since the statistical asymmetry automatically mitigates the bias of the eigenvalue approach, thus eliminating the need of careful bias correction. Additionally, we develop appealing non-asymptotic eigenvector perturbation bounds; in particular, we are able to bound the perterbation of any linear function of the leading eigenvector of M (e.g. entrywise eigenvector perturbation). We also provide partial theory for the more general rank-r case. The takeaway message is this: arranging the data samples in an asymmetric manner and performing eigen-decomposition could sometimes be quite beneficial.

Dispersal-induced instability in complex ecosystems

In his seminal work in the 1970s, Robert May suggested that there is an upper limit to the number of species that can be sustained in stable equilibrium by an ecosystem. This deduction was at odds with both intuition and the observed complexity of many natural ecosystems. The so-called stability-diversity debate ensued, and the discussion about the factors contributing to ecosystem stability or instability continues to this day. We show in this work that dispersal can be a destabilising influence. To do this, we combine ideas from Alan Turing's work on pattern formation with May's random-matrix approach. We demonstrate how a stable equilibrium in a complex ecosystem with trophic structure can become unstable with the introduction of dispersal in space, and we discuss the factors which contribute to this effect. Our work highlights that adding more details to the model of May can give rise to more ways for an ecosystem to become unstable. Making May's simple model more realistic is therefore unlikely to entirely remove the upper bound on complexity.

Self-consistent formulations for stochastic nonlinear neuronal dynamics

Neural dynamics is often investigated with tools from bifurcation theory. However, many neuron models are stochastic, mimicking fluctuations in the input from unknown parts of the brain or the spiking nature of signals. Noise changes the dynamics with respect to the deterministic model; in particular classical bifurcation theory cannot be applied. We formulate the stochastic neuron dynamics in the Martin-Siggia-Rose de Dominicis-Janssen (MSRDJ) formalism and present the fluctuation expansion of the effective action and the functional renormalization group (fRG) as two systematic ways to incorporate corrections to the mean dynamics and time-dependent statistics due to fluctuations in the presence of nonlinear neuronal gain. To formulate self-consistency equations, we derive a fundamental link between the effective action in the Onsager-Machlup (OM) formalism, which allows the study of phase transitions, and the MSRDJ effective action, which is computationally advantageous. These results in particular allow the derivation of an OM effective action for systems with non-Gaussian noise. This approach naturally leads to effective deterministic equations for the first moment of the stochastic system; they explain how nonlinearities and noise cooperate to produce memory effects. Moreover, the MSRDJ formulation yields an effective linear system that has identical power spectra and linear response. Starting from the better known loopwise approximation, we then discuss the use of the fRG as a method to obtain self-consistency beyond the mean. We present a new efficient truncation scheme for the hierarchy of flow equations for the vertex functions by adapting the Blaizot, Méndez, and Wschebor approximation from the derivative expansion to the vertex expansion. The methods are presented by means of the simplest possible example of a stochastic differential equation that has generic features of neuronal dynamics.

Component response rate variation underlies the stability of highly complex finite systems

The stability of a complex system generally decreases with increasing system size and interconnectivity, a counterintuitive result of widespread importance across the physical, life, and social sciences. Despite recent interest in the relationship between system properties and stability, the effect of variation in response rate across system components remains unconsidered. Here I vary the component response rates (γ) of randomly generated complex systems. I use numerical simulations to show that when component response rates vary, the potential for system stability increases. These results are robust to common network structures, including small-world and scale-free networks, and cascade food webs. Variation in γ is especially important for stability in highly complex systems, in which the probability of stability would otherwise be negligible. At such extremes of simulated system complexity, the largest stable complex systems would be unstable if not for variation in γ. My results therefore reveal a previously unconsidered aspect of system stability that is likely to be pervasive across all realistic complex systems.

Ecological communities from random generalized Lotka-Volterra dynamics with nonlinear feedback

We investigate the outcome of generalized Lotka-Volterra dynamics of ecological communities with random interaction coefficients and nonlinear feedback. We show in simulations that the saturation of nonlinear feedback stabilizes the dynamics. This is confirmed in an analytical generating-functional approach to generalized Lotka-Volterra equations with piecewise linear saturating response. For such systems we are able to derive self-consistent relations governing the stable fixed-point phase and to carry out a linear stability analysis to predict the onset of unstable behavior. We investigate in detail the combined effects of the mean, variance, and covariance of the random interaction coefficients, and the saturation value of the nonlinear response. We find that stability and diversity increases with the introduction of nonlinear feedback, where decreasing the saturation value has a similar effect to decreasing the covariance. We also find cooperation to no longer have a detrimental effect on stability with nonlinear feedback, and the order parameters mean abundance and diversity to be less dependent on the symmetry of interactions with stronger saturation.

Eigenvalue repulsion and eigenvector localization in sparse non-Hermitian random matrices

Complex networks with directed, local interactions are ubiquitous in nature and often occur with probabilistic connections due to both intrinsic stochasticity and disordered environments. Sparse non-Hermitian random matrices arise naturally in this context and are key to describing statistical properties of the nonequilibrium dynamics that emerges from interactions within the network structure. Here we study one-dimensional (1D) spatial structures and focus on sparse non-Hermitian random matrices in the spirit of tight-binding models in solid state physics. We first investigate two-point eigenvalue correlations in the complex plane for sparse non-Hermitian random matrices using methods developed for the statistical mechanics of inhomogeneous two-dimensional interacting particles. We find that eigenvalue repulsion in the complex plane directly correlates with eigenvector delocalization. In addition, for 1D chains and rings with both disordered nearest-neighbor connections and self-interactions, the self-interaction disorder tends to decorrelate eigenvalues and localize eigenvectors more than simple hopping disorder. However, remarkable resistance to eigenvector localization by disorder is provided by large cycles, such as those embodied in 1D periodic boundary conditions under strong directional bias. The directional bias also spatially separates the left and right eigenvectors, leading to interesting dynamics in excitation and response. These phenomena have important implications for asymmetric random networks and highlight a need for mathematical tools to describe and understand them analytically.

Universal Spectra of Random Lindblad Operators

To understand the typical dynamics of an open quantum system in continuous time, we introduce an ensemble of random Lindblad operators, which generate completely positive Markovian evolution in the space of the density matrices. The spectral properties of these operators, including the shape of the eigenvalue distribution in the complex plane, are evaluated by using methods of free probabilities and explained with non-Hermitian random matrix models. We also demonstrate the universality of the spectral features. The notion of an ensemble of random generators of Markovian quantum evolution constitutes a step towards categorization of dissipative quantum chaos.

Second type of criticality in the brain uncovers rich multiple-neuron dynamics

Cortical networks that have been found to operate close to a critical point exhibit joint activations of large numbers of neurons. However, in motor cortex of the awake macaque monkey, we observe very different dynamics: massively parallel recordings of 155 single-neuron spiking activities show weak fluctuations on the population level. This a priori suggests that motor cortex operates in a noncritical regime, which in models, has been found to be suboptimal for computational performance. However, here, we show the opposite: The large dispersion of correlations across neurons is the signature of a second critical regime. This regime exhibits a rich dynamical repertoire hidden from macroscopic brain signals but essential for high performance in such concepts as reservoir computing. An analytical link between the eigenvalue spectrum of the dynamics, the heterogeneity of connectivity, and the dispersion of correlations allows us to assess the closeness to the critical point.

Correlations between synapses in pairs of neurons slow down dynamics in randomly connected neural networks

Networks of randomly connected neurons are among the most popular models in theoretical neuroscience. The connectivity between neurons in the cortex is however not fully random, the simplest and most prominent deviation from randomness found in experimental data being the overrepresentation of bidirectional connections among pyramidal cells. Using numerical and analytical methods, we investigate the effects of partially symmetric connectivity on the dynamics in networks of rate units. We consider the two dynamical regimes exhibited by random neural networks: the weak-coupling regime, where the firing activity decays to a single fixed point unless the network is stimulated, and the strong-coupling or chaotic regime, characterized by internally generated fluctuating firing rates. In the weak-coupling regime, we compute analytically, for an arbitrary degree of symmetry, the autocorrelation of network activity in the presence of external noise. In the chaotic regime, we perform simulations to determine the timescale of the intrinsic fluctuations. In both cases, symmetry increases the characteristic asymptotic decay time of the autocorrelation function and therefore slows down the dynamics in the network.

Pseudo-Hermitian anti-Hermitian ensemble of Gaussian matrices

It is shown that the ensemble of pseudo-Hermitian Gaussian matrices recently introduced gives rise in a certain limit to an ensemble of anti-Hermitian matrices whose eigenvalues have properties directly related to those of the chiral ensemble of random matrices.

Complete diagrammatics of the single-ring theorem

Using diagrammatic techniques, we provide explicit functional relations between the cumulant generating functions for the biunitarily invariant ensembles in the limit of large size of matrices. The formalism allows us to map two distinct areas of free random variables: Hermitian positive definite operators and non-normal R-diagonal operators. We also rederive the Haagerup-Larsen theorem and show how its recent extension to the eigenvector correlation function appears naturally within this approach.

Self-regulation and the stability of large ecological networks

The stability of complex ecological networks depends both on the interactions between species and the direct effects of the species on themselves. These self-effects are known as 'self-regulation' when an increase in a species' abundance decreases its per-capita growth rate. Sources of self-regulation include intraspecific interference, cannibalism, time-scale separation between consumers and their resources, spatial heterogeneity and nonlinear functional responses coupling predators with their prey. The influence of self-regulation on network stability is understudied and in addition, the empirical estimation of self-effects poses a formidable challenge. Here, we show that empirical food web structures cannot be stabilized unless the majority of species exhibit substantially strong self-regulation. We also derive an analytical formula predicting the effect of self-regulation on network stability with high accuracy and show that even for random networks, as well as networks with a cascade structure, stability requires negative self-effects for a large proportion of species. These results suggest that the aforementioned potential mechanisms of self-regulation are probably more important in contributing to the stability of observed ecological networks than was previously thought.

Symmetries Constrain Dynamics in a Family of Balanced Neural Networks

We examine a family of random firing-rate neural networks in which we enforce the neurobiological constraint of Dale's Law-each neuron makes either excitatory or inhibitory connections onto its post-synaptic targets. We find that this constrained system may be described as a perturbation from a system with nontrivial symmetries. We analyze the symmetric system using the tools of equivariant bifurcation theory and demonstrate that the symmetry-implied structures remain evident in the perturbed system. In comparison, spectral characteristics of the network coupling matrix are relatively uninformative about the behavior of the constrained system.

Exploratory adaptation in large random networks

The capacity of cells and organisms to respond to challenging conditions in a repeatable manner is limited by a finite repertoire of pre-evolved adaptive responses. Beyond this capacity, cells can use exploratory dynamics to cope with a much broader array of conditions. However, the process of adaptation by exploratory dynamics within the lifetime of a cell is not well understood. Here we demonstrate the feasibility of exploratory adaptation in a high-dimensional network model of gene regulation. Exploration is initiated by failure to comply with a constraint and is implemented by random sampling of network configurations. It ceases if and when the network reaches a stable state satisfying the constraint. We find that successful convergence (adaptation) in high dimensions requires outgoing network hubs and is enhanced by their auto-regulation. The ability of these empirically validated features of gene regulatory networks to support exploratory adaptation without fine-tuning, makes it plausible for biological implementation.

Recent works suggest that cellular networks may respond to novel challenges on the time-scale of cellular lifetimes through large-scale perturbation of gene expression and convergence to a new state. Here, the authors demonstrate the theoretical feasibility of exploratory adaptation in cellular networks by showing that convergence to new states depends on known features of these networks.

Chebyshev-polynomial expansion of the localization length of Hermitian and non-Hermitian random chains

We study Chebyshev-polynomial expansion of the inverse localization length of Hermitian and non-Hermitian random chains as a function of energy. For Hermitian models, the expansion produces this energy-dependent function numerically in one run of the algorithm. This is in strong contrast to the standard transfer-matrix method, which produces the inverse localization length for a fixed energy in each run. For non-Hermitian models, as in the transfer-matrix method, our algorithm computes the inverse localization length for a fixed (complex) energy. We also find a formula of the Chebyshev-polynomial expansion of the density of states of non-Hermitian models. As explained in detail, our algorithm for non-Hermitian models may be the only available efficient algorithm for finding the density of states of models with interactions.

Plasticity to the Rescue

The balance between excitatory and inhibitory inputs is critical for the proper functioning of neural circuits. Landau and colleagues show that, in the presence of cell-type-specific connectivity, this balance is difficult to achieve without either synaptic plasticity or spike-frequency adaptation to fine-tune the connection strengths.

Instability to a heterogeneous oscillatory state in randomly connected recurrent networks with delayed interactions

Oscillatory dynamics are ubiquitous in biological networks. Possible sources of oscillations are well understood in low-dimensional systems but have not been fully explored in high-dimensional networks. Here we study large networks consisting of randomly coupled rate units. We identify a type of bifurcation in which a continuous part of the eigenvalue spectrum of the linear stability matrix crosses the instability line at nonzero frequency. This bifurcation occurs when the interactions are delayed and partially antisymmetric and leads to a heterogeneous oscillatory state in which oscillations are apparent in the activity of individual units but not on the population-average level.

Eigenvalue Outliers of Non-Hermitian Random Matrices with a Local Tree Structure

Spectra of sparse non-Hermitian random matrices determine the dynamics of complex processes on graphs. Eigenvalue outliers in the spectrum are of particular interest, since they determine the stationary state and the stability of dynamical processes. We present a general and exact theory for the eigenvalue outliers of random matrices with a local tree structure. For adjacency and Laplacian matrices of oriented random graphs, we derive analytical expressions for the eigenvalue outliers, the first moments of the distribution of eigenvector elements associated with an outlier, the support of the spectral density, and the spectral gap. We show that these spectral observables obey universal expressions, which hold for a broad class of oriented random matrices.

Eigenvalue spectra of large correlated random matrices

Using the diagrammatic method, we derive a set of self-consistent equations that describe eigenvalue distributions of large correlated asymmetric random matrices. The matrix elements can have different variances and be correlated with each other. The analytical results are confirmed by numerical simulations. The results have implications for the dynamics of neural and other biological networks where plasticity induces correlations in the connection strengths within the network. We find that the presence of correlations can have a major impact on network stability.

Pseudo-Hermitian ensemble of random Gaussian matrices

It is shown how pseudo-Hermiticity, a necessary condition satisfied by operators of PT symmetric systems can be introduced in the three Gaussian classes of random matrix theory. The model describes transitions from real eigenvalues to a situation in which, apart from a residual number, the eigenvalues are complex conjugate.

Nonlinear analogue of the May-Wigner instability transition

We study a system of [Formula: see text] degrees of freedom coupled via a smooth homogeneous Gaussian vector field with both gradient and divergence-free components. In the absence of coupling, the system is exponentially relaxing to an equilibrium with rate μ We show that, while increasing the ratio of the coupling strength to the relaxation rate, the system experiences an abrupt transition from a topologically trivial phase portrait with a single equilibrium into a topologically nontrivial regime characterized by an exponential number of equilibria, the vast majority of which are expected to be unstable. It is suggested that this picture provides a global view on the nature of the May-Wigner instability transition originally discovered by local linear stability analysis.

The Effect of Intra- and Interspecific Competition on Coexistence in Multispecies Communities

For two competing species, intraspecific competition must exceed interspecific competition for coexistence. To generalize this well-known criterion to multiple competing species, one must take into account both the distribution of interaction strengths and community structure. Here we derive a multispecies generalization of the two-species rule in the context of symmetric Lotka-Volterra competition and obtain explicit stability conditions for random competitive communities. We then explore the influence of community structure on coexistence. Results show that both the most and least stabilized cases have striking global structures, with a nested pattern emerging in both cases. The distribution of intraspecific coefficients leading to the most and least stabilized communities also follows a predictable pattern that can be justified analytically. In addition, we show that the size of the parameter space allowing for feasible communities always increases with the strength of intraspecific effects in a characteristic way that is independent of the interspecific interaction structure. We conclude by discussing possible extensions of our results to nonsymmetric competition.

Consistent role of weak and strong interactions in high- and low-diversity trophic food webs

The growing realization of a looming biodiversity crisis has inspired considerable progress in the quest to link biodiversity, structure and ecosystem function. Here we construct a method that bridges low- and high-diversity approaches to food web theory by elucidating the connection between the stability of the basic building block of food webs and the mean stability properties of large random food web networks. Applying this theoretical framework to common food web models reveals two key findings. First, in almost all cases, high-diversity food web models yield a stability relationship between weak and strong interactions that are compatible in every way to simple low-diversity models. And second, the models that generate the recently discovered phenomena of being purely stabilized by increasing interaction strength correspond to the biologically implausible assumption of perfect interaction strength symmetry.

Predicting global community properties from uncertain estimates of interaction strengths

The community matrix measures the direct effect of species on each other in an ecological community. It can be used to determine whether a system is stable (returns to equilibrium after small perturbations of the population abundances), reactive (perturbations are initially amplified before damping out), and to determine the response of any individual species to perturbations of environmental parameters. However, several studies show that small errors in estimating the entries of the community matrix translate into large errors in predicting individual species responses. Here, we ask whether there are properties of complex communities one can still predict using only a crude, order-of-magnitude estimate of the community matrix entries. Using empirical data, randomly generated community matrices, and those generated by the Allometric Trophic Network model, we show that the stability and reactivity properties of systems can be predicted with good accuracy. We also provide theoretical insight into when and why our crude approximations are expected to yield an accurate description of communities. Our results indicate that even rough estimates of interaction strengths can be useful for assessing global properties of large systems.