Searcharxiv⌕ Search

arXiv · math/0608132

Invasion percolation on regular trees

Abstract

We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behavior of its $r$-point function for any $r\geq2$ and of its volume both at a given height and below a given height. We find that while the power laws of the scaling are the same as for the incipient infinite cluster for ordinary percolation, the scaling functions differ. Thus, somewhat surprisingly, the two clusters behave differently; in fact, we prove that their laws are mutually singular. In addition, we derive scaling estimates for simple random walk on the cluster starting from the root. We show that the invasion percolation cluster is stochastically dominated by the incipient infinite cluster. Far above the root, the two clusters have the same law locally, but not globally. A key ingredient in the proofs is an analysis of the forward maximal weights along the backbone of the invasion percolation cluster. These weights decay toward the critical value for ordinary percolation, but only slowly, and this slow decay causes the scaling behavior to differ from that of the incipient infinite cluster.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Omer Angel, Jesse Goodman, Frank den Hollander, Gordon Slade. 2008-04-21. Invasion percolation on regular trees. https://doi.org/10.1214/07-aop346. https://searcharxiv.com/abs/math/0608132

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Approximation of the Lévy-driven stochastic heat equation on the sphere

The stochastic heat equation on the sphere driven by an additive square-integrable Lévy process is approximated by a spectral method in space and forward and backward Euler-Maruyama schemes in time. New sharp regularity results are proven for its solution. The spectral approximation is based on a truncation of the series expansion with respect to the spherical harmonic functions. For a given regularity of the initial condition and two different settings of regularity for the driving noise, strong convergence rates for the spectral approximation and for the Euler-Maruyama methods are proven. Moreover, weak rates of up to twice the strong rates are shown for Wiener noise and for Lévy noise with independent and up to a deterministic decay rate factor identically distributed components, while for general square-integrable Lévy noise the weak rate depends explicitly on the polynomial order of the test function. Numerical simulations confirm the theoretical results.

math.PR↗

A Multivariate Generalized Cox Model for Dependent and Simultaneous Default Times

We propose a framework for dependent default times where each name defaults when an increasing driver crosses an independent unit exponential threshold. As in Gueye and Jeanblanc (2022), the drivers may jump, so defaults may occur at stopping times of the reference filtration, including predictable ones, and a common jump may cause no, one or several simultaneous defaults. For general drivers, we derive the conditional joint survival law by a backward recursion; it is an explicit product of survival functions if and only if, for every set of names, the predictable reduction of the compensator of their first default time is deterministic. If, moreover, defaults avoid predictable stopping times, the law is a fatal shock law with hazards identified from the drivers; predictable default atoms can rule this out. Examples include Lévy subordinators and, with random reductions but explicit laws, Liu's model and shot-noise drivers with memory.

math.PR↗

Concentration Inequalities for Branching Random Walks

Motivated by phase transition problems in CSPs, we prove a more general concentration inequality that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independence nor the martingale property. We further extend it to branching random walks (BRWs), obtaining the first concentration inequality for BRWs.

math.PR↗