Related papers: A discontinuous phase transition in the threshold-…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…
We study the McKean--Vlasov equation on the finite tori of length scale $L$ in $d$--dimensions. We derive the necessary and sufficient conditions for the existence of a phase transition, which are based on the criteria first uncovered in…
We consider contact processes on the hierarchical group, where sites infect other sites at a rate depending on their hierarchical distance, and sites become healthy with a constant recovery rate. If the infection rates decay too fast as a…
In this paper we are concerned with the contact process with semi-infected state on the complete graph $C_n$ with $n$ vertices. In our model, each vertex is in one of three states that `healthy', `semi-infected' or `wholly-infected'. Only…
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…
We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New particles appear subject to a neighbourhood exclusion…
We consider the problem of `discrete-time persistence', which deals with the zero-crossings of a continuous stochastic process, X(T), measured at discrete times, T = n(\Delta T). For a Gaussian Stationary Process the persistence (no…
Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…
For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the…
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…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We develop a general theory for discontinuous non-equilibrium phase transitions into an absorbing state in the presence of temporal disorder. We focus in two paradigmatic models for discontinuous transitions: the quadratic contact process…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
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…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…