arXiv subjects

Juan G. Restrepo

Publications and source records attributed to Juan G. Restrepo.

At least 37 records · Page 2Linked to original sources

arXiv2022

Greedy optimization for growing spatially embedded oscillatory networks

The coupling of some types of oscillators requires the mediation of a physical link between them, rendering the distance between oscillators a critical factor to achieve synchronization. In this paper we propose and explore a greedy algorithm to grow spatially embedded oscillator networks. The algorithm is constructed in such a way that nodes are sequentially added seeking to minimize the cost of the added links' length and optimize the linear stability of the growing network. We show that, for appropriate parameters, the stability of the resulting network, measured in terms of the dynamics of small perturbations and the correlation length of the disturbances, can be significantly improved with a minimal added length cost. In addition, we analyze numerically the topological properties of the resulting networks and find that, while being more stable, their degree distribution is approximately exponential and independent of the algorithm parameters. Moreover, we find that other topological parameters related with network resilience and efficiency are also affected by the proposed algorithm. Finally, we extend our findings to more general classes of networks with different sources of heterogeneity. Our results are a first step in the development of algorithms for the directed growth of oscillatory networks with desirable stability, dynamical and topological properties.

nlin.AO↗

arXiv2022

Hypergraph assortativity: a dynamical systems perspective

The largest eigenvalue of the matrix describing a network's contact structure is often important in predicting the behavior of dynamical processes. We extend this notion to hypergraphs and motivate the importance of an analogous eigenvalue, the expansion eigenvalue, for hypergraph dynamical processes. Using a mean-field approach, we derive an approximation to the expansion eigenvalue in terms of the degree sequence for uncorrelated hypergraphs. We introduce a generative model for hypergraphs that includes degree assortativity, and use a perturbation approach to derive an approximation to the expansion eigenvalue for assortative hypergraphs. We define the dynamical assortativity, a dynamically sensible definition of assortativity for uniform hypergraphs, and describe how reducing the dynamical assortativity of hypergraphs through preferential rewiring can extinguish epidemics. We validate our results with both synthetic and empirical datasets.

physics.soc-ph↗

arXiv2022

Geometry, Topology and Simplicial Synchronization

Simplicial synchronization reveals the role that topology and geometry have in determining the dynamical properties of simplicial complexes. Simplicial network geometry and topology are naturally encoded in the spectral properties of the graph Laplacian and of the higher-order Laplacians of simplicial complexes. Here we show how the geometry of simplicial complexes induces spectral dimensions of the simplicial complex Laplacians that are responsible for changing the phase diagram of the Kuramoto model. In particular, simplicial complexes displaying a non-trivial simplicial network geometry cannot sustain a synchronized state in the infinite network limit if their spectral dimension is smaller or equal to four. This theoretical result is here verified on the Network Geometry with Flavor simplicial complex generative model displaying emergent hyperbolic geometry. On its turn simplicial topology is shown to determine the dynamical properties of the higher-order Kuramoto model. The higher-orderKuramoto model describes synchronization of topological signals, i.e. phases not only associated to the nodes of a simplicial complexes but associated also to higher-order simplices, including links, triangles and so on. This model displays discontinuous synchronization transitions when topological signals of different dimension and/or their solenoidal and irrotational projections are coupled in an adaptive way.

cond-mat.dis-nn↗

arXiv2021

Stochastic and deterministic dynamics in networks with excitable nodes

The analysis of the dynamics of a large class of excitable systems on locally tree-like networks leads to the conclusion that at $λ=1$ a continuous phase transition takes place, where $λ$ is the largest eigenvalue of the adjacency matrix of the network. This paper is devoted to evaluate this claim for a more general case where the assumption of the linearity of the dynamical transfer function is violated with a non-linearity parameter $β$ which interpolates between stochastic ($β=0$) and deterministic ($β\rightarrow\infty$) dynamics. Our model shows a rich phase diagram with an absorbing state and extended critical and oscillatory regimes separated by transition and bifurcation lines which depend on the initial state. We test initial states with ($\mathbb{I}$) only one initial excited node, ($\mathbb{II}$) a fixed fraction ($10\%$) of excited nodes, for all of which the transition is of first order for $β>0$ with a hysteresis effect and a gap function. For the case ($\mathbb{I}$) in the thermodynamic limit the absorbing state in the only phase for all $λ$ values and $β>0$. We further develop mean-field theories for cases ($\mathbb{I}$) and ($\mathbb{II}$). For case ($\mathbb{II}$) we obtain an analytic one-dimensional map which explains the essential properties of the model, including the hysteresis diagrams and fixed points of the dynamics.

