Dynamics around the Site Percolation Threshold on High-Dimensional Hypercubic Lattices
Abstract
Recent advances on the glass problem motivate reexamining classical models of percolation. Here, we consider the displacement of an ant in a labyrinth near the percolation threshold on cubic lattices both below and above the upper critical dimension of simple percolation, du=6. Using theory and simulations, we consider the scaling regime part, and obtain that both caging and subdiffusion scale logarithmically for d >= du. The theoretical derivation considers Bethe lattices with generalized connectivity and a random graph model, and employs a scaling analysis to confirm that logarithmic scalings should persist in the infinite dimension limit. The computational validation employs accelerated random walk simulations with a transfer-matrix description of diffusion to evaluate directly the dynamical critical exponents below du as well as their logarithmic scaling above du. Our numerical results improve various earlier estimates and are fully consistent with our theoretical predictions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.