Topological sampling through windings
نویسندگان
چکیده
We propose a modification of the Hybrid Monte Carlo (HMC) algorithm that overcomes topological freezing two-dimensional $U(1)$ gauge theory with and without fermion content. This includes reversible jumps between sectors$-$winding steps$-$combined standard HMC steps. The full is referred to as winding (wHMC), it shows an improved behaviour autocorrelation time towards continuum limit. find excellent agreement wHMC estimates plaquette susceptibility analytical predictions in pure theory, which are known even at finite $\beta$. also study expectation values fixed sectors using both wHMC, fermions. Even when topology frozen HMC$-$leading significant deviations well non-topological quantities$-$the two algorithms agree on fixed-topology averages. Finally, we briefly compare results those obtained master-field simulations size $L\sim 8 \times 10^3$.
منابع مشابه
Uperieure S Ormale N Ecole Stable Windings Stable Windings Stable Windings
We derive the asymptotic laws of winding numbers for planar isotropic stable L evy processes and walks of index 2 (0; 2).
متن کاملAsymptotic Windings of Horocycles
We analyze the scaling limits of the winding process for horocycles on non-compact hyperbolic surfaces with finite area. Initial conditions with pre-compact forward geodesics have scaling limits with gaussian and Cauchy components. Typical initial conditions have different scaling limits along different subsequences of times, but all such scaling limits can still be described. Some of our resul...
متن کاملSampling and Topological Inference For General Shapes
In many practical situations, the object of study is only known through a finite set of possibly noisy sample points. It is then desirable to try to recover the geometry and the topology of the object from this information. The most obvious example is probably surface reconstruction, where the points are measured on the surface of a real world object. Also, a current research topic in cosmology...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملSampling Hypersurfaces through Diffusion
We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the problem of generating random samples from smooth hypersurfaces that may be represented as the boundary ∂A of a domain A ⊂ R of Euclidean space. A is specified through a membership oracle and we assume access to a blackbox that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Physical Journal C
سال: 2021
ISSN: ['1434-6044', '1434-6052']
DOI: https://doi.org/10.1140/epjc/s10052-021-09677-6