Related papers: Loop corrections in spin models through density co…
In this paper we develop adaptive numerical schemes for certain nonlinear variational problems. The discretization of the variational problems is done by representing the solution as a suitable frame decomposition, i.e., a complete, stable,…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
Based on the connection between the Ising model and a correlated percolation model, we calculate the distribution function for the fraction ($c$) of lattice sites in percolating clusters in subgraphs with $n$ percolating clusters, $f_n(c)$,…
Mean-Field is an efficient way to approximate a posterior distribution in complex graphical models and constitutes the most popular class of Bayesian variational approximation methods. In most applications, the mean field distribution…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems of square geometry with…
Motivated by some cutting edge circular data such as from Smart Home technologies and roulette spins from online and casino, we construct some new rich classes of discrete distributions on the circle. We give four new general methods of…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
In this paper, we study the asymptotic behaviour of plane partitions distributed according to a $q^{\text{Volume}}$-weighted Muttalib--Borodin ensemble and its associated discrete point process. We establish a Large Deviation Principle for…
This article is aimed at extending the framework of optimal control techniques to the situation where the control field values are restricted to a finite set. We propose a generalization of the standard GRAPE algorithm suited to this…
This paper introduces Discrete Markov Probabilistic Models (DMPMs), a novel discrete diffusion algorithm for discrete data generation. The algorithm operates in discrete bit space, where the noising process is a continuous-time Markov chain…
Using the asymptotical minimax framework, we examine convergence rates equivalency between a continuous functional deconvolution model and its real-life discrete counterpart over a wide range of Besov balls and for the $L^2$-risk. For this…
The probability distribution of the order parameter is exploited in order to obtain the criticality of magnetic systems. Monte Carlo simulations have been employed by using single spin flip Metropolis algorithm aided by finite-size scaling…
Training neural network models with discrete (categorical or structured) latent variables can be computationally challenging, due to the need for marginalization over large or combinatorial sets. To circumvent this issue, one typically…
We study the 2-dimensional Ising model at critical temperature on a simply connected subset $\Omega_{\delta}$ of the square grid $\delta\mathbb{Z}^{2}$. The scaling limit of the critical Ising model is conjectured to be described by…
For different reversible Markov kernels on finite state spaces, we look for families of probability measures for which the time evolution almost remains in their convex hull. Motivated by signal processing problems and metastability studies…
The increasing demand for larger and higher fidelity simulations has made Adaptive Mesh Refinement (AMR) and unstructured mesh techniques essential to focus compute effort and memory cost on just the areas of interest in the simulation…
Belief propagation (BP) is a message-passing method for solving probabilistic graphical models. It is very successful in treating disordered models (such as spin glasses) on random graphs. On the other hand, finite-dimensional lattice…