Logarithmic delocalization of random Lipschitz functions on honeycomb and other lattices
Alex M. Karrila

TL;DR
This paper proves that random Lipschitz functions on honeycomb and similar lattices exhibit logarithmic fluctuations, aligning with Gaussian free field behavior, and explores their delocalization and localization properties.
Contribution
It establishes the logarithmic delocalization of random Lipschitz functions on honeycomb lattices for certain parameters, advancing understanding of their fluctuation behavior.
Findings
Logarithmic variance of functions on honeycomb lattices for c between 1 and 2.
Delocalization results consistent with Gaussian free field predictions.
Bounded variance and localization for certain percolation regimes.
Abstract
We study random one-Lipschitz integer functions on the vertices of a finite connected graph, sampled according to the weight where , and restricted by a boundary condition. For planar graphs, this is arguably the simplest ``2D random walk model'', and proving the convergence of such models to the Gaussian free field (GFF) is a major open question. Our main result is that for subgraphs of the honeycomb lattice (and some other cubic planar lattices), with flat boundary conditions and , such functions exhibit logarithmic variations. This is in line with the GFF prediction and improves a non-quantitative delocalization result by P. Lammers. The proof goes via level-set percolation arguments, including a renormalization inequality and a dichotomy theorem…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Theoretical and Computational Physics
