Searcharxiv⌕ Search

arXiv subjects

Fernando Lucas Metz

Publications and source records attributed to Fernando Lucas Metz.

4 recordsLinked to original sources

Dynamical mean-field theory of latching Potts networks

Spontaneous transitions between memories, as observed in internally generated cognition such as mind-wandering and free association, require neural dynamics capable of destabilizing one attractive memory state and moving towards another. We ask what minimal representational structure is required for such transitions to emerge in random associative networks. To address this question, we study Potts associative networks with $S$ active states per unit and slow adaptive thresholds. The $S=1$ case can model a standard Hopfield-like network of binary units. We employ dynamical mean-field theory in the extensive-load regime, where the number of stored patterns scales linearly with network size and connectivity, and we focus on transitions between two condensed memories, which are singled out in the connectivity matrix. In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes. The resulting phase diagram shows that adaptation alone is not sufficient: transitions only occur within certain ranges of the overlap between the two memories. In the binary case $S=1$, in particular, no unit can be active in both memories but in different Potts states, thus strongly supressing the high-latching, structured transitions that exist for $S>1$. In the extensive-load regime, non-condensed memories generate colored fluctuations and retarded self-interactions through an effective memory kernel. We find that latching trajectories change the effective timescale of this kernel, a dynamical signature of transitions in the extensive-load regime. These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.

q-bio.NC↗

Linear stability analysis for large dynamical systems on directed random graphs

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 leading eigenvalue of infinitely large graphs that are locally tree-like and oriented, as well as, for the right and left eigenvectors associated with the leading eigenvalue. We corroborate analytical results for infinitely large graphs with numerical experiments on random graphs of finite size. We discuss how the presented theory can be extended to graphs with diagonal disorder and to graphs that contain nondirected links. Finally, we discuss the influence of small cycles and how they can destabilize large dynamical systems when they induce strong enough feedback loops.

cond-mat.stat-mech↗

Spectral Theory of Sparse Non-Hermitian Random Matrices

Sparse non-Hermitian random matrices arise in the study of disordered physical systems with asymmetric local interactions, and have applications ranging from neural networks to ecosystem dynamics. The spectral characteristics of these matrices provide crucial information on system stability and susceptibility, however, their study is greatly complicated by the twin challenges of a lack of symmetry and a sparse interaction structure. In this review we provide a concise and systematic introduction to the main tools and results in this field. We show how the spectra of sparse non-Hermitian matrices can be computed via an analogy with infinite dimensional operators obeying certain recursion relations. With reference to three illustrative examples -- adjacency matrices of regular oriented graphs, adjacency matrices of oriented Erdős-Rényi graphs, and adjacency matrices of weighted oriented Erdős-Rényi graphs -- we demonstrate the use of these methods to obtain both analytic and numerical results for the spectrum, the spectral distribution, the location of outlier eigenvalues, and the statistical properties of eigenvectors.

cond-mat.stat-mech↗

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.

cond-mat.stat-mech↗