Searcharxiv⌕ Search

arXiv · 2610.12460

Infinite light rays and infinite clusters with infinitely many pivots

Abstract

It is conjectured that in the Lorentz mirror model on $\Z^2$ all trajectories are finite. Quas showed that, almost surely, the two halves of any infinite trajectory, cut at an edge, meet at infinitely many vertices, each of which is pivotal: changing its state can make the trajectory finite. We construct plane graphs on which infinite trajectories exist, and all of them have this property. Given $p\in(0,1)$, we replace each edge of a random one-ended subtree of $\Z^2$ by a number of parallel edges, depending on $p$, that is at most logarithmic in the height of the corresponding descendant tree. The medial graph of the resulting plane multigraph is a factor of the tree, and for the uniform spanning tree it has finite vertex intensity. In the mirror model on this medial graph, with probability $p$ for mirrors along primal edges and any probability $r\in(0,1-p]$ for mirrors along dual edges, infinite trajectories exist, and the two halves of each of them meet infinitely often. The construction rests on Bernoulli percolation: every random one-ended locally finite tree can be decorated in this way such that bond percolation with parameter $p$ is critical and percolates, and every vertex of the infinite cluster has infinitely many pivotal edges. We characterize this property for bond and site percolation and for mirrors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martin P. W. Zerner. 2026-10-08. Infinite light rays and infinite clusters with infinitely many pivots. https://arxiv.org/abs/2610.12460

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Uniqueness and tube property for the Swiss cheese large deviations

We consider the simple random walk on the Euclidean lattice, in three dimensions and higher, conditioned to visit fewer sites than expected, when the deviation from the mean scales like the mean. The associated large deviation principle was first derived in 2001 by van den Berg, Bolthausen and den Hollander in the continuous setting, that is for the volume of a Wiener sausage, and later taken up by Phetpradap in the discrete setting. One of the key ideas in their work is to condition the range of the random walk to a certain skeleton, that is a sub-sequence of the random walk path taken along an appropriate mesoscopic scale. In this paper we prove that (i) the rate function obtained by van den Berg, Bolthausen and den Hollander has a unique minimizer over the set of probability measures modulo shifts, at least for deviations of the range well below the mean, and (ii) the empirical measure of the skeleton converges under the conditioned law, in a certain manner, to this minimizer. To this end we use an adaptation of the topology recently introduced by Mukherjee and Varadhan to compactify the space of probability measures.

math.PR↗

Variational representation and estimates for the free energy of a quenched charged polymer model

Random walks with a disordered self-interaction potential may be used to model charged polymers. In this paper we consider a one-dimensional and directed version of the charged polymer model that was introduced by Derrida, Griffiths and Higgs. We prove new results for the associated quenched free energy, including a variational formula based on a quenched large deviation principle established by Birkner, Greven and den Hollander. We also take the occasion to (i) provide detailed proofs for state-of-the-art results pointing towards the existence of a freezing transition and (ii) proceed with minor corrections for two results previously obtained by the present author with Caravenna, den Hollander and P{é}tr{é}lis for the undirected model.

math.PR↗

Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph

We study pairwise negative correlation for three families of uniform spanning-subgraph measures on the complete graph. In Part~I, we consider the uniform probability measure on connected spanning subgraphs and prove pairwise negative correlation for all sufficiently large complete graphs. In Part~II, we study the uniform measure on spanning forests with a prescribed number of connected components and prove pairwise negative correlation for every fixed number of components when the number of vertices is sufficiently large. In Part~III, we consider connected spanning subgraphs with prescribed excess and establish the analogous result for every fixed excess. The three parts are self-contained and are intended as separate manuscripts.

math.PR↗