Christian Houdré, Hua Xu
The limiting shape of the random Young diagrams associated with an inhomogeneous random word is identified as a multidimensional Brownian functional. This functional is identical in law to the spectrum of a random matrix. The Poissonized word problem is also briefy studied, and the asymptotic behavior of the shape analyzed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The expectation of the descent number of a random Young tableau of a fixed shape is given, and concentration around the mean is shown. This result is generalized to the major index and to other descent functions. The proof combines probabilistic arguments together with combinatorial character theory. Connections with Hecke algebras are mentioned.
In recent work of Baik, Deift and Rains convergence of moments was established for the limiting joint distribution of the lengths of the first k rows in random Young tableaux. The main difficulty was obtaining a good estimate for the tail of the distribution and this was accomplished through a highly nontrival Riemann-Hilbert analysis. Here we give a simpler derivation. The same method is used to establish convergence of moments for a random growth model.
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection results about random 132-avoiding sorting networks, including limit shapes for trajectories and intermediate permutations. Moreover, the expected number of adjacencies in SYT is considered. It is shown that on average each row and each column of a shifted SYT of staircase shape contains precisely one adjacency.
The arctic circle theorem of Jockusch, Propp, and Shor asserts that uniformly random domino tilings of an Aztec diamond of high order are frozen with asymptotically high probability outside the "arctic circle" inscribed within the diamond. A similar arctic circle phenomenon has been observed in the limiting behavior of random square Young tableaux. In this paper, we show that random domino tilings of the Aztec diamond are asymptotically related to random square Young tableaux in a more refined sense that looks also at the behavior inside the arctic circle. This is done by giving a new derivati…
The bead model is a random point field on $\mathbb{Z}\times\mathbb{R}$ which can be viewed as a scaling limit of dimer model. We prove that, in the scaling limit, the normalized height function of a uniformly chosen random bead configuration lies in an arbitrarily small neighborhood of a surface $h_0$ that maximizes some functional which we call as entropy. We also prove that the limit shape $h_0$ is a scaling limit of the limit shapes of a properly chosen sequence of dimer models. There is a map from bead configurations to standard tableaux of a (skew) Young diagram, and the map preserves uni…
We present a survey of points of view on the problem of the asymptotic shape of a path between two large Young diagrams, and introduce a modification of the TASEP process related to it. This representation allows to write explicitly the functional, counting the asymptotics of the number of Young tableau close to a given one, as well as to see the sine-process on the boundary shape of a large random Young diagram.
Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of the associated Young tableau as a multidimensional Brownian functional. Since the length of the top row of the Young tableau is also the length of the longest (weakly) increasing subsequence of $(X_k)_{1\le k \le n}$, the corresponding limiting law follows. We relate our results to a conjecture of Kuperberg by showing that, under a cyclic condition, a spectral char…
In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new objects could be related to deeper structures, similarly to the ubiquitous Young tableaux. Our methods rely on variants of hook-length type formulas, and also on a new efficient generic method (which we call the density method) which allows not only to generate constrained combinatorial objects, but also to enumerate them. We also investigate some repercussions …
In this article, we shall start with a closed walk on a regular tree of degree $d$. These walks are described by the Kesten-McKay law which arises as the asymptotic distribution of a random $d$-regular graph on $n$ vertices. We will show that the moments of the Kesten-McKay law are given by counting standard Young tableaux with at most 2 rows, and how some properties of the walk make sense even when $d$ is not an integer. We will use free probability to instruct us how to build an explicit model in random matrix theory.
We introduce an object called a decorated Young tableau which can equivalently be viewed as a continuous time trajectory of Young diagrams or as a non-intersecting line ensemble. By a natural extension of the Robinson-Schensted correspondence, we create a random pair of decorated Young tableaux from a Poisson point process in the plane, which we think of as a stochastic process in discrete space and continuous time. By using only elementary techniques and combinatorial properties, we identify this process as a Schur process and show it has the same law as certain non-intersecting Poisson walke…
It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau converges to a deterministic limit. We study the fluctuations from this limit along the edges of the rectangle. We show that in the corner, these fluctuations are gaussian wheras, away from the corner and when the rectangle is a square, the fluctuations are given by the Tracy-Widom distribution. Our method is based on a connection with the Jacobi ensemble.
We discuss a stochastic particle system consisting of a two-dimensional array of particles living in one space dimension. The stochastic evolution bears a certain similarity to Hammersley's process, and the particle interaction is governed by combinatorics of the Young tableaux.
A determinantal point process approach to scaling and local limits of random Young tableaux
通过行列式点过程渐近分析，给出固定形状随机杨氏表的缩放与局部极限，包括极限曲面显式描述、连续性判据及局部极限，并推广至L形杨氏表。
We present new combinatorial and probabilistic identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic identities, relating a random vector of last passage percolation times to its dual, using the duality between the Robinson-Schensted-Knuth and Burge correspondences. A second probabilistic identity, relating those two vectors to a vector of "last swap times" in the oriented swap process, is conjectural. We give a computer-assisted proof of this identity for $n\l…
We obtain an identity between Fredholm determinants of two kinds of operators, one acting on functions on the unit circle and the other acting on functions on a subset of the integers. This identity is a generalization of an identity between a Toeplitz determinant and a Fredholm determinant that has appeared in the random permutation context. Using this identity, we prove, in particular, convergence of moments for arbitrary rows of a random Young diagram under Plancherel measure.
Global fluctuations for standard Young tableaux
本文引入杨生成函数刻画整数分拆上的概率分布，建立多层次中心极限定理，并应用于研究标准杨表及相关过程的波动，证明极限为条件高斯自由场。
We show that the class of inductive limits of the representations of finite symmetric groups with simple spectrum coinsides with the class of Markov representations of the infinite symmetric group associated with Markov measures on the space of infinite Young tableaux. We also show that the representations of infinite symmetric group induced from identity representation of two-block Young subgroup are Markov representations and find explicit formulas for transition probabilities of corresponding Markov measure on the Young diagrmas. Induced two-row representations of finite symmetric group are…
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems studied by Logan-Shepp, Vershik-Kerov, and Cohn-Larsen-Propp. Our solution involves methods from the theory of singular integral equations, and sheds light on the somewhat mysterious derivations in these works. An extension to rectangular diagrams, using the same ideas but involving some nontrivial computations, is also given. We give several applications of …
We consider a generalization of the vicious walker model. Using a bijection map between the path configuration of the non-intersecting random walkers and the hook Young diagram, we compute the probability concerning the number of walker's movements. Applying the saddle point method, we reveal that the scaling limit gives the Tracy--Widom distribution, which is same with the limit distribution of the largest eigenvalues of the Gaussian unitary ensemble.
Pólya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of the time ($\operatorname{mod} p$). We extend the work of Flajolet et al. on Pólya urns: the generating function encoding the evolution of the urn is studied by methods of analytic combinatorics. We show that the initial partial differential equations lead to ordinary linear differential equations which are related to hypergeometric functions (giving the exact st…
P{ó}lya urns are urns where at each unit of time a ball is drawn and is replaced with some other balls according to its colour. We introduce a more general model: The replacement rule depends on the colour of the drawn ball and the value of the time (mod p). We discuss some intriguing properties of the differential operators associated to the generating functions encoding the evolution of these urns. The initial partial differential equation indeed leads to ordinary linear differential equations and we prove that the moment generating functions are D-finite. For a subclass, we exhibit a closed…
We study an infinite version of the "jeu de taquin" sliding game, which can be thought of as a natural measure-preserving transformation on the set of infinite Young tableaux equipped with the Plancherel probability measure. We use methods from representation theory to show that the Robinson-Schensted-Knuth ($\operatorname {RSK}$) algorithm gives an isomorphism between this measure-preserving dynamical system and the one-sided shift dynamics on a sequence of independent and identically distributed random variables distributed uniformly on the unit interval. We also show that the jeu de taquin …
It is known that some matrix integrals over U(n) satisfy an sl(2,R)-algebra of Virasoro constraints. Acting with these Virasoro generators on 2-dimensional Schur function expansions leads to difference relations on the coefficients of this expansions. These difference relations, set equal to zero, are precisely the backward and forward equations for non-intersecting random walks. The transition probabilities for these random walks appear as the coefficients of an expansion of U(n)-matrix integrals (of the type above), by inserting in the integral the product of two Schur polynomials associated…
This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The precise geometrical figure here consists of a hexagon with cuts along opposite edges. For this model we take limits when the size of the hexagon and the cuts tend to infinity, while keeping certain geometric data fixed in order to guarantee interaction beyond the limit. We show in this paper that the kernel for the finite tiling model can be expressed as a m…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。