English
Related papers

Related papers: Limit profiles and cutoff for the Burnside process…

200 papers

In this article, relying on Foster-Lyapunov drift conditions, we establish subexponential upper and lower bounds on the rate of convergence in the $\mathrm{L}^p$-Wasserstein distance for a class of irreducible and aperiodic Markov…

Probability · Mathematics 2022-02-28 Ari Arapostathis , Guodong Pang , Nikola Sandrić

At a typical cusp point of the disordered region in a random tiling model we expect to see a determinantal process called the Pearcey process in the appropriate scaling limit. However, in certain situations another limiting point process…

Probability · Mathematics 2015-12-01 Erik Duse , Kurt Johansson , Anthony Metcalfe

We study three classes of continuous time Markov processes (inclusion process, exclusion process, independent walkers) and a family of interacting diffusions (Brownian energy process). For each model we define a boundary driven process…

Mathematical Physics · Physics 2015-06-12 Gioia Carinci , Cristian Giardina' , Claudio Giberti , Frank Redig

We consider the Symmetric Simple Exclusion Process (SSEP) on the segment with two reservoirs of densities $p, q \in (0,1)$ at the two endpoints. We show that the system exhibits cutoff with a diffusive window, thus confirming a conjecture…

Probability · Mathematics 2022-11-29 Hong-Quan Tran

We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…

Probability · Mathematics 2015-06-26 Balázs Gerencsér

The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a $2^n$-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and,…

Social and Information Networks · Computer Science 2019-01-21 Navid Azizan Ruhi , Christos Thrampoulidis , Babak Hassibi

Given a topologically transitive system on the unit interval, one can investigate the cover time, i.e. time for an orbit to reach certain level of resolution in the repeller. We introduce a new notion of dimension, namely the stretched…

Dynamical Systems · Mathematics 2025-01-03 Boyuan Zhao

Bisimulation metrics are powerful tools for measuring similarities between stochastic processes, and specifically Markov chains. Recent advances have uncovered that bisimulation metrics are, in fact, optimal-transport distances, which has…

Machine Learning · Computer Science 2025-05-26 Sergio Calo , Anders Jonsson , Gergely Neu , Ludovic Schwartz , Javier Segovia-Aguas

Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…

Data Structures and Algorithms · Computer Science 2026-03-26 Anne Driemel , Jan Höckendorff , Ioannis Psarros , Christian Sohler , Di Yue

Consider branching Brownian motion with absorption in which particles move independently as one-dimensional Brownian motions with drift $-\rho$, each particle splits into two particles at rate one, and particles are killed when they reach…

Probability · Mathematics 2024-09-16 Julien Berestycki , Jiaqi Liu , Bastien Mallein , Jason Schweinsberg

We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, such as reachability and full linear temporal logic. The main idea is that we monitor each simulation run on the…

Logic in Computer Science · Computer Science 2016-03-04 Przemysław Daca , Thomas A. Henzinger , Jan Křetínský , Tatjana Petrov

The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…

Probability · Mathematics 2012-11-06 Eyal Lubetzky , Allan Sly

We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such…

Data Structures and Algorithms · Computer Science 2014-09-08 Marek Piotrów

This paper will examine the cutoff for a random process on the hypercube, $\{0, 1\}^L$, closely related to the East Process. In this process, every coordinate has two 1/2-Poisson clocks at each coordinate which add the coordinate to the…

Probability · Mathematics 2021-03-04 Anna Lyubarskaja

We survey existing techniques to bound the mixing time of Markov chains. The mixing time is related to a geometric parameter called conductance which is a measure of edge-expansion. Bounds on conductance are typically obtained by a…

Data Structures and Algorithms · Computer Science 2016-03-07 Venkatesan Guruswami

In this paper, we analyze a two-queue random time-limited Markov modulated polling model. In the first part of the paper, we investigate the fluid version: Fluid arrives at the two queues as two independent flows with deterministic rate.…

Probability · Mathematics 2021-12-10 Stella Kapodistria , Mayank Saxena , Onno Boxma , Offer Kella

The paper is concerned with the equilibrium distribution $\Pi_n$ of the $n$-th element in a sequence of continuous-time density dependent Markov processes on the integers. Under a $(2+\a)$-th moment condition on the jump distributions, we…

Probability · Mathematics 2009-02-06 Sanda N. Socoll , A. D. Barbour

We establish a theorem on bifurcation of limit cycles from a focus boundary equilibrium of an impacting system, which is universally applicable to prove bifurcation of limit cycles from focus boundary equilibria in other types of…

Dynamical Systems · Mathematics 2018-10-17 Oleg Makarenkov , Lakmi Niwanthi Wadippuli

This paper studies one-dimensional Ornstein-Uhlenbeck processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (put at levels 0 and d>0). In the literature they are referred…

Probability · Mathematics 2014-07-03 Gang Huang , Michel Mandjes , Peter Spreij

We find the total variation mixing time of the interchange process on the dumbbell graph (two complete graphs, $K_n$ and $K_m$, connected by a single edge), and show that this sequence of chains exhibits the cutoff phenomenon precisely when…

Probability · Mathematics 2019-08-27 Richárd Patkó , Gábor Pete