Related papers: The Second Phase Transition of the Contact Process…
The contact process is a stochastic process which exhibits a continuous, absorbing-state phase transition in the Directed Percolation (DP) universality class. In this work, we consider a contact process with a bias in conjunction with an…
We explore the two-dimensional generalized contact process with two absorbing states by means of large-scale Monte-Carlo simulations. In part of the phase diagram, an infinitesimal creation rate of active sites between inactive domains is…
Based on numerical simulation and local stability analysis we describe the structure of the phase space of the edge/triangle model of random graphs. We support simulation evidence with mathematical proof of continuity and discontinuity for…
The contact process and the slightly different susceptible-infected-susceptible model are studied on long-range connected networks in the presence of random transition rates by means of a strong disorder renormalization group method and…
We study the nonequilibrium phase transition of the contact process with aperiodic transition rates using a real-space renormalization group as well as Monte-Carlo simulations. The transition rates are modulated according to the generalized…
We study a one-dimensional contact process with two infection parameters, one giving the infection rates at the boundaries of a finite infected region and the other one the rates within that region. We prove that the critical value of each…
We study the contact process on a random bipartite connection hypergraph generated from two Poisson point processes, with mark-dependent connection thresholds. For asymmetric infection rates and asymmetric power law tail decays of the two…
We study a family of random permutation models on the Hamming graph $H(2,n)$ (i.e., the $2$-fold Cartesian product of complete graphs), containing the interchange process and the cycle-weighted interchange process with parameter $\theta >…
A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…
We performed Monte Carlo simulations of the symbiotic contact process on different spatial dimensions ($d$). On the complete and random graphs (infinite dimension), we observe hysteresis cycles and bistable regions, what is consistent with…
The hypothesis of the human brain operation in vicinity of a critical point has been a matter of a hot debate in the recent years. The evidence for a possibility of a naturally occurring phase transition across this critical point was…
In this paper, we study weakly interacting diffusion processes on random graphs. Our main focus is on the properties of the mean-field limit and, in particular, on the nonuniqueness and bifurcation structure of stationary states. By…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
Recently, by introducing the notion of cumulatively merged partition, M\'enard and Singh provide a sufficient condition on graphs ensuring that the critical value of the contact process is positive. In this note, we show that the…
We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…
We study the effects of topological (connectivity) disorder on phase transitions. We identify a broad class of random lattices whose disorder fluctuations decay much faster with increasing length scale than those of generic random systems,…
We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all…
We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…
We consider the following definition of connectivity in $k$-uniform hypergraphs: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We determine the…
We consider a dynamical process on a graph $G$, in which vertices are infected (randomly) at a rate which depends on the number of their neighbours that are already infected. This model includes bootstrap percolation and first-passage…