Search arXiv⌕ Search

arXiv · 2609.32314

Continuously varying exponents in the distribution of waiting times in the symmetric exclusion process on a percolation cluster

Abstract

We study the waiting-time distribution of hard-core interacting particles in the symmetric exclusion process on one- and two-dimensional lattices with side branches attached to each lattice site in the steady state. We use numerical simulations together with an approximate analytical treatment of particles trapped in side branches in the steady state. Such a two-dimensional carpet serves as a simplified model for trapping of a supercritical percolation cluster. At high particle densities, the system exhibits strong dynamical heterogeneity, with the distribution of logarithms of waiting times developing well-separated peaks corresponding to particles trapped at different depths from the backbone. We show that the probability that a tagged particle occupies the same position at time $t_0+t$ as at time $t_0$ decays algebraically as $t^{-ω}$, where the exponent $ω$ varies continuously with particle density for densities above a threshold value $ρ^*<1$. We also investigate the correlations between successive waiting times along the trajectory of a tagged particle.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arpan Chatterjee, Kabir Ramola, Deepak Dhar. 2026-09-26. Continuously varying exponents in the distribution of waiting times in the symmetric exclusion process on a percolation cluster. https://arxiv.org/abs/2609.32314

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

KEEP EXPLORING

Related papers

Iterative map with power-law scaling of Gamma-distributed fluctuations related to prime numbers

Prime numbers arise in several contexts beyond number theory, including statistical mechanics, quantum mechanics, and dynamical systems. However, the mechanisms underlying the irregularities of their sequence and their connections to physical systems remain poorly understood. The present work provides further insight into the search for deterministic fingerprints in the prime sequence. To this end, prime gaps at different separation distances are investigated through an empirical analysis. Based on this analysis, a modified local approximation of the Prime Number Theorem is introduced and analyzed empirically, in which the logarithmic gap estimate is evaluated at a midpoint-corrected argument. From this relation an iterative map is obtained that reproduces the classical asymptotic prime spacing at leading order and satisfies an approximate semigroup property. The residual fluctuations are found to follow Gamma distributions rescaled by the correction terms, with a variance exhibiting an approximate power-law scaling in the prime separation distance.

cond-mat.stat-mech↗

Universal Dynamical Response to Slow Driving in Chaotic Systems

We propose a unified perspective on classical and quantum chaos based on the sensitivity of a system's stationary states to slow driving. We probe this sensitivity via the system's susceptibility to the average protocol speed, which we call the ``speed-Fisher information," and relate it to irreversible entropy production in the system. We show that chaotic dynamics manifests as a divergence of the speed-Fisher information with the protocol time, and that this response is controlled by the perturbation's low-frequency spectral weight. This approach to chaos applies to both classical and quantum Hamiltonian systems, and naturally extends to non-Hamiltonian classical flows. We illustrate this framework with simple classical and quantum examples, along with a non-Hamiltonian flow that qualitatively exhibits analogous low-frequency spectral behavior.

cond-mat.stat-mech↗