15 citations · 29 across the 22 of their papers we have counts for
25 papers · 1 filter
Hitting-time mixing for the star transposition shuffle
Vanshika Jain, Evita Nestoridi
We prove a hitting-time analogue of cutoff for the star transposition shuffle on the symmetric group S_n. Let tau be the first time at which every non-top card has been selected. W…
Limit Profiles for Separation Distance
Peter E. Francis, Evita Nestoridi
This paper studies limit profiles for the separation distance. A limit profile records the limiting shape of the distance to stationarity inside the cutoff window, at times of the…
Continuity for Limit Profiles of Reversible Markov Chains
Evita Nestoridi
We prove that the limit profile of a sequence of reversible Markov chains exhibiting total variation cutoff is a continuous function, under a computable condition involving the spe…
Cutoff for the Biased Random Transposition Shuffle
Evita Nestoridi, Alan Yan
In this paper, we study the biased random transposition shuffle, a natural generalization of the classical random transposition shuffle studied by Diaconis and Shahshahani. We diag…
Permutations from Random Walk
Peter E. Francis, Evita Nestoridi, Peter Winkler
Xavier and Yushi run a "random race" as follows. An atomless probability distribution on the real line is chosen. The runners begin at zero. At time Xavier draws $\mathbf{X…
Approximating the stationary distribution of the ASEP with open boundaries
Evita Nestoridi, Dominik Schmid
We investigate the stationary distribution of asymmetric and weakly asymmetric simple exclusion processes with open boundaries. We project the stationary distribution onto a subint…
The shuffle block dynamics
Evita Nestoridi, Amanda Priestley, Dominik Schmid
We introduce and analyze the shuffle on cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the shuffle, we choose uniformly…
Limit Profile for Projections of Random Walks on Groups
Evita Nestoridi, Sam Olesker-Taylor
Establishing cutoff, an abrupt transition from "not mixed" to "well mixed", is a classical topic in the theory of mixing times for Markov chains. Interest has grown recently in det…
Mixing times of one-sided -transposition shuffles
Evita Nestoridi, Kenny Peng, Bryan Wong
We study mixing times of the one-sided -transposition shuffle. We prove that this shuffle mixes relatively slowly, even for big. Using the recent ``lifting eigenvectors'' te…
The Limit Profile of Star Transpositions
Evita Nestoridi
We prove that the limit profile of star transpositions at time is equal to . We prove this by developing…
Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
Evita Nestoridi, Peter Sarnak
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
Cutoff on trees is rare
Nina Gantert, Evita Nestoridi, Dominik Schmid
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric cri…
The random walk on upper triangular matrices over
Evita Nestoridi, Allan Sly
We study a natural random walk on the upper triangular matrices, with entries in , generated by steps which add or subtract a uniformly random…
Limit Profiles for Reversible Markov Chains
Evita Nestoridi, Sam Olesker-Taylor
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profil…
Mixing times for the simple exclusion process with open boundaries
Nina Gantert, Evita Nestoridi, Dominik Schmid
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…
On the spectrum of random walks on complete finite -ary trees
Evita Nestoridi, Oanh Nguyen
In the present paper, we determine the full spectrum of the simple random walk on finite, complete -ary trees. We also find an eigenbasis for the transition matrix. As an applic…
On the mixing time of the Diaconis--Gangolli random walk on contingency tables over
Evita Nestoridi, Oanh Nguyen
The Diaconis--Gangolli random walk is an algorithm that generates an almost uniform random graph with prescribed degrees. In this paper, we study the mixing time of the Diaconis--G…
Cutoff for the cyclic adjacent transposition shuffle
Danny Nam, Evita Nestoridi
We study the cyclic adjacent transposition (CAT) shuffle of cards, which is a systematic scan version of the random adjacent transposition (AT) card shuffle. In this paper, we…
Cutoff for the Bernoulli-Laplace urn model with swaps
Alexandros Eskenazis, Evita Nestoridi
We study the mixing time of the Bernoulli--Laplace urn model, where . Consider two urns, each containing balls, so that when combined they have pr…
Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
Evita Nestoridi
This paper studies Markov chains on the chambers of real hyperplane arrangements, a model that generalizes famous examples, such as the Tsetlin library and riffle shuffles. We disc…
Cutoff for random to random card shuffle
Megan Bernstein, Evita Nestoridi
In this paper, we use the eigenvalues of the random to random card shuffle to prove a sharp upper bound for the total variation mixing time. Combined with the lower bound due to Su…
Super-character theory and comparison arguments for a random walk on the upper triangular matrices
Evita Nestoridi
Consider the random walk on the upper triangular matrices with ones on the diagonal and elements over where we pick a row at random and either add it or…
Shuffling large decks of cards and the Bernoulli-Laplace urn model
Evita Nestoridi, Graham White
In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: how can a human (as opposed to a computer) shuff…
Random walks on hyperplane arrangements and stopping times
Evita Nestoridi
Consider a real hyperplane arrangement and let denote the occurring chambers. Bidigare, Hanlon and Rockmore introduced a Markov chain on which is a gene…