SearcharxivSearch

arXiv · cond-mat/0302171

Reweighted techniques: definition and asymptotic convergence

Abstract

I define and characterize the reweighted methods, which are techniques used in conjunction with the random series implementation of the Feynman-Kac formula. I prove several convergence results valid for all series representations and then I specialize the results for the Levy-Ciesielski and Wiener-Fourier series. As opposed to the partial averaging method on which they are based, the reweighted techniques do not involve any modification of the physical potential. Rather, the underlying idea is to develop some specialized constructions of the Brownian bridge that enters the Feynman-Kac formula, so as to simulate the partial averaging effect. For the Levy-Ciesielski series representation, I develop a reweighted technique which has o(1/n^2) convergence for potentials having first order Sobolev derivatives. It is suggested that the asymptotic convergence may reach O(1/n^3) for potentials having second order Sobolev derivatives. The method preserves the favorable log(n) scaling for the time necessary to compute a path at a given discretization point. For the Wiener-Fourier series representation, the particular reweighted method designed in the present article is shown to have O(1/n^3) convergence if the potential has second order Sobolev derivatives. The convergence constant has superior dependence with the inverse temperature as compared to the partial averaging method for the same series. Because the expression of the convergence constant does not actually involve the second order derivatives of the potential, it is conjectured that the O(1/n^3) convergence extends to the potentials having first order Sobolev derivatives only.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian Predescu. 2003-02-10. Reweighted techniques: definition and asymptotic convergence. https://arxiv.org/abs/cond-mat/0302171

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