SearcharxivSearch

arXiv · 2509.01806

Intermittent localization and fast spatial learning by non-Markov random walks with decaying memory

Abstract

Random walks on lattices with preferential relocation to previously visited sites provide a simple framework for modeling the displacements of animals and humans. When the lattice contains a few impurities or resource sites where the walker spends more time on average at each visit than on the other sites, the long range memory can suppress diffusion and induce by reinforcement a steady state localized around a resource. This phenomenon can be identified with a spatial learning process. Here we study theoretically and numerically how the decay of memory impacts learning in a model with one impurity. If memory decays as $1/\tau$ or slower, where $\tau$ is the time backward into the past, the localized solution is the same as with perfect, non-decaying memory and it is linearly stable. If forgetting is faster than $1/\tau$, for instance exponential, an unusual regime of intermittent localization is observed, where well localized periods of exponentially distributed duration are disrupted by possibly long intervals of diffusive motion. At the transition between the two regimes, for a kernel in $1/\tau$, the approach to the stable localized state is the fastest, opposite to the expected critical slowing down effect. Hence, forgetting can allow the walker to save a lot of memory without compromising learning and to achieve a faster learning process. These findings agree with biological evidence on the benefits of forgetting.

Explore related subjects

Keep this discovery

BibTeXRIS

Paulina R. Martín-Cornejo, Denis Boyer. 2025-09-01. Intermittent localization and fast spatial learning by non-Markov random walks with decaying memory. https://arxiv.org/abs/2509.01806

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

KEEP EXPLORING

Related papers

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

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

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