Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0605139

Transport on Adaptive Random Lattices

Jelle Ritzerveld·Vincent Icke
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present a new method for the solution of those linear transport processes that may be described by a Master Equation, such as electron, neutron and photon transport, and more exotic variants thereof. We base our algorithm on a Markov process on a Voronoi-Delaunay grid, a nonperiodic lattice which is derived from a random point process that is chosen to optimally represent certain properties of the medium through which the transport occurs. Our grid is locally translation and rotation invariant in the mean. We illustrate our approach by means of a particular example, in which the expectation value of the length of a grid line corresponds to the local mean free path. In this example, the lattice is a direct representation of the `free path space' of the medium. Subsequently, transport is defined as simply moving particles from one node to the next, interactions taking place at each point. We derive the statistical properties of such lattices, describe the limiting behavior, and show how interactions are incorporated as global coefficients. Two elementary linear transport problems are discussed: that of free ballistic transport, and the transport of particles through a scattering medium. We also mention a combination of these two. We discuss the efficiency of our method, showing that it is much faster than most other methods, because the operation count does not scale with the number of sources. (ABRIDGED)

Explore related subjects

cond-mat.stat-mechastro-phcond-mat.mes-hallphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jelle Ritzerveld, Vincent Icke. 2006-07-19. Transport on Adaptive Random Lattices. https://doi.org/10.1103/physreve.74.026704

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↗