17 March 2014 in Physical Review X
Information, ideas, or diseases spread through interactions between individuals. The temporal pattern of such interactions is known to show ``burstiness,'' but little is known about how it affects large-scale spreading dynamics. Analytic results on a simple model of bursty spreading dynamics provide a rare, but much needed reference point for numerical simulations and empirical data analysis.
4 October 2016 in PLOS ONE
We consider a dynamical model of distress propagation on complex networks, which we apply to the study of financial contagion in networks of banks connected to each other by direct exposures. The model that we consider is an extension of the DebtRank algorithm, recently introduced in the literature. The mechanics of distress propagation is very simple: When a bank suffers a loss, distress propagates to its creditors, who in turn suffer losses, and so on. The original DebtRank assumes that losses are propagated linearly between connected banks. Here we relax this assumption and introduce a one-parameter family of non-linear propagation functions. As a case study, we apply this algorithm to a data-set of 183 European banks, and we study how the stability of the system depends on the non-linearity parameter under different stress-test scenarios. We find that the system is characterized by a transition between a regime where small shocks can be amplified and a regime where shocks do not propagate, and that the overall stability of the system increases between 2008 and 2013.
31 August 2009 in Physical Review Letters
Although most networks in nature exhibit complex topologies, the origins of such complexity remain unclear. We propose a general evolutionary mechanism based on global stability. This mechanism is incorporated into a model of a growing network of interacting agents in which each new agent’s membership in the network is determined by the agent’s effect on the network’s global stability. It is shown that out of this stability constraint complex topological properties emerge in a self-organized manner, offering an explanation for their observed ubiquity in biological networks.
20 August 2015 in Physical Review E
Inhomogeneous temporal processes in natural and social phenomena have been described by bursts that are rapidly occurring events within short time periods alternating with long periods of low activity. In addition to the analysis of heavy-tailed interevent time distributions, higher-order correlations between interevent times, called correlated bursts, have been studied only recently. As the underlying mechanism behind such correlated bursts is far from being fully understood, we devise a simple model for correlated bursts using a self-exciting point process with a variable range of memory. Whether a new event occurs is stochastically determined by a memory function that is the sum of decaying memories of past events. In order to incorporate the noise and/or limited memory capacity of systems, we apply two memory loss mechanisms: a fixed number or a variable number of memories. By analysis and numerical simulations, we find that too much memory effect may lead to a Poissonian process, implying that there exists an intermediate range of memory effect to generate correlated bursts comparable to empirical findings. Our conclusions provide a deeper understanding of how long-range memory affects correlated bursts.
14 November 2017 in Physical Review E
Hierarchical organization is an important, prevalent characteristic of complex systems; to understand their organization, the study of the underlying (generally complex) networks that describe the interactions between their constituents plays a central role. Numerous previous works have shown that many real-world networks in social, biologic, and technical systems present hierarchical organization, often in the form of a hierarchy of community structures. Many artificial benchmark graphs have been proposed to test different community detection methods, but no benchmark has been developed to thoroughly test the detection of hierarchical community structures. In this study, we fill this vacancy by extending the Lancichinetti-Fortunato-Radicchi (LFR) ensemble of benchmark graphs, adopting the rule of constructing hierarchical networks proposed by Ravasz and Barabási. We employ this benchmark to test three of the most popular community detection algorithms and quantify their accuracy using the traditional mutual information and the recently introduced hierarchical mutual information. The results indicate that the Ravasz-Barabási-Lancichinetti-Fortunato-Radicchi (RB-LFR) benchmark generates a complex hierarchical structure constituting a challenging benchmark for the considered community detection methods.
25 November 2019 in Physical Review E
Evidence of critical dynamics has been found recently in both experiments and models of large-scale brain dynamics. The understanding of the nature and features of such a critical regime is hampered by the relatively small size of the available connectome, which prevents, among other things, the determination of its associated universality class. To circumvent that, here we study a neural model defined on a class of small-world networks that share some topological features with the human connectome. We find that varying the topological parameters can give rise to a scale-invariant behavior either belonging to the mean-field percolation universality class or having nonuniversal critical exponents. In addition, we find certain regions of the topological parameter space where the system presents a discontinuous, i.e., noncritical, dynamical phase transition into a percolated state. Overall, these results shed light on the interplay of dynamical and topological roots of the complex brain dynamics.