SearcharxivSearch

arXiv · 2605.04492

Finite-size scaling properties of classical random walk on various two-dimensional lattices

Abstract

We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the classical random walk in the unbiased scenario. We find that the standard deviation of distance travelled by the walker is insensitive to the non-uniformity of the lattice profile leading to diffusive transport even in the finite size lattices. Our study indicates that the mass fractal dimension varies within a window $1.50\pm 0.03$ for all finite-size lattices. A weak ordering within the above window, correlated with the average coordination number, is observed, while Lieb and square lattices yielding the minimum and maximum values, respectively. However, confidence intervals reveal substantial statistical overlap for several lattice pairs even though the lattice profiles vary as far as the average number of connecting bonds and directionality of bonds are concerned. We also study the scaling complexity of the circumference of the closed curve traced by the walker while investigating the hull dimension. We find similar trend for hull fractal dimension as well and that was found to within the window $1.37\pm 0.03$ for finite-size lattices. Within the above window, the ordering remains qualitatively unaltered as compared to mass dimension while the confidence interval rectifies the order quantitatively. The square lattice clearly exhibits the upper bound for hull fractal dimension and the remaining lattices show extensive statistical overlap within the above window. We exhibit a tendency of the mass and hull fractal dimension to reach their thermodynamic values given by Brownian motion when we allow more number of steps within the finite size of the lattice, as confirmed by a data collapse analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nimish Sharma, Tanay Nag. 2026-05-06. Finite-size scaling properties of classical random walk on various two-dimensional lattices. https://doi.org/10.1140/epjb%2Fs10051-026-01169-4

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