Eigenvalue spectra and stability of directed complex networks

Path-integral approach to sparse non-Hermitian random matrices

The theory of large random matrices has proved an invaluable tool for the study of systems with disordered interactions in many quite disparate research areas. Widely applicable results, such as the celebrated elliptic law for dense random matrices, allow one to deduce the statistical properties of the interactions in a complex dynamical system that permit stability. However, such simple and universal results have so far proved difficult to come by in the case of sparse random matrices. Here, we perform an expansion in the inverse connectivity, and thus derive general modified versions of the classic elliptic and semicircle laws, taking into account the sparse correction. This is accomplished using a dynamical approach, which maps the hermitized resolvent of a random matrix onto the response functions of a linear dynamical system. The response functions are then evaluated using a path integral formalism, enabling one to construct Feynman diagrams, which facilitate the perturbative analysis. Additionally, in order to demonstrate the broad utility of the path integral framework, we derive a generic non-Hermitian generalization of the Marchenko-Pastur law, and we also show how one can handle non-negligible higher-order statistics (i.e., non-Gaussian statistics) in dense ensembles.

Interaction networks in persistent Lotka-Volterra communities

A central concern of community ecology is the interdependence between interaction strengths and the underlying structure of the network upon which species interact. In this work we present a solvable example of such a feedback mechanism in a generalized Lotka-Volterra dynamical system. Beginning with a community of species interacting on a network with arbitrary degree distribution, we provide an analytical framework from which properties of the eventual "surviving community" can be derived. We find that highly connected species are less likely to survive than their poorly connected counterparts, which skews the eventual degree distribution towards a preponderance of species with lower degrees. Furthermore, the average abundance of the neighbors of a species in the surviving community is lower than the community average (reminiscent of the famed friendship paradox). Finally, we show that correlations emerge between the connectivity of a species and its interactions with its neighbors. More precisely, we find that highly connected species tend to benefit from their neighbors more than their neighbors benefit from them. These correlations are not present in the initial pool of species and are a result of the dynamics.

Stability of Ecological Systems: A Theoretical Review

The stability of ecological systems is a fundamental concept in ecology, which offers profound insights into species coexistence, biodiversity, and community persistence. In this article, we provide a systematic and comprehensive review on the theoretical frameworks for analyzing the stability of ecological systems. Notably, we survey various stability notions, including linear stability, sign stability, diagonal stability, D-stability, total stability, sector stability, and structural stability. For each of these stability notions, we examine necessary or sufficient conditions for achieving such stability and demonstrate the intricate interplay of these conditions on the network structures of ecological systems. We further discuss the stability of ecological systems with higher-order interactions.

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.

Complex networks with complex weights

In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to encode node-node interactions with heterogeneous intensities or frequencies (e.g., in transportation networks, supply chains, and social networks). Most such studies have considered real-valued weights, despite the fact that networks with complex weights arise in fields as diverse as quantum information, quantum chemistry, electrodynamics, rheology, and machine learning. Many of the standard network-science approaches in the study of classical systems rely on the real-valued nature of edge weights, so it is necessary to generalize them if one seeks to use them to analyze networks with complex edge weights. In this paper, we examine how standard network-analysis methods fail to capture structural features of networks with complex edge weights. We then generalize several network measures to the complex domain and show that random-walk centralities provide a useful approach to examine node importances in networks with complex weights.