اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTotal variation cutoff for the flip-transpose top with random shuffle
89
0
0.0
(
0
)
تأليف
Subhajit Ghosh
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a random walk on the hyperoctahedral group $B_n$ generated by the signed permutations of the forms $(i,n)$ and $(-i,n)$ for $1leq ileq n$. We call this the flip-transpose top with random shuffle on $B_n$. We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is of order $nlog n$. We also show that this shuffle exhibits the cutoff phenomenon. In the appendix, we show that a similar random walk on the demihyperoctahedral group $D_n$ also has a cutoff at $left(n-frac{1}{2}right)log n$.
قيم البحث
اقرأ أيضاً
In this paper, we investigate the properties of a random walk on the alternating group $A_n$ generated by $3$-cycles of the form $(i,n-1,n)$ and $(i,n,n-1)$. We call this the transpose top-$2$ with random shuffle. We find the spectrum of the transiti
on matrix of this shuffle. We show that the mixing time is of order $left(n-frac{3}{2}right)log n$ and prove that there is a total variation cutoff for this shuffle.
Let ${G_n}_{1}^{infty}$ be a sequence of non-trivial finite groups, and $widehat{G}_n$ denote the set of all non-isomorphic irreducible representations of $G_n$. In this paper, we study the properties of a random walk on the complete monomial group $
G_nwr S_n$ generated by the elements of the form $(text{e},dots,text{e},g;text{id})$ and $(text{e},dots,text{e},g^{-1},text{e},dots,text{e},g;(i,n))$ for $gin G_n,;1leq i< n$. We call this the warp-transpose top with random shuffle on $G_nwr S_n$. We find the spectrum of the transition probability matrix for this shuffle. We prove that the mixing time for this shuffle is $Oleft(nlog n+frac{1}{2}nlog (|G_n|-1)right)$. We show that this shuffle presents $ell^2$-pre-cutoff at $nlog n+frac{1}{2}nlog (|G_n|-1)$. We also show that this shuffle exhibits $ell^2$-cutoff phenomenon with cutoff time $nlog n+frac{1}{2}nlog (|G_n|-1)$ if $|widehat{G}_n|=o(|G_n|^{delta}n^{2+delta})$ for all $delta>0$. We prove that this shuffle has total variation cutoff at $nlog n+frac{1}{2}nlog (|G_n|-1)$ if $|G_n|=o(n^{delta})$ for all $delta>0$.
In this paper we study bounds for the total variation distance between two second degree polynomials in normal random variables provided that they essentially depend on at least three variables.
The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in [0, infty), is ergodic and irreversible. The sample
paths are piecewise linear deterministic and the whole randomness of the dynamics comes from the jump mechanism. The aim of the present paper is to provide quantitative estimates for the exponential convergence to equilibrium, in terms of the total variation and Wasserstein distances.
The paper provides an estimate of the total variation distance between distributions of polynomials defined on a space equipped with a logarithmically concave measure in terms of the $L^2$-distance between these polynomials.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
