Related papers: The Second Phase Transition of the Contact Process…
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
We consider a one-dimensional network in which the nodes at Euclidean distance $l$ can have long range connections with a probabilty $P(l) \sim l^{-\delta}$ in addition to nearest neighbour connections. This system has been shown to exhibit…
The possible paralelism existing between phase transitions and fracture in disordered materials, is discussed using the well-known Fiber Bundle Models and a probabilistic approach suited to smooth fluctuations near the critical point. Two…
We consider the behaviour of open quantum systems in dependence on the coupling to one decay channel by introducing the coupling parameter $\alpha$ being proportional to the average degree of overlapping. Under critical conditions, a…
The contact process is a particular case of birth-and-death processes on infinite particle configurations. We consider the contact models on locally compact separable metric spaces. We prove the existence of a one-parameter set of invariant…
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase…
In a system of interacting thin rigid rods of equal length $2 \ell$ on a two-dimensional grid of lattice spacing $a$, we show that there are multiple phase transitions as the coupling strength $\kappa=\ell/a$ and the temperature are varied.…
The contact process is a simple infection spreading model showcasing an out-of-equilibrium phase transition between a macroscopically active and an inactive phase. Such absorbing state phase transitions are often sensitive to the presence…
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…
If we consider the contact process with infection rate $\lambda$ on a random graph on $n$ vertices with power law degree distributions, mean field calculations suggest that the critical value $\lambda_c$ of the infection rate is positive if…
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…
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…
We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…
We study the nonequilibrium phase transition in the two-dimensional contact process on a randomly diluted lattice by means of large-scale Monte-Carlo simulations for times up to $10^{10}$ and system sizes up to $8000 \times 8000$ sites. Our…
We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…
Random Constraint Satisfaction Problems exhibit several phase transitions when their density of constraints is varied. One of these threshold phenomena, known as the clustering or dynamic transition, corresponds to a transition for an…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
In this paper we introduce a contact process on a dynamical long range percolation (CPDLP) defined on a complete graph $(V,\mathcal{E})$. A dynamical long range percolation is a Feller process defined on the edge set $\mathcal{E}$, which…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…