Related papers: Bernoulli Percolation on random Tessellations
We introduce a non-standard model for percolation on the integer lattice $\mathbb Z^2$. Randomly assign to each vertex $a \in \mathbb Z^2$ a potential, denoted $\phi_a$, chosen independently and uniformly from the interval $[0, 1]$. For…
A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite…
We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…
We study random bubble lattices which can be produced by processes such as first order phase transitions, and derive characteristics that are important for understanding the percolation of distinct varieties of bubbles. The results are…
We use scattering theoretic methods to prove strong dynamical and exponential localization for one dimensional, continuum, Anderson-type models with singular distributions; in particular the case of a Bernoulli distribution is covered. The…
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…
In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is…
Random tessellations of the space represent a class of prototype models of heterogeneous media, which are central in several applications in physics, engineering and life sciences. In this work, we investigate the statistical properties of…
There are various models of first passage percolation (FPP) in $\mathbb R^d$. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice $\mathbb Z^d$ to $\mathbb R^d$…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
We prove that if $(G_n)_{n\geq1}=((V_n,E_n))_{n\geq 1}$ is a sequence of finite, vertex-transitive graphs with bounded degrees and $|V_n|\to\infty$ that is at least $(1+\epsilon)$-dimensional for some $\epsilon>0$ in the sense that…
We apply a variation on the methods of Duminil-Copin, Raoufi, and Tassion to establish a new differential inequality applying to both Bernoulli percolation and the Fortuin-Kasteleyn random cluster model. This differential inequality has a…
We study random lattice networks consisting of resistor like and diode like bonds. For investigating the transport properties of these random resistor diode networks we introduce a field theoretic Hamiltonian amenable to renormalization…
We consider translationally-invariant percolation models on $\mathbb{Z}^d$ satisfying the finite energy and the FKG properties. We provide explicit upper bounds on the probability of having two distinct clusters going from the endpoints of…
Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…
We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs as well as random graphs, and investigate their relations to classical percolation theory, more particularly the impact of Bernoulli bond…
The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized"…
We prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.