Related papers: The Swendsen-Wang Dynamics on Trees
We characterize the extremal structure for the exact mixing time for random walks on trees $T_{n,d}$ of order $n$ with diameter $d$. Given a graph $G=(V,E)$, let $H(v,\pi)$ denote the expected length of an optimal stopping rule from vertex…
The maximum-entropy sampling problem is a fundamental and challenging combinatorial-optimization problem, with application in spatial statistics. It asks to find a maximum-determinant order-$s$ principal submatrix of an order-$n$ covariance…
To investigate the intrinsic mechanism for mixing enhancement by variable density behaviour, a canonical variable density (VD) mixing extracted from a supersonic streamwise vortex protocol, shock bubble interaction (SBI), is numerically…
Dominant energy subspaces of statistical systems are defined with the help of restrictive conditions on various characteristics of the energy distribution, such as the probability density and the forth order Binder's cumulant. Our analysis…
Consider a balanced non triangular two-color P\'olya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2<sigma <1. The composition vector of both discrete time…
We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…
In this paper, it is shown that if a sequence of resistance metric spaces equipped with measures converges with respect to the local Gromov-Hausdorff-vague topology, and certain non-explosion and metric-entropy conditions are satisfied,…
We study Gibbsian models of unbounded integer-valued spins on trees which possess a symmetry under height-shift. We develop a theory relating boundary laws to gradient Gibbs measures, which applies also in cases where the corresponding…
Schr\"odinger bridges have emerged as an enabling framework for unveiling the stochastic dynamics of systems based on marginal observations at different points in time. The terminology "bridge'' refers to a probability law that suitably…
We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse-graining: This additional…
We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…
We adapted the SWAP molecular dynamics algorithm for use in lattice Ising spin models. We dressed the spins with a randomly distributed length and we alternated long-range spin exchanges with conventional single spin flip Monte Carlo…
This work establishes novel optimum mixing bounds for the Glauber dynamics on the Hard-core and Ising models. These bounds are expressed in terms of the local connective constant of the underlying graph $G$. This is a notion of effective…
A theoretical method for treating collisions in the presence of multiple potentials is developed by employing the Schwinger variational principle. The current treatment agrees with the local (regularized) frame transformation theory and…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…
Hybrid Gibbs samplers represent a prominent class of approximated Gibbs algorithms that utilize Markov chains to approximate conditional distributions, with the Metropolis-within-Gibbs algorithm standing out as a well-known example. Despite…
Sampling-based motion planners perform exceptionally well in robotic applications that operate in high-dimensional space. However, most works often constrain the planning workspace rooted at some fixed locations, do not adaptively reason on…
We investigate an inertial viscosity-type Tseng's extragradient algorithm with a new step size to solve pseudomonotone variational inequality problems in real Hilbert spaces. A strong convergence theorem of the algorithm is obtained without…
The random-cluster model is a unifying framework for studying random graphs, spin systems in physics and random spanning trees. The model is closely related to, though much more general than the classical Ising and Potts models, but its…
We show that mixing for local, reversible dynamics of mean field spin glasses is exponentially slow in the low temperature regime. We introduce a notion of free energy barriers for the overlap, and prove that their existence imply that the…