Related papers: Trapping in complex networks
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…
We study within a paradigmatic model for glassy dynamics, the Barrat-M\'ezard trap model, the effect of a nontrivial network structure in the connectivity among traps. Sparseness of this network has recently been shown to lead to…
We consider a fermion gas on a star graph modeling a quantum wire junction and derive the entanglement entropy of one edge with respect to the rest of the junction. The gas is free in the bulk of the graph, the interaction being localized…
Networks of elastic fibers are ubiquitous in biological systems and often provide mechanical stability to cells and tissues. Fiber reinforced materials are also common in technology. An important characteristic of such materials is their…
Extreme events are emergent phenomena in multi-particle transport processes on complex networks. In practice, such events could range from power blackouts to call drops in cellular networks to traffic congestion on roads. All the earlier…
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
The susceptible--infected--susceptible (SIS) epidemic process on complex networks can show metastability, resembling an endemic equilibrium. In a general setting, the metastable state may involve a large portion of the network, or it can be…
We consider a particle performing a stochastic motion on a one-dimensional lattice with jump widths distributed according to a power-law with exponent $\mu + 1$. Assuming that the walker moves in the presence of a distribution $a(x)$ of…
We study exploration properties of a random walk on a network. For a fully connected network we find that the problem can be mapped to the well known coupon collector problem, thus allowing us to estimate form of $P(S,t)$: the distribution…
We investigate how scale-free (SF) and Erdos-Renyi (ER) topologies affect the interplay between evolvability and robustness of model gene regulatory networks with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006) we…
This article describes a complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values assigned to the nodes. It is shown both analytically and experimentally that the strength…
In a recent Letter [F.C. Santos and J. M. Pacheco Phys. Rev. Lett. \textbf{95}, 098104 (2005)], the scale-free networks are found to be advantageous for the emergence of cooperation. In the present work an evolutionary prisoner's dilemma…
We study the dynamics of excitable integrate-and-fire neurons in a small-world network. At low densities $p$ of directed random connections, a localized transient stimulus results in either self-sustained persistent activity or in a brief…
The problem of a diffusing particle moving among diffusing traps is analyzed in general space dimension d. We consider the case where the traps are initially randomly distributed in space, with uniform density rho, and derive upper and…
A complexity-theoretic approach to studying biological networks is proposed. A simple graph representation is used where molecules (DNA, RNA, proteins and chemicals) are vertices and relations between them are directed and signed…
A novel route to the exponential trapping-time distribution within a solidlike state in water clusters is described. We propose a simple homogeneous network (SHN) model to investigate dynamics on the potential energy networks of water…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
Interactive programming environments are powerful tools for promoting innovative network thinking, teaching science of complexity, and exploring emergent phenomena. This paper reports on our recent development of the deterministic random…
Research on the vulnerability of electric networks with a complex network approach has produced significant results in the last decade, especially for transmission networks. These studies have shown that there are causal relations between…