Related papers: Mixing times for a constrained Ising process on th…

A new method is presented which allows time averaged density matrices of closed quantum systems to be computed via a constraint overlap maximization. Due to its simplicity, this method can be combined with algorithms based on tensor…

We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature $\beta$ and random boundary conditions $\tau$ whose distribution P either stochastically dominates the extremal plus phase (hence the…

We study an interacting particle process on a finite ring with $L$ sites with at most $K$ particles per site, in which particles hop to nearest neighbors with rates given in terms of $t$-deformed integers and asymmetry parameter $q$, where…

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained,…

For a network of discrete states with a periodically driven Markovian dynamics, we develop an inference scheme for an external observer who has access to some transitions. Based on waiting-time distributions between these transitions, the…

We study a model for a dilute suspension of rod-like particles swimming at constant velocity in a Stokes flow. As the translational diffusivity of the particles decreases, a two-dimensional uniform concentration of randomly aligned…

We study K-processes, which are Markov processes in a denumerable state space, all of whose elements are stable, with the exception of a single state, starting from which the process enters finite sets of stable states with uniform…

A one-dimensional Ising model with nearest neighbour interactions is applied to study compaction processes in granular media. An equivalent particle-hole picture is introduced, with the holes being associated to the domain walls of the…

This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…

We propose a new model based on the Ising model with the aim to study synaptic plasticity phenomena in neural networks. It is today well established in biology that the synapses or connections between certain types of neurons are…

We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…

We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…

We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms.…

Inference in dynamic probabilistic models is a complex task involving expensive operations. In particular, for Hidden Markov Models, the whole state space has to be enumerated for advancing in time. Even states with negligible probabilities…

A zero temperature dynamics of Ising spin glasses and ferromagnets on random graphs of finite connectivity is considered, like granular media these systems have an extensive entropy of metastable states. We consider the problem of what…

Graphs of the most probable transitions for a transition probability matrix, $e^{\tau K}$, i.e., the time evolution matrix of the transition rate matrix $K$ over a finite time interval $\tau$, are considered. We study how the graph…

It is frequently assumed that in the limit of vanishing cooling rate, the glass transition phenomenon becomes a thermodynamic transition at a temperature $T_{K}$. However, with any finite cooling rate, the system falls out of equilibrium at…

We study the mixing time of Glauber dynamics on monotone systems. For monotone systems satisfying the entropic independence condition, we prove a new mixing time comparison result for Glauber dynamics. For concrete applications, we obtain…

We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the…