Related papers: The contact process on dynamical scale-free networ…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
A simple model to study cooperation is the two-species symbiotic contact process (2SCP), in which two different species spread on a graph and interact by a reduced death rate if both occupy the same vertex, representing a symbiotic…
We present an algorithm to grow a graph with scale-free structure of {\it in-} and {\it out-links} and variable wiring diagram in the class of the world-wide Web. We then explore the graph by intentional random walks using local…
The dynamic behaviour of stochastic spreading processes on a network model based on k-regular graphs is investigated. The contact process and the susceptible-infected-susceptible model for the spread of epidemics are considered as prototype…
Epidemic spreading processes in the real world can interact with each other in a cooperative, competitive, or asymmetric way, requiring a description based on coevolution dynamics. Rich phenomena such as discontinuous outbreak transitions…
We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical…
We explore the possibility to interpret as a 'gas' the dynamical self-organized scale-free network recently introduced by Kim et al (2005). The role of 'momentum' of individual nodes is played by the degree of the node, the 'configuration…
The contact process is a non-equilibrium Hamiltonian model that, even in one dimension, lacks an exact solution and has been extensively studied via Monte Carlo simulations, both in steady-state and time-dependent scenarios. Although the…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping,…
The one-dimensional kinetic contact process with parallel update is introduced and studied by Monte Carlo simulations. This process is proposed to describe the plant population replication and epidemic disease spreading among them. The…
The ordinary contact process is used to model the spread of a disease in a population. In this model, each infected individual waits an exponentially distributed time with parameter 1 before becoming healthy. In this paper, we introduce and…
We study first- and second-order phase transitions of ferromagnetic lattice models on scale-free networks, with a degree exponent $\gamma$. Using the example of the $q$-state Potts model we derive a general self-consistency relation within…
We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural…
We introduce a method to prove metastability of the contact process on Erd\H{o}s-R\'enyi graphs and on configuration model graphs. The method relies on uniformly bounding the total infection rate from below, over all sets with a fixed…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…