In this paper, we investigate models of percolation of words on $\mathbb{Z}_+$ with long-range connections. The underlying graph is oriented and constructed according to a sequence of non-negative ranges. In the first model, the sequence of ranges is considered random and, in the second model, deterministic and non-decreasing. In both cases, we establish a phase transition for the occurrence of percolation of all words simultaneously from the origin.
We prove that on the metric graph of $\mathbb{Z}^d$ for $d\in \{3,4,5\}$, clusters of the critical loop soup (or equivalently, clusters of the critical Gaussian free field level-set) admit a scaling limit. To the best of our knowledge, this presents the first scaling limit result for a percolation model on a three-dime...
We prove locality of the critical probability for Bernoulli site percolation on infinite, connected, locally finite, vertex-transitive graphs, under the usual assumption that the critical probabilities stay uniformly below one. The proof develops site-percolation forms of the two-ghost inequality, sharp-threshold and s...
In this paper, we prove that the fluctuations of the graph distance and the effective resistance on the trace of a random walk in four and five dimensions converge in distribution to a stable law. In previous work, the first and second authors proved that the corresponding fluctuations converge to a Gaussian distributi...
A. Adhikari, Izumi Okada, D. Shiraishi· 0 citations
We consider the level sets of the Gaussian free field and the vacant set of random interlacements, both defined on a typical realization of the infinite cluster of supercritical Bernoulli bond percolation on $\mathbb{Z}^d$, $d \geq 3$. We prove that in the entire supercritical regime of Bernoulli bond percolation, both...
Alberto Chiarini, Zhi-Zhou Liu, Maximilian Nitzschner· 0 citations
In this note we present a dimension formula for certain randomized self-similar sets. The self-similar sets we are considering are $d$-dimensional generalizations of rational projections of inhomogeneous sponges: they have overlaps, but the overlapping structure is in some sense well-organized. The randomization happen...
We consider a competition between two independent random walks on a cycle of length $N$. Each vertex is claimed by the walker that visits it first, and remains claimed thereafter. We prove that if the initial distance between the walkers is $d$, then the expected number of edges whose endpoints are claimed by different...
S. Chatterjee, Nadya Nabahi, Grigory Terlov· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
