相关论文: Markov Chain Monte Carlo methods for graph refinem…
We consider a hybrid Monte Carlo algorithm which is applicable to lattice theories defined on Lefschetz thimbles. In the algorithm, any point (field configuration) on a thimble is parametrized uniquely by the flow-direction and the…
We present a Monte-Carlo algorithm for the simulation of the all-order strong coupling expansion of the Z2 gauge theory. This random surface ensemble is equivalent to the standard formulation, but allows to measure some quantities, like…
In the thesis we take the split chain approach to analyzing Markov chains and use it to establish fixed-width results for estimators obtained via Markov chain Monte Carlo procedures (MCMC). Theoretical results include necessary and…
We describe regularized methods for image reconstruction and focus on the question of hyperparameter and instrument parameter estimation, i.e. unsupervised and myopic problems. We developed a Bayesian framework that is based on the \post…
An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…
Quantitative long-time entropic convergence and short-time regularization are established for an idealized Hamiltonian Monte Carlo chain which alternatively follows an Hamiltonian dynamics for a fixed time and then partially or totally…
We propose a multilevel Markov chain Monte Carlo (MCMC) method for the Bayesian inference of random field parameters in PDEs using high-resolution data. Compared to existing multilevel MCMC methods, we additionally consider level-dependent…
The Markov chain Monte Carlo method (MCMC), especially the Metropolis-Hastings (MH) algorithm, is a widely used technique for sampling from a target probability distribution $P$ on a state space $\Omega$ and applied to various problems such…
We develop a renormalisation scheme for time--ordered products in interacting field theories on curved spacetimes which consists of an analytic regularisation of Feynman amplitudes and a minimal subtraction of the resulting pole parts. This…
We describe a Monte Carlo procedure for the simulation of dynamically triangulate random surfaces with a boundary (topology of a disk). The algorithm keeps the total number of triangles fixed, while the length of the boundary is allowed to…
We present recent evolutions of the detailed opacity code SCO-RCG which combines statistical modelings of levels and lines with fine-structure calculations. The code now includes the Partially-Resolved-Transition-Array model, which allows…
We introduce a highly-parallelizable architecture for estimating parameters of compact binary coalescence using gravitational-wave data and waveform models. Using a spherical harmonic mode decomposition, the waveform is expressed as a sum…
We further develop the asymptotic analytic approach to the study of scattering diagrams. We do so by analyzing the asymptotic behavior of Maurer-Cartan elements of a differential graded Lie algebra constructed from a (not-necessarily…
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…
We study the phase diagram of the spin-3/2 Blume-Emery-Griffiths model on a honeycomb lattice by Monte Carlo simulations in order to verify the presence of some peculiar features predicted by the effective field theory (EFT) with…
A probabilistic version of the Weisfeiler-Leman algorithm for computing the coherent closure of a colored graph is suggested. The algorithm is Monte Carlo and runs in time $ O(n^{1+\omega}\log^2 n) $, where $ n $ is the number of vertices…
A quantum Monte Carlo algorithm is constructed starting from the standard perturbation expansion in the interaction representation. The resulting configuration space is strongly related to that of the Stochastic Series Expansion (SSE)…
The Monte Carlo calculation of R\'enyi entanglement entropies $S^{}_n$ of interacting fermions suffers from a well-known signal-to-noise problem, even for a large number of situations in which the infamous sign problem is absent. A few…
This paper investigates the fundamental issue of triangulation dependence in spinfoam quantum gravity. It introduces a novel framework, named spinfoam stack, to systematically sum spinfoam amplitudes over an infinite class of 2-complexes.…
A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…