Evita Nestoridi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Evita Nestoridi has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Sam Olesker-Taylor
Department of Statistics, University of Warwick
3 shared publications - Dominik Schmid
TU Munich Germany
2 shared publications - Nina Gantert
Technical University of Munich (TUM) Munich Germany
2 shared publications - Oanh Nguyen
Department of Mathematics Princeton University USA
2 shared publications - Peter Sarnak
Department of Mathematics and Institute for Advanced Study, Princeton University, USA
2 shared publications - Alexandros Eskenazis
Institut de Mathématiques de Jussieu Sorbonne Université 75252 Paris France
1 shared publication
Latest Publications
- 27 September 2023
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 187 (3-4) , 571-601
The random walk on upper triangular matrices over $\mathbb {Z}/m \mathbb {Z}$- 27 September 2023
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 187 (3-4) , 571-601
The random walk on upper triangular matrices over $\mathbb {Z}/m \mathbb {Z}$- 1 April 2023
- Published by Springer Nature in Combinatorica
- Vol. 43 (2) , 367-384
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs
- 1 April 2023
- Published by Springer Nature in Combinatorica
- Vol. 43 (2) , 367-384
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs
- Open Access
Limit Profile for Projections of Random Walks on Groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or $\ell_2$-bounds, are typically too crude to establish this and there has been a push to develop general techniques. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the $k$-particle interchange process on the complete $n$-graph with $k \asymp n$. This is a projection of the random-transpositions card shuffle, which corresponds to $k = n$, analysed by Teyssier.Open AccessLimit Profile for Projections of Random Walks on Groups
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 determining not only the existence of cutoff and the order of its mixing time and window, but the exact shape, or profile, of the convergence inside the window. Classical techniques, such as coupling or $\ell_2$-bounds, are typically too crude to establish this and there has been a push to develop general techniques. We build upon this work, extending from conjugacy-invariant random walks on groups to certain projections. We exemplify our method by analysing the $k$-particle interchange process on the complete $n$-graph with $k \asymp n$. This is a projection of the random-transpositions card shuffle, which corresponds to $k = n$, analysed by Teyssier. - Open Access
Mixing times for the simple exclusion process with open boundaries
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 as on the rates in the bulk, and show that the process exhibits pre-cutoff and in some cases cutoff. Our main contribution is to study mixing times for the asymmetric simple exclusion process with open boundaries. We show that the order of the mixing time can be linear or exponential in the size of the segment depending on the choice of the boundary parameters, proving a strikingly different (and richer) behavior for the simple exclusion process with open boundaries than for the process on the closed segment. Our arguments combine coupling, second class particle and censoring techniques with current estimates. A novel idea is the use of multi-species particle arguments, where the particles only obey a partial ordering.
Open AccessMixing times for the simple exclusion process with open boundaries
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 as on the rates in the bulk, and show that the process exhibits pre-cutoff and in some cases cutoff. Our main contribution is to study mixing times for the asymmetric simple exclusion process with open boundaries. We show that the order of the mixing time can be linear or exponential in the size of the segment depending on the choice of the boundary parameters, proving a strikingly different (and richer) behavior for the simple exclusion process with open boundaries than for the process on the closed segment. Our arguments combine coupling, second class particle and censoring techniques with current estimates. A novel idea is the use of multi-species particle arguments, where the particles only obey a partial ordering.
- Open Access
The Limit Profile of Star Transpositions
We prove that the limit profile of star transpositions at time $t= n \log n +cn$ is equal to $d_{\text{T.V.}}(\text{Poiss}(1+e^{-c}), \text{Poiss}(1))$. We prove this by developing a technique for comparing the limit profile behavior of two reversible Markov chains on the same space, that share the same stationary distribution and eigenbasis. We then compare the limit profile of star transpositions to the limit profile of random transpositions, as studied in \cite{Teyssier}, and prove that they have the same limit profile at the respective cutoff times.Open AccessThe Limit Profile of Star Transpositions
We prove that the limit profile of star transpositions at time $t= n \log n +cn$ is equal to $d_{\text{T.V.}}(\text{Poiss}(1+e^{-c}), \text{Poiss}(1))$. We prove this by developing a technique for comparing the limit profile behavior of two reversible Markov chains on the same space, that share the same stationary distribution and eigenbasis. We then compare the limit profile of star transpositions to the limit profile of random transpositions, as studied in \cite{Teyssier}, and prove that they have the same limit profile at the respective cutoff times. - Open Access
- 14 July 2021
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 182 (1-2) , 157-188
Limit profiles for reversible Markov chains
In a recent breakthrough, Teyssier (Ann Probab 48(5):2323–2343, 2020) introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques were restricted to conjugacy-invariant random walks on groups; we derive similar approximation lemmas for random walks on homogeneous spaces and for general reversible Markov chains. We illustrate applications of these lemmas to some famous problems: thek-cycle shuffle, sharpening results of Hough (Probab Theory Relat Fields 165(1–2):447–482, 2016) and Berestycki, Schramm and Zeitouni (Ann Probab 39(5):1815–1843, 2011), the Ehrenfest urn diffusion with many urns, sharpening results of Ceccherini-Silberstein, Scarabotti and Tolli (J Math Sci 141(2):1182–1229, 2007), a Gibbs sampler, which is a fundamental tool in statistical physics, with Binomial prior and hypergeometric posterior, sharpening results of Diaconis, Khare and Saloff-Coste (Stat Sci 23(2):151–178, 2008).
- 14 July 2021
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 182 (1-2) , 157-188
Open AccessLimit profiles for reversible Markov chains
In a recent breakthrough, Teyssier (Ann Probab 48(5):2323–2343, 2020) introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques were restricted to conjugacy-invariant random walks on groups; we derive similar approximation lemmas for random walks on homogeneous spaces and for general reversible Markov chains. We illustrate applications of these lemmas to some famous problems: thek-cycle shuffle, sharpening results of Hough (Probab Theory Relat Fields 165(1–2):447–482, 2016) and Berestycki, Schramm and Zeitouni (Ann Probab 39(5):1815–1843, 2011), the Ehrenfest urn diffusion with many urns, sharpening results of Ceccherini-Silberstein, Scarabotti and Tolli (J Math Sci 141(2):1182–1229, 2007), a Gibbs sampler, which is a fundamental tool in statistical physics, with Binomial prior and hypergeometric posterior, sharpening results of Diaconis, Khare and Saloff-Coste (Stat Sci 23(2):151–178, 2008).
- Open Access
Bounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
Open AccessBounded cutoff window for the non-backtracking random walk on Ramanujan Graphs
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
- 28 April 2021
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 503 (1) , 125277
Generalized harmonic functions on trees: Universality and frequent universality
- 28 April 2021
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 503 (1) , 125277
Generalized harmonic functions on trees: Universality and frequent universality
- Open Access
Limit Profiles for Reversible Markov Chains
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 profile for the random transpositions card shuffle. His techniques were restricted to conjugacy-invariant random walks on groups; we derive similar approximation lemmas for random walks on homogeneous spaces and for general reversible Markov chains. We illustrate applications of these lemmas to some famous problems: the $k$-cycle shuffle, improving results of Hough [Hou16] and Berestycki, Schramm and Zeitouni [BSZ11]; the Ehrenfest urn diffusion with many urns, improving results of Ceccherini-Silberstein, Scarabotti and Tolli [CST07]; a Gibbs sampler, which is a fundamental tool in statistical physics, with Binomial prior and hypergeometric posterior, improving results of Diaconis, Khare and Saloff-Coste [DKS08].
Open AccessLimit Profiles for Reversible Markov Chains
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 profile for the random transpositions card shuffle. His techniques were restricted to conjugacy-invariant random walks on groups; we derive similar approximation lemmas for random walks on homogeneous spaces and for general reversible Markov chains. We illustrate applications of these lemmas to some famous problems: the $k$-cycle shuffle, improving results of Hough [Hou16] and Berestycki, Schramm and Zeitouni [BSZ11]; the Ehrenfest urn diffusion with many urns, improving results of Ceccherini-Silberstein, Scarabotti and Tolli [CST07]; a Gibbs sampler, which is a fundamental tool in statistical physics, with Binomial prior and hypergeometric posterior, improving results of Diaconis, Khare and Saloff-Coste [DKS08].
- Open Access
Cutoff on trees is rare
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 criteria, which are easy to verify and allow to determine whether the cutoff phenomenon occurs. We thoroughly discuss families of trees with cutoff, and show how our criteria can be used to prove the absence of cutoff for several classes of trees, including spherically symmetric trees, Galton-Watson trees of a fixed height, and sequences of random trees converging to the Brownian CRT.
Open AccessCutoff on trees is rare
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 criteria, which are easy to verify and allow to determine whether the cutoff phenomenon occurs. We thoroughly discuss families of trees with cutoff, and show how our criteria can be used to prove the absence of cutoff for several classes of trees, including spherically symmetric trees, Galton-Watson trees of a fixed height, and sequences of random trees converging to the Brownian CRT.