Related papers: On the structural stability of random systems
Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…
We reconsider both the global and local stability of solutions of continuously evolving dynamical systems from a geometric perspective. We clarify that an unambiguous definition of stability generally requires the choice of additional…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned with the dynamical process acting on top of the network. We…
We study a graph-theoretic property known as robustness, which plays a key role in certain classes of dynamics on networks (such as resilient consensus, contagion and bootstrap percolation). This property is stronger than other graph…
Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…
We search for steady states in a class of fluctuating and driven physical systems that exhibit sustained currents. We find that the physical concept of a steady state, well known for systems at equilibrium, must be generalised to describe…
A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable…
We consider the challenging problem of statistical inference for exponential-family random graph models based on a single observation of a random graph with complex dependence. To facilitate statistical inference, we consider random graphs…
Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our…
Previous studies have inferred robust stability of reaction networks by utilizing linear programs or iterative algorithms. Such algorithms become tedious or computationally infeasible for large networks. In addition, they operate like…
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…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…
The relationship between network topology and system dynamics has significant implications for unifying our understanding of the interplay among metabolic, gene-regulatory, and ecosystem network architecures. Here we analyze the stability…
We study the spectral properties of sparse random graphs with different topologies and type of interactions, and their implications on the stability of complex systems, with particular attention to ecosystems. Specifically, we focus on the…
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph $G$ if it is inherited by all the connected spanning subgraphs of $G$. We motivate this…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
Many natural and man-made network systems need to maintain certain patterns, such as working at equilibria or limit cycles, to function properly. Thus, the ability to stabilize such patterns is crucial. Most of the existing studies on…
We will look for stable structures in four situations and discuss what is known and unknown.