Related papers: Cutoff for the noisy voter model
Sampling uniform simple graphs with power-law degree distributions with degree exponent $\tau\in(2,3)$ is a non-trivial problem. We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model…
Stochastic time-varying optimization is an integral part of learning in which the shape of the function changes over time in a non-deterministic manner. This paper considers multiple models of stochastic time variation and analyzes the…
This paper studies the exponential stability of random matrix products driven by a general (possibly unbounded) state space Markov chain. It is a cornerstone in the analysis of stochastic algorithms in machine learning (e.g. for parameter…
We study a nonlinear coevolving voter model with triadic closure local rewiring. We find three phases with different topological properties and configuration in the steady state: absorbing consensus phase with a single component, absorbing…
This paper gives a necessary and sufficient condition for a sequence of birth and death chains to converge abruptly to stationarity, that is, to present a cut-off. The condition involves the notions of spectral gap and mixing time. Y. Peres…
The two-state model of stochastic resonance is extended to a chain of coupled two-state elements governed by the dynamics of Glauber's stochastic Ising model. Appropriate assumptions on the model parameters turn the chain into a prototype…
The theoretical description of synchronization phenomena often relies on coupled units of continuous time noisy Markov chains with a small number of states in each unit. It is frequently assumed, either explicitly or implicitly, that…
The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…
We consider the herding to non-herding transition caused by idiosyncratic choices or imperfect imitation in the context of the Kirman Model for financial markets, or equivalently the Noisy Voter Model for opinion formation. In these…
This paper presents algorithms for identifying and reducing a dedicated set of controllable transition rates of a state-labelled continuous-time Markov chain model. The purpose of the reduction is to make states to satisfy a given…
We study the mixing time of systematic scan Glauber dynamics Ising model on the complete graph. On the complete graph $K_n$, at each time, $k \leq n$ vertices are chosen uniformly random and are updated one by one according to the uniformly…
We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This…
We consider an ensemble of coupled nonlinear noisy oscillators demonstrating in the thermodynamic limit an Ising-type transition. In the ordered phase and for finite ensembles stochastic flips of the mean field are observed with the rate…
Linear two-timescale stochastic approximation (SA) scheme is an important class of algorithms which has become popular in reinforcement learning (RL), particularly for the policy evaluation problem. Recently, a number of works have been…
We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain $M$ on a state space $\Omega$ with stationary distribution $\pi$ and a monotone set $A \subset \Omega$. We consider the chain…
We consider the selection of prediction models for Markovian time series. For this purpose, we study the theoretical properties of the hold-out method. In the econometrics literature, the hold-out method is called out-of-sample and is the…
In this article, we provide detailed analysis of the long-time behavior of the underdamped Langevin dynamics. We first provide a necessary condition guaranteeing that the zero-noise dynamical system converges to its unique attractor. We…
By viewing the $N$-simplex as the set of positions of $N-1$ ordered particles on the unit interval, the adjacent walk is the continuous time Markov chain obtained by updating independently at rate 1 the position of each particle with a…
The convergence rate of a Markov chain to its stationary distribution is typically assessed using the concept of total variation mixing time. However, this worst-case measure often yields pessimistic estimates and is challenging to infer…
We show that a sequence of birth-and-death chains, given by lazy random walks in a (transient) environment (RWRE) on [0; n], exhibits a cutoff in the ballistic regime but does not exhibit a cutoff in the (interior of) the subballistic…