Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1310.4926

Abstract Phase-space Networks Describing Reactive Dynamics

A. Provata·E. Panagakou
View original source ↗Read source document ↗Export metadata ↓

Abstract

An abstract network approach is proposed for the description of the dynamics in reactive processes. The phase space of the variables (concentrations in reactive systems) is partitioned into a finite number of segments, which constitute the nodes of the abstract network. Transitions between the nodes are dictated by the dynamics of the reactive process and provide the links between the nodes. These are weighted networks, since each link weight reflects the transition rate between the corresponding states-nodes. With this construction the network properties mirror the dynamics of the underlying process and one can investigate the system properties by studying the corresponding abstract network. As a working example the Lattice Limit Cycle (LLC) model is used. Its corresponding abstract network is constructed and the transition matrix elements are computed via Kinetic (Dynamic) Monte Carlo simulations. For this model it is shown that the degree distribution follows a power law with exponent -1, while the average clustering coefficient $c(N)$ scales with the network size (number of nodes) $N$ as $c(N)\sim N^{-ν}, ν\simeq 1.46$. The computed exponents classify the LLC abstract reactive network into the scale-free networks. This conclusion corroborates earlier investigations demonstrating the formation of fractal spatial patterns in LLC reactive dynamics due to stochasticity and to the clustering of homologous species. The present construction of abstract networks (based on the partition of the phase space) is generic and can be implemented with appropriate adjustments in many dynamical systems and in time series analysis.

Explore related subjects

cond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Provata, E. Panagakou. 2013-10-18. Abstract Phase-space Networks Describing Reactive Dynamics. https://doi.org/10.1016/j.physa.2014.06.063

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↗