Related papers: Mixing times for a constrained Ising process on th…
Level-sensitive latches are widely used in high- performance designs. For such circuits efficient statistical timing analysis algorithms are needed to take increasing process vari- ations into account. But existing methods solving this…
The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…
We consider the sequence of Gibbs measures of Ising models with Kac interaction defined on a periodic two-dimensional discrete torus near criticality. Using the convergence of the Glauber dynamic proven by H. Weber and J.C. Mourrat and a…
We considerably improve upon the recent result of Martinelli and Toninelli on the mixing time of Glauber dynamics for the 2D Ising model in a box of side $L$ at low temperature and with random boundary conditions whose distribution $P$…
Motivated by the community detection problem in Bayesian inference, as well as the recent explosion of interest in spin glasses from statistical physics, we study the classical Glauber dynamics for sampling from Ising models with sparse…
By analyzing the analogies between the effective system of $N$ spins described by the Ising Hamiltonian and the phenomenon of the self--gravity in mixed particle systems, we show that cooled ions held in a segmented ion trap and exposed to…
We analyze a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network,…
The excess adsorption $\Gamma $ in two-dimensional Ising strips $(\infty \times L)$ subject to identical boundary fields, at both one-dimensional surfaces decaying in the orthogonal direction $j$ as $-h_1j^{-p}$, is studied for various…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…
The classical Schrodinger bridge seeks the most likely probability law for a diffusion process, in path space, that matches marginals at two end points in time; the likelihood is quantified by the relative entropy between the sought law and…
In modern data center networks, thousands of hosts contend for shared link capacity; the scale of these systems makes centralized scheduling impractical. This article models such scheduling as a bipartite matching problem under…
We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…
The statistics of the diffusive motion of particles often serve as an experimental proxy for their interaction with the environment. However, inferring the physical properties from the observed trajectories is challenging. Inspired by a…
In this work we study the stochastic process of two-species coagulation. This process consists in the aggregation dynamics taking place in a ring. Particles and clusters of particles are set in this ring and they can move either clockwise…
We show that a fluid under strong spatially periodic confinement displays a glass transition within mode-coupling theory (MCT) at a much lower density than the corresponding bulk system. We use fluctuating hydrodynamics, with confinement…
We study the phase behavior of a system of charged colloidal particles that are electrostatically bound to an almost flat interface between two fluids. We show that, despite the fact that our experimental system consists of only $10^{3}$ -…
We extract a core principle underlying seemingly different fundamental distributed settings, showing sparsity awareness may induce faster algorithms for problems in these settings. To leverage this, we establish a new framework by…
A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…
The even discrete torus is the graph T_{L,d} on vertex set {0,...,L-1}^d (L even) with two vertices adjacent if they differ by 1 (mod L) on one coordinate. The hard-core measure with activity x on T_{L,d} is the distribution pi_x on the…