Related papers: Limit theorems for 2D invasion percolation
We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…
We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…
We compare the probabilities of arm events in two-dimensional invasion percolation to those in critical percolation. Arm events are defined by the existence of a prescribed color sequence of invaded and non-invaded connections from the…
In this paper we prove that, under certain conditions, a strong law of large numbers holds for a class of super-diffusions $X$ corresponding to the evolution equation $\partial_t u_t=L u_t+\beta u_t-\psi(u_t)$ on a bounded domain $D$ in…
In this paper we obtain the central limit theorems, moderate deviations and the laws of the iterated logarithm for the energy \[H_n=\sum_{1\le j<k\le n}\omega_j\omega_k1_{\{S_j=S_k\}}\] of the polymer $\{S_1,...,S_n\}$ equipped with random…
Experimental two-phase invasion percolation flow patterns were observed in hydrophobic micro-porous networks designed to model fuel cell specific porous media. In order to mimic the operational conditions encountered in the porous…
Limit theorems of strong law of large numbers and central limit theorem types are obtained for the compositions of independent identically distributed random unitary channels.
A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…
We evaluate the percolation threshold values for a realistic model of continuum segregated systems, where random spherical inclusions forbid the percolating objects, modellized by hard-core spherical particles surrounded by penetrable…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
The lilypond model on a point process in $d$-space is a growth-maximal system of non-overlapping balls centred at the points. We establish central limit theorems for the total volume and the number of components of the lilypond model on a…
Let $r=r(n)$ be a sequence of integers such that $r\leq n$ and let $X_1,\ldots,X_{r+1}$ be independent random points distributed according to the Gaussian, the Beta or the spherical distribution on $\mathbb{R}^n$. Limit theorems for the…
A novel variational method is proposed for calculating the percolation threshold, the real-space structure, and the thermodynamical compressibility of a disordered two-dimensional electron liquid. Its high accuracy is verified against prior…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical percolation clusters of integer-lattices fill…
We derive a central limit theorem for the number of vertices of convex polytopes induced by stationary Poisson hyperplane processes in $\mathbb{R}^d$. This result generalizes an earlier one proved by Paroux [Adv. in Appl. Probab. 30 (1998)…
In this paper we study the macroscopic conduction properties of large but finite binary networks with conducting bonds. By taking a combination of a spectral and an averaging based approach we derive asymptotic formulae for the conduction…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
Invasion percolation is a stochastic growth model that follows a greedy algorithm. After assigning i.i.d. uniform random variables (weights) to all edges of $\mathbb{Z}^d$, the growth starts at the origin. At each step, we adjoin to the…