Showing 2026Show all
4 papers · 1 filter
math.PR2026
A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
Zhongyang Li
We construct an approximate sampler for finite doubly free-boundary Macdonald rail-yard processes with Macdonald, boundary, and edge parameters in . The construction allows…
math.CO2026
Self-avoiding walks on cubic graphs and local transformations
Benjamin Grant, Zhongyang Li
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite gra…
math.PR2026
Planar Site Percolation, End Structure, and the Benjamini-Schramm Conjecture
Zhongyang Li
Let be an infinite, connected, locally finite planar graph and consider i.i.d.\ Bernoulli site percolation. Write and for…
math.PR2026
Recursive Packing Bounds for Supercritical Disconnection in Bernoulli Site Percolation
Zhongyang Li
For Bernoulli site percolation on an infinite, connected, locally finite graph , we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mat…