Related papers: Constrained-degree percolation in random environme…
Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…
The global phase behavior of the lattice restricted primitive model with nearest neighbor exclusion has been studied by grand canonical Monte Carlo simulations. The phase diagram is dominated by a fluid (or charge-disordered solid) to…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
The percolating phase of whatever random percolation process resembles the confining vacuum of a gauge theory in most respects, with a string tension having a well-behaved continuum limit, a non trivial glueball spectrum and a deconfinement…
The organization of high-dimensional probability spaces is a fundamental problem at the intersection of statistical physics and information theory. Here, we analyze the distributions populating level surfaces of the probability simplex…
We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…
We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with type 1 and type 2 infection, respectively, and the infection…
Systems of particles in a confining potential exhibit a spatially dependent density which fundamentally alters the nature of phase transitions that occur. A specific instance of this situation, which is being extensively explored currently,…
We introduce and solve a model of hardcore particles on a one dimensional periodic lattice which undergoes an active-absorbing state phase transition at finite density. In this model an occupied site is defined to be active if its left…
We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We consider the East model in $\mathbb Z^d$, an example of a kinetically constrained interacting particle system with oriented constraints, together with one of its natural variant. Under any ergodic boundary condition it is known that the…
In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0),…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
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 consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the…
Constrained diffusions in convex polyhedral domains with a general oblique reflection field, and with a diffusion coefficient scaled by a small parameter, are considered. Using an interior Dirichlet heat kernel lower bound estimate for…
We study, on a square lattice, an extension to fully coordinated percolation which we call iterated fully coordinated percolation. In fully coordinated percolation, sites become occupied if all four of its nearest neighbors are also…