Related papers: Mixing of the exclusion process with small bias
We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with…
Missing time-series data is a prevalent problem in many prescriptive analytics models in operations management, healthcare and finance. Imputation methods for time-series data are usually applied to the full panel data with the purpose of…
In classical probability theory, the term "cutoff" describes the property of some Markov chains to jump from (close to) their initial configuration to (close to) completely mixed in a very narrow window of time. We investigate how coherent…
This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…
Size bias occurs famously in waiting-time paradoxes, undesirably in sampling schemes, and unexpectedly in connection with Stein's method, tightness, analysis of the lognormal distribution, Skorohod embedding, infinite divisibility, and…
We resolve a long-standing conjecture of Wilson (2004), reiterated by Oliveira (2016), asserting that the mixing-time of the unit-rate Interchange Process on the $n$-dimensional hypercube is of order $n$. This follows from a sharp…
We consider the asymmetric simple exclusion process confined to the nonnegative integers with an open boundary at 0. The point 0 is connected to a reservoir where particles are injected and ejected at prescribed rates subject to the…
We consider mixing times for the open asymmetric simple exclusion process (ASEP) at the triple point. We show that the mixing time of the open ASEP on a segment of length $N$ for bias parameter $q$ is of order $N^{3/2+\kappa}$ if $1-q…
The exclusive queueing process (EQP) is a generalization of the classical M/M/1 queue. It is equivalent to a totally asymmetric exclusion process (TASEP) of varying length. Here we consider two discrete-time versions of the EQP with…
The best known lower and upper bounds on the mixing time for the random-to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In…
The pipeline of a fair ML practitioner is generally divided into three phases: 1) Selecting a fairness measure. 2) Choosing a model that minimizes this measure. 3) Maximizing the model's performance on the data. In the context of group…
Concerns about algorithmic bias and fairness have increased as artificial intelligence has been incorporated into high-stakes decision-making. Traditional Naive Bayes classifiers, while efficient and interpretable, lack fairness-awareness…
Infinitely many particles of two types ("plus" and "minus") jump randomly along the one-dimensional lattice $\mathbf{Z}_{\varepsilon}=\varepsilon\mathbf{Z}$. Annihillations occur when two particles of different time occupy the same site.…
An agent acquires information dynamically until her belief about a binary state reaches an upper or lower threshold. She can choose any signal process subject to a constraint on the rate of entropy reduction. Strategies are ordered by "time…
Simple exclusion processes for particles moving along two parallel lattices and jumping between them are theoretically investigated for asymmetric rates of transition between the channels. An approximate theoretical approach, that describes…
The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…
In this paper, I relate the phase separation transition in binary hard-core mixtures in the limit of small size ratio to a bond percolation transition. It allows to estimate the critical packing fraction at the transition as a function of…
In balanced allocations, the goal is to place $m$ balls into $n$ bins, so as to minimize the gap (difference of max to average load). The One-Choice process places each ball to a bin sampled independently and uniformly at random. The…
An asymmetric exclusion model on an open chain with random rates for hopping particles, where overtaking is also possible, is studied numerically and by computer simulation. The phase structure of the model and the density profiles near the…
Let $x_1,\ldots,x_n$ be a fixed sequence of real numbers. At each stage, pick two indices $I$ and $J$ uniformly at random and replace $x_I$, $x_J$ by $(x_I+x_J)/2$, $(x_I+x_J)/2$. Clearly all the coordinates converge to…