SearcharxivSearch

arXiv subjects

Yijie Bi

Publications and source records attributed to Yijie Bi.

3 recordsLinked to original sources

One-arm probabilities for the two-dimensional metric-graph and discrete Gaussian free field

We study the one-arm probability in the level-set percolation of the discrete and metric-graph Gaussian free field (GFF) defined on a box with Dirichlet boundary conditions. For the metric-graph case, we establish asymptotic estimates on two one-arm probabilities of interest. For the discrete case, we show up-to-constants bounds on the point-to-bulk probability and demonstrate its difference from the metric-graph case.

math.PR

Asymptotics for the percolation threshold of finitary random interlacements in four and higher dimensions

We establish sharp asymptotic bounds for the critical intensity of the Finitary Random Interlacements (FRI) model in four and higher dimensions with general trajectory length distributions. Our proof reveals that the construction of near-critical FRI clusters in four and higher dimensions is essentially analogous to a Galton-Watson process, whose expected number of offspring corresponds to the capacity of a random walk killed at the given length.

math.PR

Arm events in critical planar loop soups

We establish up-to-constants estimates for arm events in the Brownian loop soup on the 2D metric graph associated with the square lattice. More specifically, we consider two natural geometric events: first, ``bulk'' four-arm events, corresponding to two large connected components of loops getting close to each other; and then, two-arm events in the half-plane, used to estimate the probability that a cluster of loops approaches the boundary. Our proof relies on an estimate by Lupu-Werner [Probab. Theory Related Fields 171(3):775-818, 2018], thanks to the well-known coupling between the loop soup and the Gaussian free field on the metric graph [Lecture Notes in Mathematics, volume 2026, 2011] and [Ann. Probab. 44(3):2117-2146, 2016]. As a consequence, we also obtain up-to-constant upper bounds for the corresponding arm events in the random walk loop soup on the square lattice. In this way, we verify Assumptions 5.7 and 5.11 in arXiv:2409.16273: in a box with side length $N$, this implies the existence of crossings where the Gaussian free field remains below $a\sqrt{\log \log N}$ in absolute value, for some constant $a > 0$ large enough.

math.PR