cond-mat.stat-mech↗

arXiv2021

Higher-order simplicial synchronization of coupled topological signals

Simplicial complexes capture the underlying network topology and geometry of complex systems ranging from the brain to social networks. Here we show that algebraic topology is a fundamental tool to capture the higher-order dynamics of simplicial complexes. In particular we consider topological signals, i.e., dynamical signals defined on simplices of different dimension, here taken to be nodes and links for simplicity. We show that coupling between signals defined on nodes and links leads to explosive topological synchronization in which phases defined on nodes synchronize simultaneously to phases defined on links at a discontinuous phase transition. We study the model on real connectomes and on simplicial complexes and network models. Finally, we provide a comprehensive theoretical approach that captures this transition on fully connected networks and on random networks treated within the annealed approximation, establishing the conditions for observing a closed hysteresis loop in the large network limit.

cond-mat.dis-nn↗

arXiv2020

The effect of heterogeneity on hypergraph contagion models

The dynamics of network social contagion processes such as opinion formation and epidemic spreading are often mediated by interactions between multiple nodes. Previous results have shown that these higher-order interactions can profoundly modify the dynamics of contagion processes, resulting in bistability, hysteresis, and explosive transitions. In this paper, we present and analyze a hyperdegree-based mean-field description of the dynamics of the SIS model on hypergraphs, i.e. networks with higher-order interactions, and illustrate its applicability with the example of a hypergraph where contagion is mediated by both links (pairwise interactions) and triangles (three-way interactions). We consider various models for the organization of link and triangle structure, and different mechanisms of higher-order contagion and healing. We find that explosive transitions can be suppressed by heterogeneity in the link degree distribution, when links and triangles are chosen independently, or when link and triangle connections are positively correlated when compared to the uncorrelated case. We verify these results with microscopic simulations of the contagion process and with analytic predictions derived from the mean-field model. Our results show that the structure of higher-order interactions can have important effects on contagion processes on hypergraphs.

physics.soc-ph↗

arXiv2020

Dodge and survive: modeling the predatory nature of dodgeball

The analysis of games and sports as complex systems can give insights into the dynamics of human competition, and has been proven useful in soccer, basketball, and other professional sports. In this paper we present a model for dodgeball, a popular sport in US schools, and analyze it using an ordinary differential equation (ODE) compartmental model and stochastic agent-based game simulations. The ODE model reveals a rich landscape with different game dynamics occurring depending on the strategies used by the teams, which can in some cases be mapped to scenarios in competitive species models. Stochastic agent-based game simulations confirm and complement the predictions of the deterministic ODE models. In some scenarios, game victory can be interpreted as a noise-driven escape from the basin of attraction of a stable fixed point, resulting in extremely long games when the number of players is large. Using the ODE and agent-based models, we construct a strategy to increase the probability of winning.

physics.soc-ph↗

arXiv2019

Control of excitable systems is optimal near criticality

Experiments suggest that cerebral cortex gains several functional advantages by operating in a dynamical regime near the critical point of a phase transition. However, a long-standing criticism of this hypothesis is that critical dynamics are rather noisy, which might be detrimental to aspects of brain function that require precision. If the cortex does operate near criticality, how might it mitigate the noisy fluctuations? One possibility is that other parts of the brain may act to control the fluctuations and reduce cortical noise. To better understand this possibility, here we numerically and analytically study a network of binary neurons. We determine how efficacy of controlling the population firing rate depends on proximity to criticality as well as different structural properties of the network. We found that control is most effective - errors are minimal for the widest range of target firing rates - near criticality. Optimal control is slightly away from criticality for networks with heterogeneous degree distributions. Thus, while criticality is the noisiest dynamical regime, it is also the regime that is easiest to control, which may offer a way to mitigate the noise.

q-bio.NC↗

arXiv2019

Using Machine Learning to Assess Short Term Causal Dependence and Infer Network Links

We introduce and test a general machine-learning-based technique for the inference of short term causal dependence between state variables of an unknown dynamical system from time series measurements of its state variables. Our technique leverages the results of a machine learning process for short time prediction to achieve our goal. The basic idea is to use the machine learning to estimate the elements of the Jacobian matrix of the dynamical flow along an orbit. The type of machine learning that we employ is reservoir computing. We present numerical tests on link inference of a network of interacting dynamical nodes. It is seen that dynamical noise can greatly enhance the effectiveness of our technique, while observational noise degrades the effectiveness. We believe that the competition between these two opposing types of noise will be the key factor determining the success of causal inference in many of the most important application situations.

nlin.AO↗

arXiv2019

Dynamic regulation of resource transport induces criticality in interdependent networks of excitable units

Various functions of a network of excitable units can be enhanced if the network is in the `critical regime', where excitations are, on average, neither damped nor amplified. An important question is how can such networks self-organize to operate in the critical regime. Previously it was shown that regulation via resource transport on a secondary network can robustly maintain the primary network dynamics in a balanced state where activity doesn't grow or decay. Here we show that this inter-network regulation process robustly produces a power-law distribution of activity avalanches, as observed in experiments, over ranges of model parameters spanning orders of magnitude. We also show that the resource transport over the secondary network protects the system against the destabilizing effect of local variations in parameters and heterogeneity in network structure. For homogeneous networks, we derive a reduced 3-dimensional map which reproduces the behavior of the full system.

cond-mat.dis-nn↗

arXiv2019

Competitive Suppression of Synchronization and Non-Monotonic Transitions in Oscillator Communities with Distributed Time Delay

Community structure and interaction delays are common features of ensembles of network coupled oscillators, but their combined effect on the emergence of synchronization has not been studied in detail. We study the transitions between macroscopic states in coupled oscillator systems with community structure and time delays. We show that the combination of these two properties gives rise to non-monotonic transitions, whereby increasing the global coupling strength can both inhibit and promote synchronization, yielding both desynchronization and synchronization transitions. For relatively wide parameter choices we also observe asymmetric suppression of synchronization, where communities compete to suppress one another's synchronization properties until one or more win, totally suppressing the others to effective incoherence. Using the ansatz of Ott and Antonsen we provide analytical descriptions for these transitions that confirm numerical simulations.

nlin.AO↗

arXiv2019

Shattered Time: Can a Dissipative Time Crystal Survive Many-Body Correlations?

We investigate the emergence of a time crystal in a driven-dissipative many-body spin array. In this system the interplay between incoherent spin pumping and collective emission stabilizes a synchronized non-equilibrium steady state which in the thermodynamic limit features a self-generated time-periodic pattern imposed by collective elastic interactions. In contrast to prior realizations where the time symmetry is already broken by an external drive, here it is only spontaneously broken by the elastic exchange interactions and manifest in the two-time correlation spectrum. Employing a combination of exact numerical calculations and a second-order cumulant expansion, we investigate the impact of many-body correlations on the time crystal formation and establish a connection between the regime where it is stable and a slow growth rate of the mutual information, signalling that the time crystal studied here is an emergent semi-classical out-of-equilibrium state of matter. We also confirm the rigidity of the time crystal to single-particle dephasing. Finally, we discuss an experimental implementation using long-lived dipoles in an optical cavity.

quant-ph↗

arXiv2018

Robust entropy requires strong and balanced excitatory and inhibitory synapses

It is widely appreciated that well-balanced excitation and inhibition are necessary for proper function in neural networks. However, in principle, such balance could be achieved by many possible configurations of excitatory and inhibitory strengths, and relative numbers of excitatory and inhibitory neurons. For instance, a given level of excitation could be balanced by either numerous inhibitory neurons with weak synapses, or few inhibitory neurons with strong synapses. Among the continuum of different but balanced configurations, why should any particular configuration be favored? Here we address this question in the context of the entropy of network dynamics by studying an analytically tractable network of binary neurons. We find that entropy is highest at the boundary between excitation-dominant and inhibition-dominant regimes. Entropy also varies along this boundary with a trade-off between high and robust entropy: weak synapse strengths yield high network entropy which is fragile to parameter variations, while strong synapse strengths yield a lower, but more robust, network entropy. In the case where inhibitory and excitatory synapses are constrained to have similar strength, we find that a small, but non-zero fraction of inhibitory neurons, like that seen in mammalian cortex, results in robust and relatively high entropy.

q-bio.NC↗

arXiv2018

Ensemble-based estimates of eigenvector error for empirical covariance matrices

Covariance matrices are fundamental to the analysis and forecast of economic, physical and biological systems. Although the eigenvalues $\{λ_i\}$ and eigenvectors $\{{\bf u}_i\}$ of a covariance matrix are central to such endeavors, in practice one must inevitably approximate the covariance matrix based on data with finite sample size $n$ to obtain empirical eigenvalues $\{\tildeλ_i\}$ and eigenvectors $\{\tilde{\bf u}_i\}$, and therefore understanding the error so introduced is of central importance. We analyze eigenvector error $\|{\bf u}_i - \tilde{\bf u}_i \|^2$ while leveraging the assumption that the true covariance matrix having size $p$ is drawn from a matrix ensemble with known spectral properties---particularly, we assume the distribution of population eigenvalues weakly converges as $p\to\infty$ to a spectral density $ρ(λ)$ and that the spacing between population eigenvalues is similar to that for the Gaussian orthogonal ensemble. Our approach complements previous analyses of eigenvector error that require the full set of eigenvalues to be known, which can be computationally infeasible when $p$ is large. To provide a scalable approach for uncertainty quantification of eigenvector error, we consider a fixed eigenvalue $λ$ and approximate the distribution of the expected square error $r= \mathbb{E}\left[\| {\bf u}_i - \tilde{\bf u}_i \|^2\right]$ across the matrix ensemble for all ${\bf u}_i$ associated with $λ_i=λ$. We find, for example, that for sufficiently large matrix size $p$ and sample size $n>p$, the probability density of $r$ scales as $1/nr^2$. This power-law scaling implies that eigenvector error is extremely heterogeneous---even if $r$ is very small for most eigenvectors, it can be large for others with non-negligible probability. We support this and further results with numerical experiments.

math.ST↗

arXiv2017

Uncovering low dimensional macroscopic chaotic dynamics of large finite size complex systems

In the last decade it has been shown that a large class of phase oscillator models admit low dimensional descriptions for the macroscopic system dynamics in the limit of an infinite number N of oscillators. The question of whether the macroscopic dynamics of other similar systems also have a low dimensional description in the infinite N limit has, however, remained elusive. In this paper we show how techniques originally designed to analyze noisy experimental chaotic time series can be used to identify effective low dimensional macroscopic descriptions from simulations with a finite number of elements. We illustrate and verify the effectiveness of our approach by applying it to the dynamics of an ensemble of globally coupled Landau-Stuart oscillators for which we demonstrate low dimensional macroscopic chaotic behavior with an effective 4-dimensional description. By using this description we show that one can calculate dynamical invariants such as Lyapunov exponents and attractor dimensions. One could also use the reconstruction to generate short-term predictions of the macroscopic dynamics.

nlin.CD↗

arXiv2016

Metabolite transport through glial networks stabilizes the dynamics of learning

Learning and memory are acquired through long-lasting changes in synapses. In the simplest models, such synaptic potentiation typically leads to runaway excitation, but in reality there must exist processes that robustly preserve overall stability of the neural system dynamics. How is this accomplished? Various approaches to this basic question have been considered. Here we propose a particularly compelling and natural mechanism for preserving stability of learning neural systems. This mechanism is based on the global processes by which metabolic resources are distributed to the neurons by glial cells. Specifically, we introduce and study a model comprised of two interacting networks: a model neural network interconnected by synapses which undergo spike-timing dependent plasticity (STDP); and a model glial network interconnected by gap junctions which diffusively transport metabolic resources among the glia and, ultimately, to neural synapses where they are consumed. Our main result is that the biophysical constraints imposed by diffusive transport of metabolic resources through the glial network can prevent runaway growth of synaptic strength, both during ongoing activity and during learning. Our findings suggest a previously unappreciated role for glial transport of metabolites in the feedback control stabilization of neural network dynamics during learning.

q-bio.NC↗

arXiv2015

Synchronization of Interacting Quantum Dipoles

Macroscopic ensembles of radiating dipoles are ubiquitous in the physical and natural sciences. In the classical limit the dipoles can be described as damped-driven oscillators, which are able to spontaneously synchronize and collectively lock their phases. Here we investigate the correspond- ing phenomenon in the quantum regime with arrays of quantized two-level systems coupled via long-range and anisotropic dipolar interactions. Our calculations demonstrate that the dipoles may overcome the decoherence induced by quantum fluctuations and inhomogeneous couplings and evolve to a synchronized steady-state. This steady-state bears much similarity to that observed in classical systems, and yet also exhibits genuine quantum properties such as quantum correlations and quan- tum phase diffusion (reminiscent of lasing). Our predictions could be relevant for the development of better atomic clocks and a variety of noise tolerant quantum devices.

quant-ph↗

arXiv2015

Frequency assortativity can induce chaos in oscillator networks

We investigate the effect of preferentially connecting oscillators with similar frequency to each other in networks of coupled phase oscillators (i.e., frequency assortativity). Using the network Kuramoto model as an example, we find that frequency assortativity can induce chaos in the macroscopic dynamics. By applying a mean-field approximation in combination with the dimension reduction method of Ott and Antonsen, we show that the dynamics can be described by a low dimensional system of equations. We use the reduced system to characterize the macroscopic chaos using Lyapunov exponents, bifurcation diagrams, and time-delay embeddings. Finally, we show that the emergence of chaos stems from the formation of multiple groups of synchronized oscillators, i.e., meta-oscillators.

nlin.CD↗