Boolean percolation on digraphs and random exchange processes
The paper investigates a long-range Boolean percolation model on directed graphs, which was introduced in [\textit{J. Lamperti}, J. Appl. Probab. 7, 89--98 (1970; Zbl 0196.18801)], and which is defined as follows: Let \(G=(V,E)\) be a directed infinite graph. Consider a collection of i.i.d.~random variables \((Y_x)_{x\in V}\) taking values in \(\mathbb N_0:=\{0,1,\dots\}\) distributed according to some measure \(\mu \) satisfying a non-triviality assumption \(\mu_0 \in (0,1) \). The occupied set \(V_\mu \) of this percolation model is the union of balls with radius given by \(Y_x\)'s, \[ V_\mu = \bigcup_{x\in V}\{y\in V: d(x,y) < Y_x\}, \] where \(d\) is the directed distance on \(G\). The properties of this percolation process are related to the so-called random exchange process which is a Markov chain \((X_n)_{n \ge 0}\) defined by \(X_0 = Y_0\) and \[ X_{n+1} = \max \{X_n -1 , Y_{n+1}\}, \quad n\ge 0, \] where \((Y_n)_{n\ge 0}\) are i.i.d.~with marginal \(\mu \). The connection between the two models is originally due to [\textit{M. P. W. Zerner}, Electron. J. Probab. 23, Paper No. 27, 24 p. (2018; Zbl 1390.60263)]. The main results of the paper can be briefly summarised as follows: 1. When \(V = \mathbb N_0^n \) and \(E\) is the set of all pairs \((x,x+e_j)\) where \((e_j)_{j=1,\dots, n}\) is the usual basis of \(\mathbb R^n\), then the set of unoccupied vertices is a.s.~finite iff \((X_n)_{n\ge 0}\) is transient. The paper also gives a condition on the distribution \(\mu \) which is equivalent to transience: \[ \sum_{m\ge 0} \prod_{k=1}^m \sum_{l=0}^{k-1}\mu_l < \infty. \] 2. When \(V\) is a rooted \(n\)-nary tree with edges directed away from the root, then the occupied set \(V_\mu \) contains a path of infinite length iff the largest eigenvalue of a certain matrix (related to the random exchange process) is larger than \(n^{-1}\). In this case the occupied set contains an infinite number of infinite components. Otherwise, all components of the occupied set are finite. The proof of this result uses a connection to multi-type branching processes. Finally, the paper presents some examples.
- Boolean percolation on doubling graphs
- Characterization of critical values of branching random walks on weighted graphs through infinite-type branching processes
- Continuum Percolation
- Extinction in lower Hessenberg branching processes with countably many types
- scientific article; zbMATH DE number 3146368 (Why is no real title available?)
- scientific article; zbMATH DE number 4009416 (Why is no real title available?)
- scientific article; zbMATH DE number 193944 (Why is no real title available?)
- Maximal branching processes and ‘long-range percolation’
- NIST handbook of mathematical functions
- Noise sensitivity in continuum percolation
- Non-triviality in a totally asymmetric one-dimensional Boolean percolation model on a half-line
- Oil exploration: sequential decisions in the face of uncertainty
- On a general random exchange model
- On the capacity functional of the infinite cluster of a Boolean model
- On the coverage of space by random sets
- RANDOM DYNAMICAL SYSTEMS ON ORDERED TOPOLOGICAL SPACES
- Random Plane Networks
- Random Walks on Infinite Graphs and Groups
- Recurrence and transience of contractive autoregressive processes and related Markov chains
- Rumor processes in random environment on N and on Galton-Watson trees
- Rumor Processes on N
- Rumor processes on \(\mathbb N\) and discrete renewal processes
- Sharpness of the phase transition for continuum percolation in \(\mathbb{R}^2\)
- Stochastic and Integral Geometry
- Subcritical phase of \(d\)-dimensional Poisson-Boolean percolation and its vacant set
- Subcritical regimes in the Poisson Boolean model of continuum percolation
- The cone percolation on \(\mathbb{T}_{d}\)
- The critical branching Markov chain is transient
- The disk-percolation model on graphs
- The rumor percolation model and its variations
- Univariate Discrete Distributions
This page was built for publication: Boolean percolation on digraphs and random exchange processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617593)