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
Research Subjects
Evita Nestoridi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dominik Schmid
University of Bonn, Bonn, Germany
2 shared publications - Amanda Priestley1 shared publication
- Colin Defant
Department of Mathematics, Harvard University, Cambridge, USA
1 shared publication - Dominik Schmid
University of Bonn, Bonn, Germany
1 shared publication - Nina Gantert
Technical University of Munich (TUM) Munich Germany
1 shared publication - Peter E. Francis
Department of Mathematics Stony Brook University 11794 Stony Brook NY
1 shared publication
Latest Publications
- Open Access
Shuffling via Transpositions
We consider a family of card shuffles of $n$ cards, where the allowed moves involve transpositions corresponding to the Jucys--Murphy elements of $\{S_m\}_{m \leq n}$. We diagonalize the transition matrix of these shuffles. As a special case, we consider the $k$-star transpositions shuffle, a natural interpolation between random transpositions and star transpositions. We proved that the $k$-star transpositions shuffle exhibits total variation cutoff at time $\frac{2n-(k+1)}{2(n-1)}n\log n$ with a window of $\frac{2n-(k+1)}{2(n-1)}n$. Furthermore, we prove that for the case where $k/n \rightarrow 0$ or $1$, this shuffle has the same limit profile as random transpositions, which has been fully determined by Teyssier.Open AccessShuffling via Transpositions
We consider a family of card shuffles of $n$ cards, where the allowed moves involve transpositions corresponding to the Jucys--Murphy elements of $\{S_m\}_{m \leq n}$. We diagonalize the transition matrix of these shuffles. As a special case, we consider the $k$-star transpositions shuffle, a natural interpolation between random transpositions and star transpositions. We proved that the $k$-star transpositions shuffle exhibits total variation cutoff at time $\frac{2n-(k+1)}{2(n-1)}n\log n$ with a window of $\frac{2n-(k+1)}{2(n-1)}n$. Furthermore, we prove that for the case where $k/n \rightarrow 0$ or $1$, this shuffle has the same limit profile as random transpositions, which has been fully determined by Teyssier. - Open Access
Continuity for Limit Profiles of Reversible Markov Chains
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 spectrum of the transition matrix and the cutoff window.
Open AccessContinuity for Limit Profiles of Reversible Markov Chains
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 spectrum of the transition matrix and the cutoff window.
- Open Access
- 23 July 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (8) , 1-64
Approximating the Stationary Distribution of the ASEP with Open Boundaries
We investigate the stationary distribution of asymmetric and weakly asymmetric simple exclusion processes with open boundaries. We project the stationary distribution onto a subinterval, whose size is allowed to grow with the length of the underlying segment. Depending on the boundary parameters of the exclusion process, we provide conditions such that the stationary distribution projected onto a subinterval is close in total variation distance to a product measure.
- 23 July 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (8) , 1-64
Open AccessApproximating the Stationary Distribution of the ASEP with Open Boundaries
We investigate the stationary distribution of asymmetric and weakly asymmetric simple exclusion processes with open boundaries. We project the stationary distribution onto a subinterval, whose size is allowed to grow with the length of the underlying segment. Depending on the boundary parameters of the exclusion process, we provide conditions such that the stationary distribution projected onto a subinterval is close in total variation distance to a product measure.
- Open Access
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Limit profiles 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 ℓ2-bounds, are typically too crude to establish this and there has been a push to develop general techniques [27, 21, 20]. 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≍n. This is a projection of the random-transposition card shuffle, which corresponds to k=n, analysed in [27].
- 1 January 2024
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 29 (none) , 1-22
Open AccessLimit profiles 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 ℓ2-bounds, are typically too crude to establish this and there has been a push to develop general techniques [27, 21, 20]. 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≍n. This is a projection of the random-transposition card shuffle, which corresponds to k=n, analysed in [27].
- Open Access
Leading All The Way
Xavier and Yushi run a ``random race'' as follows. A continuous probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, Xavier wins a valuable prize provided he not only wins the race but leads after every step; that is, $\sum_{i=1}^k \mathbf{X}_i > \sum_{i=1}^k \mathbf{Y}_i$ for all $k = 1,2, \dots, n$. What distribution is best for Xavier, and what then is his probability of getting the prize?Open AccessLeading All The Way
Xavier and Yushi run a ``random race'' as follows. A continuous probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, Xavier wins a valuable prize provided he not only wins the race but leads after every step; that is, $\sum_{i=1}^k \mathbf{X}_i > \sum_{i=1}^k \mathbf{Y}_i$ for all $k = 1,2, \dots, n$. What distribution is best for Xavier, and what then is his probability of getting the prize? - Open Access
Rowmotion Markov Chains
Rowmotion is a certain well-studied bijective operator on the distributive lattice $J(P)$ of order ideals of a finite poset $P$. We introduce the rowmotion Markov chain ${\bf M}_{J(P)}$ by assigning a probability $p_x$ to each $x\in P$ and using these probabilities to insert randomness into the original definition of rowmotion. More generally, we introduce a very broad family of toggle Markov chains inspired by Striker's notion of generalized toggling. We characterize when toggle Markov chains are irreducible, and we show that each toggle Markov chain has a remarkably simple stationary distribution. We also provide a second generalization of rowmotion Markov chains to the context of semidistrim lattices. Given a semidistrim lattice $L$, we assign a probability $p_j$ to each join-irreducible element $j$ of $L$ and use these probabilities to construct a rowmotion Markov chain ${\bf M}_L$. Under the assumption that each probability $p_j$ is strictly between $0$ and $1$, we prove that ${\bf M}_{L}$ is irreducible. We also compute the stationary distribution of the rowmotion Markov chain of a lattice obtained by adding a minimal element and a maximal element to a disjoint union of two chains. We bound the mixing time of ${\bf M}_{L}$ for an arbitrary semidistrim lattice $L$. In the special case when $L$ is a Boolean lattice, we use spectral methods to obtain much stronger estimates on the mixing time, showing that rowmotion Markov chains of Boolean lattices exhibit the cutoff phenomenon.Open AccessRowmotion Markov Chains
Rowmotion is a certain well-studied bijective operator on the distributive lattice $J(P)$ of order ideals of a finite poset $P$. We introduce the rowmotion Markov chain ${\bf M}_{J(P)}$ by assigning a probability $p_x$ to each $x\in P$ and using these probabilities to insert randomness into the original definition of rowmotion. More generally, we introduce a very broad family of toggle Markov chains inspired by Striker's notion of generalized toggling. We characterize when toggle Markov chains are irreducible, and we show that each toggle Markov chain has a remarkably simple stationary distribution. We also provide a second generalization of rowmotion Markov chains to the context of semidistrim lattices. Given a semidistrim lattice $L$, we assign a probability $p_j$ to each join-irreducible element $j$ of $L$ and use these probabilities to construct a rowmotion Markov chain ${\bf M}_L$. Under the assumption that each probability $p_j$ is strictly between $0$ and $1$, we prove that ${\bf M}_{L}$ is irreducible. We also compute the stationary distribution of the rowmotion Markov chain of a lattice obtained by adding a minimal element and a maximal element to a disjoint union of two chains. We bound the mixing time of ${\bf M}_{L}$ for an arbitrary semidistrim lattice $L$. In the special case when $L$ is a Boolean lattice, we use spectral methods to obtain much stronger estimates on the mixing time, showing that rowmotion Markov chains of Boolean lattices exhibit the cutoff phenomenon. - Open Access
- 31 July 2023
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 37 (2) , 1417-1444
Cutoff on Trees is Rare
We study the simple random walk on trees and give estimates on the mixing and relaxation times. Relying on a seminal result by Basu, Hermon and Peres characterizing cutoff on trees, we give geometric criteria that are easy to verify and allow to determine whether the cutoff phenomenon occurs. We provide a general characterization of 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 continuum random tree.
- 31 July 2023
- Published by Springer Nature in Journal of Theoretical Probability
- Vol. 37 (2) , 1417-1444
Open AccessCutoff on Trees is Rare
We study the simple random walk on trees and give estimates on the mixing and relaxation times. Relying on a seminal result by Basu, Hermon and Peres characterizing cutoff on trees, we give geometric criteria that are easy to verify and allow to determine whether the cutoff phenomenon occurs. We provide a general characterization of 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 continuum random tree.
- Open AccessThe $S_k$ shuffle block dynamicsWe introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle these cards according to a permutation chosen uniformly at random from the symmetric group on $k$ elements. We study the total-variation mixing time of the $S_k$ shuffle when the number of cards $N$ goes to infinity, allowing also $k=k(N)$ to grow with $N$. In particular, we show that the cutoff phenomenon occurs when $k=o(N^{\frac{1}{6}})$.Open AccessThe $S_k$ shuffle block dynamicsWe introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle these cards according to a permutation chosen uniformly at random from the symmetric group on $k$ elements. We study the total-variation mixing time of the $S_k$ shuffle when the number of cards $N$ goes to infinity, allowing also $k=k(N)$ to grow with $N$. In particular, we show that the cutoff phenomenon occurs when $k=o(N^{\frac{1}{6}})$.