Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Nestoridi, Evita"'
Autor:
Nestoridi, Evita, Yan, Alan
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 diagonalize the transition matrix of the shuffle and use these eigenvalues
Externí odkaz:
http://arxiv.org/abs/2409.16387
Xavier and Yushi run a ``random race'' as follows. A continuous probability distribution $\mu$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $\mu$ and advances that distance, while Yushi advances
Externí odkaz:
http://arxiv.org/abs/2312.09368
Autor:
Nestoridi, Evita, Schmid, Dominik
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
Externí odkaz:
http://arxiv.org/abs/2307.13577
We 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 a
Externí odkaz:
http://arxiv.org/abs/2304.02588
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 thes
Externí odkaz:
http://arxiv.org/abs/2212.14005
Autor:
Nestoridi, Evita, Olesker-Taylor, Sam
Publikováno v:
Electron. J. Probab. 29: 1-22 (2024)
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
Externí odkaz:
http://arxiv.org/abs/2209.12859
Autor:
Nestoridi, Evita, Peng, Kenny
We study mixing times of the one-sided $k$-transposition shuffle. We prove that this shuffle mixes relatively slowly, even for $k$ big. Using the recent "lifting eigenvectors" technique of Dieker and Saliola and applying the $\ell^2$ bound, we prove
Externí odkaz:
http://arxiv.org/abs/2112.05085
Autor:
Nestoridi, Evita
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 reversibl
Externí odkaz:
http://arxiv.org/abs/2111.03622
Publikováno v:
In Advances in Applied Mathematics April 2024 155
Autor:
Nestoridi, Evita, Sarnak, Peter
We prove that the non-backtracking random walk on Ramanujan graphs with large girth exhibits the fastest possible cutoff with a bounded window.
Comment: 16 pages, the second version fixes some minor typos
Comment: 16 pages, the second version fixes some minor typos
Externí odkaz:
http://arxiv.org/abs/2103.15176