中文
相关论文

相关论文: Mixing of the exclusion process with small bias

200 篇论文

We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well…

概率论 · 数学 2022-05-03 Nina Gantert , Evita Nestoridi , Dominik Schmid

We study the totally asymmetric simple exclusion process with open boundaries in the high density and the low density phase. In the bulk of the two phases, we show that the process on a segment of length $N$ exhibits cutoff at order $N$,…

概率论 · 数学 2024-05-29 Dor Elboim , Dominik Schmid

We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…

概率论 · 数学 2018-03-14 Luca Avena , Hakan Guldas , Remco van der Hofstad , Frank den Hollander

In this paper we study the mixing time of a biased transpositions shuffle on a set of $N$ cards with $N/2$ cards of two types. For a parameter $0<a \le 1$, one type of card is chosen to transpose with a bias of $\frac{a}{N}$ and the other…

概率论 · 数学 2017-09-12 Megan Bernstein , Nayantara Bhatnagar , Igor Pak

We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the…

概率论 · 数学 2019-03-26 Dominik Schmid

We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…

概率论 · 数学 2018-11-09 Jonathan Hermon , Justin Salez

We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…

概率论 · 数学 2018-06-01 C. Labbé , H. Lacoin

We consider the simple exclusion process in the integer segment $ [1, N]$ with $k\le N/2$ particles and spatially inhomogenous jumping rates. A particle at site $x\in [ 1, N]$ jumps to site $x-1$ (if $x\ge 2$) at rate $1-\omega_x$ and to…

概率论 · 数学 2024-02-20 Hubert Lacoin , Shangjie Yang

We survey recent results concerning the total-variation mixing time of the simple exclusion process on the segment (symmetric and asymmetric) and a continuum analog, the simple random walk on the simplex with an emphasis on cutoff results.…

概率论 · 数学 2021-11-15 Hubert Lacoin

Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then…

概率论 · 数学 2007-05-23 Itai Benjamini , Noam Berger , Christopher Hoffman , Elchanan Mossel

In this paper, we study the mixing time of the simple exclusion process with $k$ particles in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of swapping the contents of the two…

概率论 · 数学 2024-09-26 Shangjie Yang

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the…

概率论 · 数学 2016-02-26 Michael E. Bate , Stephen B. Connor

In this paper, we investigate the mixing time of the simple exclusion process on the circle with $N$ sites, with a number of particle $k(N)$ tending to infinity, both from the worst initial condition and from a typical initial condition. We…

概率论 · 数学 2016-01-05 Hubert Lacoin

We analyze the general biased adjacent transposition shuffle process, which is a well-studied Markov chain on the symmetric group $S_n$. In each step, an adjacent pair of elements $i$ and $j$ are chosen, and then $i$ is placed ahead of $j$…

概率论 · 数学 2025-11-05 Reza Gheissari , Holden Lee , Eric Vigoda

We study the mixing time of the unit-rate zero-range process on the complete graph, in the regime where the number $n$ of sites tends to infinity while the density of particles per site stabilizes to some limit $\rho>0$. We prove that the…

概率论 · 数学 2018-04-13 Mathieu Merle , Justin Salez

We study mixing times for the totally asymmetric simple exclusion process (TASEP) on a circle of length $N$ with $k$ particles. We show that the mixing time is of order $N^2 \min(k,N-k)^{-1/2}$, and that the cutoff phenomenon does not…

概率论 · 数学 2026-01-15 Dominik Schmid , Allan Sly

We consider the biased card shuffling and the Asymmetric Simple Exclusion Process (ASEP) on the segment. We obtain the asymptotic of their mixing times: our result show that these two continuous-time Markov chains display cutoff. Our…

概率论 · 数学 2019-05-09 Cyril Labbé , Hubert Lacoin

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

凝聚态物理 · 物理学 2009-10-28 C. Godreche , J. M. Luck , M. R. Evans , D. Mukamel , S. Sandow , E. R. Speer

The effect of mixture lengths of vehicles on the asymmetric exclusion model is studied using numerical simulations for both open and periodic boundaries in parallel dynamics. Densities are calculated as a function of the injecting rates…

统计力学 · 物理学 2009-11-10 H. Ez-Zahraouy , K. Jetto , A. Benyoussef

We consider Glauber dynamics for the Ising model on the complete graph on $n$ vertices, known as the Curie-Weiss model. It is well-known that the mixing-time in the high temperature regime ($\beta < 1$) has order $n\log n$, whereas the…

概率论 · 数学 2009-11-13 Jian Ding , Eyal Lubetzky , Yuval Peres
‹ 上一页 1 2 3 10 下一页 ›