We study a random graph model which combines properties of the edge percolation model on Z^d and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called "rank 1 case" of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe completely the phase diagram in the case d=1. The phase transition is similar to the classical random graph, it is of the second order. We also find the scaled size of the largest connected component above the phase transition.
We introduce a stochastic model in which adjacent planar regions $A, B$ merge stochastically at some rate $λ(A,B)$, and observe analogies with the well-studied topics of mean-field coagulation and of bond percolation. Do infinite regions appear in finite time? We give a simple condition on $λ$ for this {\em hegemony} property to hold, and another simple condition for it to not hold, but there is a large gap between these conditions, which includes the case $λ(A,B) \equiv 1$. For this case, a non-rigorous analytic argument and simulations suggest hegemony.
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a natural relation to the so-called "rank 1 case" of {\it inhomogeneous} random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on the set of parameters $c\geq 0$ and $0 \leq p<p_c$, where $p_c=p_c(d)$ is the critical probability for the bond percolation on $Z^d$. The phase transition is sim…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging smaller clusters and cumulating their weights. For several classical random weighted graphs, we show that there exists a phase transition regarding the existence of an infinite cluster. The motivation for introducing this partition arises from a connection with the contact process as it roughly describes the geometry of the sets where the process survives for …
The fourfold research proposal regards in particular: critical oriented percolation; random walk limit laws; neural networks with long-range connections; the ant in a labyrinth.
We prove that the critical percolation parameter for Finitary Random Interlacements (FRI) is continuous with respect to the path length parameter $T$. The proof uses a result which is interesting on its own right; equality of natural critical parameters for FRI percolation phase transition.
We show quenched large deviations for the simple random walk on a certain class of percolations with long-range correlations. This class contains the supercritical Bernoulli percolations, the model considered by Drewitz, R'ath and Sapozhnikov and the random-cluster model up to the slab critical point. Our result is an extension of Kubota's result for the supercritical Bernoulli percolations. We also state a shape theorem for the chemical distance, which is an extension of Garet and Marchand's result for the supercritical Bernoulli percolations.
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices we prove a surprisingly simple universal formula for the critical threshold for bond and face percolations on these graphs. Our techniques also permit us to compute off-critical and critical exponents related to percolation clusters such as the volume and the perimeter.
We correct a simple error in Percolation on random Johnson-Mehl tessellations and related models, Probability Theory and Related Fields 140 (2008), 417-468. (See also arXiv:math/0610716)
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is structured as a cascade of finite random subgraphs of (approximate) Erdös-Renyi type. We give a criterion for percolation, and show that percolation takes place along giant components of giant components at the previous level in the cascade of subgraphs for all consecutive hierarchical distances. The proof involves a hierarchy of random graphs with vertices …
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.
We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at least in the case where the drift is along a component of the lattice.
We consider random walk on dynamical percolation on the discrete torus $\mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(\mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation environment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
The aim of this paper is to generalize the well-known asymptotic shape result for first-passage percolation on $\Zd$ to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation model. We prove the convergence of the renormalized set of wet points to a deterministic shape that does not depend on the random environment. As a special case of the previous result, we obtain an asymptotic shape theorem for the chemical distance in supercritical Bernoulli percolation. We also prove a flat edge result. Some various examples are also given…
The non-random fluctuation is one of the central objects in first passage percolation. It was proved in [Shuta Nakajima. Divergence of non-random fluctuation in First Passage Percolation. {\em Electron. Commun. Probab.} 24 (65), 1-13. 2019.] that for a particular asymptotic direction, it diverges in a lattice first passage percolation with an explicit lower bound. In this paper, we discuss the non-random fluctuation in Euclidean first passage percolations and show that it diverges in dimension $d\geq 2$ in this model also. Compared with the result in \cite{N19}, the present result is proved fo…
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 on those trees and obtain a precise weak limit theorem for the sizes of the largest clusters. We also show that the approach developed in this work may be useful for studying percolation on other classes of trees with logarithmic height, for instance, we study also the case of $d$-regular trees.
We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an infinite cluster at criticality. These examples show that two well-known conjectures of Benjamini and Schramm are false when generalised from transitive graphs to unimodular random rooted graphs.
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is likewise determined by the branching number of the tree. Finally, we show that the branching number determines the rate of first-passage percolation on trees, also known as the first-birth problem. Our tech…
We consider the simple random walk on supercritical percolation clusters in the multidimensional cubic lattice. In this model, a quenched large deviation principle holds for the position of the random walk. Its rate function depends on the law of the percolation configuration, and the aim of this paper is to study the continuity of the rate function in the law. To do this, it is useful that the rate function is expressed by the so-called Lyapunov exponent, which is the asymptotic cost paid by the random walk for traveling in a landscape of percolation configurations. In this context, we first …
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in dynamic random environment (RWDRE), where the environment is mixing, non-Markovian and not elliptic. We provide a generalization of results obtained previously by Birkner et al. (2013).
We study a large class of Bernoulli percolation models on random lattices of the half- plane, obtained as local limits of uniform planar triangulations or quadrangulations. We first compute the exact value of the site percolation threshold in the quadrangular case using the so-called peeling techniques. Then, we generalize a result of Angel about the scaling limit of crossing probabilities, that are a natural analogue to Cardy's formula in (non-random) plane lattices. Our main result is that those probabilities are universal, in the sense that they do not depend on the percolation model neithe…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove convergence in distribution of this tree to the genealogical tree of a continuous-state branching process in discrete time. As a corollary we obtain the asymptotic sizes of the largest and next largest percolation clusters, extending thereby a recent work of Bertoin (2014) which deals with cluster sizes in the supercritical regime. In a second part, we show that the…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental model for understanding robustness and spread of epidemics on these networks. From a mathematical perspective, percolation is one of the simplest models that exhibits phase transition, and fascinating features are observed around the critical point. In this thesis, we prove limit theorems about structural properties of the connected components obtained from…
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.
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson-Mehl tessellations, as well as for two-dimensional slices of higher dimensional Voronoi tessellations. Surprisingly, the proof is a little simpler for these more complicated models.
It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z}, \mathbb{Z}^2$, the infinite cluster of percolation with retention parameter $p$, close enough to $1$, is transient.
We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the d-dimensional cubic lattice, and has moments bigger than 1, we investigate upper bounds on the so-called non-random fluctuations of the model. In addition, we give an application of our result to a lower bound for variance of the first passage percolation in the case where the limit shape has flat edges.
For biased random walk on the infinite cluster in supercritical i.i.d.\ percolation on $\Z^2$, where the bias of the walk is quantified by a parameter $β>1$, it has been conjectured (and partly proved) that there exists a critical value $β_c>1$ such that the walk has positive speed when $β<β_c$ and speed zero when $β>β_c$. In this paper, biased random walk on the infinite cluster of a certain translation invariant percolation process on $\Z^2$ is considered. The example is shown to exhibit the opposite behavior to what is expected for i.i.d.\ percolation, in the sense that it has a critical va…
We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument \cite{burton1989density}, develop two frameworks that imply the non-triviality of the phase transition and show that large classes of random tessellations fit into one of these frameworks. Our focus is on a very general approach that goes well beyond the typical Poisson driven models. The most interesting examples might be Voronoi tessellations induced by determinantal processe…
Consider random sequential adsorption on a red/blue chequerboard lattice with arrivals at rate $1$ on the red squares and rate $λ$ on the blue squares. We prove that the critical value of $λ$, above which we get an infinite blue component, is finite and strictly greater than $1$.
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of size $G_n\sim \e^{-c}$, and it follows from a recent result of Schweinsberg \cite{Sch} that $G_n$ has non-gaussian fluctuations. We provide an explanation of this by analyzing the effect of percolation on different phases of the growth of recursive trees. This alternative approach may be useful for studying percolation on other classes of trees, such as for ins…
We study site percolation on uniform quadrangulations of the upper half plane. The main contribution is a method for applying Angel's peeling process, in particular for analyzing an evolving boundary condition during the peeling. Our method lets us obtain rigorous and explicit upper and lower bounds on the percolation threshold $p_\mathrm{c}$, and thus show in particular that $0.5511\leq p_\mathrm{c}\leq 0.5581$. The method can be extended to site percolation on other half-planar maps with the domain Markov property.
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 taking place when the attraction is strong enough. We identify the speed in the former case, and the algebraic rate of escape in the latter case. Finally, we discuss the diffusive behavior in the case of zero drift and weak attraction.
In this article we discuss a set of geometric ideas which shed some light on the question of directed polymer pinning in the presence of bulk disorder. Differing from standard methods and techniques, we transform the problem to a particular dependent percolative system and relate the pinning transition to a percolation transition.
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$. This function is supposed to be increasing, so that the random walk is attracted by bigger clusters. For $f(t)=e^{βt}$ we prove that there is a phase transition in $β$, i.e., the random walk is subdiffusive for large $β$ and is diffusive for small $β$.
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest clusters, extending a recent result for large random recursive trees. The approach relies on the analysis of the asymptotic behavior of branching processes subject to rare neutral mutations, which may be of independent interest.
The sequence of random probability measures $ν_n$ that gives a path of length $n$, $\unsur{n}$ times the sum of the random weights collected along the paths, is shown to satisfy a large deviations principle with good rate function the Legendre transform of the free energy of the associated directed polymer in a random environment. Consequences on the asymptotics of the typical number of paths whose collected weight is above a fixed proportion are then drawn.
The theory of random graphs goes back to the late 1950s when Paul Erdős and Alfréd Rényi introduced the Erdős-Rényi random graph. Since then many models have been developed, and the study of random graph models has become popular for real-life network modelling such as social networks and financial networks. The aim of this overview is to review relevant random graph models for real-life network modelling. Therefore, we analyse their properties in terms of stylised facts of real-life networks.
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for uniformly elliptic divergence form diffusions, hold with constants c_i depending only on p (the percolation probability) and d. The irregular nature of the medium means that the bound for q_t(x,\cdot) holds only for t\ge S_x(ω), where the constant S_x(ω) depends on the percolation configuration ω.
We consider large random planar maps and study the first-passage percolation distance obtained by assigning independent identically distributed lengths to the edges. We consider the cases of quadrangulations and of general planar maps. In both cases, the first-passage percolation distance is shown to behave in large scales like a constant times the usual graph distance. We apply our method to the metric properties of the classical Tutte bijection between quadrangulations with $n$ faces and general planar maps with $n$ edges. We prove that the respective graph distances on the quadrangulation a…
A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees, fringe-balanced trees, digital search trees and random simplex trees. In this work, we study Bernoulli bond percolation on arbitrary split trees of large but finite cardinality $n$. We show for appropriate percolation regimes that depend on the cardinality $n$ of the split tree that there exists a unique giant cluster, the fluctuations of the size of the giant clust…
The continuum random cluster model is a Gibbs modification of the standard boolean model of intensity $z > 0$ and law of radii $Q$. The formal unormalized density is given by $q^{N_{cc}}$ where $q$ is a fixed parameter and $N_{cc}$ is the number of connected components in the random structure. We prove for a large class of parameters that percolation occurs for $z$ large enough and does not occur for $z$ small enough. An application to the phase transition of the Widom-Rowlinson model with random radii is given. Our main tools are stochastic domination properties, a fine study of the interacti…
We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $α\in(1,2]$. We consider the critical Bernoulli bond percolation model on a Boltzmann map in the dilute and generic regimes $α\in (3/2,2]$, and show that the open percolation cluster of the origin is itself a Boltzmann map in the dense regime $α\in (1,3/2)$, with parameter \[α':= \frac{2α+3}{4α-2}.\] This is the counterpart in random planar maps of the duality property $κ\leftrightarrow 16/κ$ of Schramm-Loewner Evolutions …
Last three years have seen new developments in the theory of last passage percolation, which has variety applications to random permutations, random growth and random vicious walks. It turns out that a few class of models have determinant formulas for the probability distribution, which can be analyzed asymptotically. One of the tools for the asymptotic analysis has been the Riemann-Hilbert method. In this paper, we survey the use of Riemann-Hilbert method in the last passage percolation problems.
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two points separated by distance $k$ is of the form $c_k/N^{k(1+δ)}, δ>-1$, with $c_k=C_0+C_1\log k+C_2k^α$, non-negative constants $C_0, C_1, C_2$, and $α>0$. Percolation was proved in Dawson and Gorostiza (2013) for $δ<1$, and for the critical case, $δ=1,C_2>0$, with $α>2$. In this paper we improve the result for the critical case by showing percolation for $…
We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $γ$ such that: for $γ<1$, the random walk is sub-ballistic (i.e. has zero velocity asymptotically), with polynomial escape rate described by $γ$; whereas for $γ>1$, the random walk is ballistic, with non-zero speed in the direction of the bias. They moreover established, under the usual diffusive scaling about the mean distance travelled by the random walk in the direction of th…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a quenched local limit theorem. The latter shows that the quenched transition probabilities of the random walk converge to the annealed transition probabilities reweighted by a function of the medium centred at the target site. This function is the density of the unique measure which is invariant for the point of view of the particle, is absolutely continuous…
We initiate the study on chemical distances of percolation clusters for level sets of two-dimensional discrete Gaussian free fields as well as loop clusters generated by two-dimensional random walk loop soups. One of our results states that the chemical distance between two macroscopic annuli away from the boundary for the random walk loop soup at the critical intensity is of dimension 1 with positive probability. Our proof method is based on an interesting combination of a theorem of Makarov, isomorphism theory and an entropic repulsion estimate for Gaussian free fields in the presence of a h…
Signal-to-interference plus noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted signal powers of the devices of the network are assumed random, i.i.d. and possibly unbounded. Additionally, we assume that the devices form a stationary Cox point process, i.e., a Poisson point process with stationary random intensity measure, in two or higher dimensions. We present the following main results. First, under suitable moment conditions on the si…
