Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.12853

Dynamically accelerated cover times

Gcina Maziya·Luca Cocconi·Gunnar Pruessner·Nicholas Moloney
View original source ↗Read source document ↗Export metadata ↓

Abstract

Among observables characterising the random exploration of a graph or lattice, the cover time, namely the time to visit every site, continues to attract widespread interest. Much insight about cover times is gained by mapping to the (spaceless) coupon-collector problem, which amounts to ignoring spatio-temporal correlations, and an early conjecture that the limiting cover time distribution of regular random walks on large lattices converges to the Gumbel distribution in $d \geq 3$ was recently proved rigorously. Furthermore, a number of mathematical and numerical studies point to the robustness of the Gumbel universality to modifications of the \textit{spatial} features of the random search processes (e.g.\ introducing persistence and/or intermittence, or changing the graph topology). Here we investigate the robustness of the Gumbel universality to dynamical modification of the \textit{temporal} features of the search, specifically by allowing the random walker to "accelerate" or "decelerate" upon visiting a previously unexplored site. We generalise the mapping mentioned above by relating the statistics of cover times to the roughness of $1/f^\alpha$ Gaussian signals, leading to the conjecture that the Gumbel distribution is but one of a family of cover time distributions, ranging from Gaussian for highly accelerated cover, to exponential for highly decelerated cover. While our conjecture is confirmed by systematic Monte Carlo simulations in dimensions $d > 3$, our results for acceleration in $d=3$ challenge the current understanding of the role of correlations in the cover time problem.

Explore related subjects

cond-mat.stat-mechmath-phmath.MP

Keep this discovery

BibTeXRIS

Gcina Maziya, Luca Cocconi, Gunnar Pruessner, Nicholas Moloney. 2020-04-27. Dynamically accelerated cover times. https://doi.org/10.1103/physrevresearch.2.023421

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

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗
arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗
arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