Related papers: The contact process on dynamical scale-free networ…
We study transient sequential dynamics of evolving dynamical networks, i.e., those having active nodes and links and activity-dependent topology. We show that such networks can generate sequences of metastable cluster states where each…
It has been proposed (Phys. Rev. E {\bf 71}, 026121 (2005)) that unlike the short range contact process, a long-range counterpart may lead to the existence a discontinuous phase transition in one dimension. Aiming at exploring such link,…
Statistical properties of evolving random graphs are analyzed using kinetic theory. Treating the linking process dynamically, structural characteristics such as links, paths, cycles, and components are obtained analytically using the rate…
Critical behavior of the contact process is studied in annealed scale-free networks by mapping it on the random walk problem. We obtain the analytic results for the critical scaling, using the event-driven dynamics approach. These results…
Networks of degrade-and-fire oscillators are elementary models of populations of synthetic gene circuits with negative feedback, which show elaborate phenomenology while being amenable to mathematical analysis. In addition to thorough…
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
The Hubbard chain and spinless fermion chain are paradigms of strongly correlated systems, very well understood using Bethe ansatz, Density Matrix Renormalization Group (DMRG) and field theory/renormalization group (RG) methods. They have…
We introduce a new class of latent process models for dynamic relational network data with the goal of detecting time-dependent structure. Network data are often observed over time, and static network models for such data may fail to…
Topological phases of matter remain a focus of interest due to their unique properties -- fractionalisation, ground state degeneracy, and exotic excitations. While some of these properties can occur in systems of free fermions, their…
The two-species symbiotic contact process (2SCP) is a stochastic process where each vertex of a graph may be vacant or host at most one individual of each species. Vertices with both species have a reduced death rate, representing a…
We give a short and completely elementary method to find the full spectrum of the exclusion process and a nicely limited superset of the spectrum of the interchange process (a.k.a.\ random transpositions) on the complete graph. In the case…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
We study the extinction time $\uptau$ of the contact process on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on $\Z$, then, uniformly over all trees of degree…
We consider the triangle-free process: given an integer n, start by taking a uniformly random ordering of the edges of the complete n-vertex graph K_n. Then, traverse the ordered edges and add each traversed edge to an (initially empty)…
Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
Properties of a contact process in continuum for a system of two type particles one type of which is independent are considered. We study dynamics of the first and second order correlation functions, their asymptotics and dependence on…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
We explore the cooperative behaviour and phase transitions of interacting networks by studying a simplified model consisting of Ising spins placed on the nodes of two coupled Erd\"os-R\'enyi random graphs. We derive analytical expressions…