Critical one-arm probabilities for metric-graph loop soups in dimensions d at least3
math.PR
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- (Non-)coincidence of critical parameters for Poisson Zoos and Loop Soup Percolation on $\mathbb{Z^d}$, $d > 4$, and $\mathbb{T}_d$,$ d \ge 3$
- One-arm probabilities for the two-dimensional metric-graph and discrete Gaussian free field
- Arm events in critical planar loop soups
- Super-Brownian limits and the $k$-point function for high-dimensional percolation
- Range convergence and sharp one-arm asymptotics for the critical percolation cluster in high dimensions
- Convergence of $k$-point functions in high dimensional percolation
- Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
- One-arm Probabilities for Metric Graph Gaussian Free Fields below and at the Critical Dimension
- Heterochromatic two-arm probabilities for metric graph Gaussian free fields
- On the gap between cluster dimensions of loop soups on $\mathbb{R}^3$ and the metric graph of $\mathbb{Z}^3$
- Separation and cut edge in macroscopic clusters for metric graph Gaussian free fields
- Cluster volumes for the Gaussian free field on metric graphs
- On loop-soup clusters in three dimensions and higher
- Critical level set percolation for the GFF in $d>6$: comparison principles and some consequences
- Generalized intersection exponents and local cut points for three-dimensional Brownian loop soup
- The ant on loops: Alexander-Orbach conjecture for the critical level set of the Gaussian free field
- Percolation of discrete GFF in dimension two I. Arm events in the random walk loop soup
- Critical long-range percolation III: The upper critical dimension
- Three-dimensional Brownian loop soup clusters
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves