Linear stability analysis for large dynamical systems on directed random graphs
Izaak Neri, Fernando Lucas Metz

TL;DR
This paper develops a linear stability analysis for large dynamical systems on directed random graphs, revealing universal phase transition behavior and stability conditions even with unbounded degree distributions.
Contribution
It provides an exact theory for the leading eigenvalue and eigenvectors of large directed graphs, showing stability can persist with unbounded degrees and characterizing the phase transition.
Findings
Large directed graphs can be stable despite unbounded degree distributions.
The stability transition depends only on mean degree and degree correlation.
Unstable regimes exhibit universal destabilizing eigenmodes.
Abstract
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 dynamical systems: First, infinitely large systems on directed graphs can be stable even when the degree distribution has unbounded support; this result is surprising since their counterparts on nondirected graphs are unstable when system size is large enough. Second, we show that the phase transition between the stable and unstable phase is universal in the sense that it depends only on a few parameters, such as, the mean degree and a degree correlation coefficient. In addition, in the unstable regime we characterize the nature of the destabilizing mode, which also exhibits universal features. These results follow from an exact theory for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
