arXiv subjects

Vadim Gorin

Publications and source records attributed to Vadim Gorin.

61 records · Page 4Linked to original sources

arXiv2012

Block characters of the symmetric groups

Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the characters to descent representations and the coinvariant algebra of S(n). The decomposition of extreme block characters into the sum of characters of irreducible representations gives rise to certain limit shape theorems for random Young diagrams. We also study counterparts of the block characters for the infinite symmetric group S(\infty) along with their connection to the Thoma characters of the infinite linear group GL(\infty,q) over a Galois field.

math.RT↗

arXiv2012

Limits of Multilevel TASEP and similar processes

We study the asymptotic behavior of a class of stochastic dynamics on interlacing particle configurations (also known as Gelfand-Tsetlin patterns). Examples of such dynamics include, in particular, a multi-layer extension of TASEP and particle dynamics related to the shuffling algorithm for domino tilings of the Aztec diamond. We prove that the process of reflected interlacing Brownian motions introduced by Warren in \cite{W} serves as a universal scaling limit for such dynamics.

math.PR↗

arXiv2009

q-Distributions on boxed plane partitions

We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of these weights that are related to orthogonal polynomials; they form three two-dimensional families. For distributions from these families we prove two types of results. First, we construct explicit Markov chains that preserve these distributions. In particular, this leads to a relatively simple exact sampling algorithm. Second, we consider a limit when all dimensions of the box grow and plane partitions become large, and prove that the local correlations converge to those of ergodic translation invariant Gibbs measures. For fixed proportions of the box, the slopes of the limiting Gibbs measures (that can also be viewed as slopes of tangent planes to the hypothetical limit shape) are encoded by a single quadratic polynomial.

math-ph↗

arXiv2008

Non-colliding Jacobi processes as limits of Markov chains on Gelfand-Tsetlin graph

We introduce a stochastic dynamics related to the measures that arise in harmonic analysis on the infinite-dimensional unitary group. Our dynamics is obtained as a limit of a sequence of natural Markov chains on Gelfand-Tsetlin graph. We compute finite-dimensional distributions of the limit Markov process, the generator and eigenfunctions of the semigroup related to this process. The limit process can be identified with Doob h-transform of a family of independent diffusions. Space-time correlation functions of the limit process have a determinantal form.

math.PR↗

arXiv2008

Disjointness of representations arising in harmonic analysis on the infinite-dimensional unitary group

We prove pairwise disjointness of representations T_{z,w} of the infinite-dimensional unitary group. These representations provide a natural generalization of the regular representation for the case of "big" group U(\infty). They were introduced and studied by G.Olshanski and A.Borodin. Disjointness of the representations can be reduced to disjointness of certain probability measures on the space of paths in the Gelfand-Tsetlin graph. We prove the latter disjointness using probabilistic and combinatorial methods.

math.RT↗

arXiv2008

Shuffling algorithm for boxed plane partitions

We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of each step involves O((a+b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions. Trajectories of our Markov chains can be viewed as random point configurations in the three-dimensional lattice. We compute the bulk limits of the correlation functions of the resulting random point process on suitable two-dimensional sections. The limiting correlation functions define a two-dimensional determinantal point processes with certain Gibbs properties.

math.CO↗

arXiv2007

Non-intersecting paths and Hahn orthogonal polynomial ensemble

We compute the bulk limit of the correlation functions for the uniform measure on lozenge tilings of a hexagon. The limiting determinantal process is a translation invariant extension of the discrete sine process, which also describes the ergodic Gibbs measure of an appropriate slope.

math.PR↗