Related papers: Constrained-degree percolation in random environme…
We introduce a 3D compact U(1) lattice gauge theory having nonlocal interactions in the temporal direction, and study its phase structure. The model is relevant for the compact QED$_3$ and strongly correlated electron systems like the t-J…
Tracer-media interactions can give rise to transport phenomena beyond classical models; e.g., obstacle pushing can eliminate percolation. We demonstrate that the existing explanation of this effect fails in 3D. We show that confinement is…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
We investigate, using Monte Carlo simulations, the phase diagram of a system of hard rectangles of size $m\times mk$ on a square lattice when the aspect ratio $k$ is a non-integer. The existence of a disordered isotropic phase, a nematic…
We study level-set percolation for the harmonic crystal on $\mathbb{Z}^d$, $d \geq 3$, with uniformly elliptic random conductances. We prove that this model undergoes a non-trivial phase transition at a critical level that is almost surely…
In rotationally constrained percolation models, a site of a percolation cluster could be occupied more than once from different directions due to the nature of the rotational constraint. A state variable $s_i$ is assigned to each lattice…
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…
A conserved lattice gas with random neighbor hopping of active particles is introduced which exhibits a continuous phase transition from an active state to an absorbing non-active state. Since the randomness of the particle hopping breaks…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
Given a hypergraph $\mathcal{H}$, the $\mathcal{H}$-bootstrap process starts with an initial set of infected vertices of $\mathcal{H}$ and, at each step, a healthy vertex $v$ becomes infected if there exists a hyperedge of $\mathcal{H}$ in…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
We investigate first-passage percolation on the lattice $\Z^d$ for dimensions $d \geq 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\tau$. We only assume $\P[\tau=0]0$ is explicit) for the…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a…
Percolation is the simplest fundamental model in statistical mechanics that exhibits phase transitions signaled by the emergence of a giant connected component. Despite its very simple rules, percolation theory has successfully been applied…
In 1999, Zhang proved that, for first passage percolation on the square lattice $\mathbb{Z}^2$ with i.i.d. non-negative edge weights, if the probability that the passage time distribution of an edge $P(t_e = 0) =1/2 $, the critical value…