中文
相关论文

相关论文: Random Young diagrams and Jacobi Unitary Ensemble

200 篇论文

We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy…

概率论 · 数学 2026-05-28 Lucas Teyssier

The aim of this paper is to give a precise asymptotic description of some eigenvalue statistics stemming from random matrix theory. More precisely, we consider random determinants of the GUE, Laguerre, Uniform Gram and Jacobi beta ensembles…

概率论 · 数学 2017-07-25 Martina Dal Borgo , Emma Hovhannisyan , Alain Rouault

For a broad class of unitary ensembles of random matrices we demonstrate the universal nature of the Janossy densities of eigenvalues near the spectral edge, providing a different formulation of the probability distributions of the limiting…

概率论 · 数学 2008-04-08 Brian Rider , Xin Zhou

We study random surfaces constructed by glueing together $N/k$ filled $k$-gons along their edges, with all $(N-1)!! = (N-1)(N-3)...3\cdot 1$ pairings of the edges being equally likely. (We assume that lcm $\{2,k\}$ divides $N$.) The Euler…

概率论 · 数学 2009-02-23 Kevin Fleming , Nicholas Pippenger

Consider the lattice of all Young diagrams ordered by inclusion, and denote by Y its Hasse graph. Using the Pieri formula for Jack symmetric polynomials, we endow the edges of the graph Y with formal multiplicities depending on a real…

q-alg · 数学 2008-03-02 Sergei Kerov , Andrei Okounkov , Grigori Olshanski

We consider a family of card shuffles of $n$ cards in which the allowed moves involve transpositions corresponding to the Jucys--Murphy elements of the symmetric group $\{S_m\}_{m \leq n}$. We determine the eigenvalues of the corresponding…

组合数学 · 数学 2026-05-20 Samira Arfaee , Evita Nestoridi

We establish central and local limit theorems for the number of vertices in the largest component of a random $d$-uniform hypergraph $\hnp$ with edge probability $p=c/\binnd$, where $(d-1)^{-1}+\eps<c<\infty$. The proof relies on a new,…

组合数学 · 数学 2017-11-17 Michael Behrisch , Amin Coja-Oghlan , Mihyun Kang

Let $U$ be a matrix chosen randomly, with respect to Haar measure, from the unitary group $U(d).$ We express the moments of the trace of any submatrix of $U$ as a sum over partitions whose terms count certain standard and semistandard Young…

组合数学 · 数学 2007-05-23 Jonathan Novak

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

概率论 · 数学 2023-03-07 Jonas Sjöstrand

Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space a totally ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of…

概率论 · 数学 2020-09-07 Christian Houdré , Trevis J. Litherland

It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…

概率论 · 数学 2021-01-26 Mohamed Slim Kammoun

Let $k$ be a field of characteristic zero, and let $f: k[x,y] \to k[x,y]$, $f: (x,y) \mapsto (p,q)$, be a $k$-algebra endomorphism having an invertible Jacobian. Write $p=a_ny^n+\cdots+a_1y+a_0$, where $n=deg_y(p) \in \mathbb{N}$, $a_i \in…

交换代数 · 数学 2018-10-25 Vered Moskowicz

We continue to explore the connections between large deviations for objects coming from random matrix theory and sum rules. This connection was established in [17] for spectral measures of classical ensembles (Gauss-Hermite, Laguerre,…

概率论 · 数学 2018-11-16 Fabrice Gamboa , Jan Nagel , Alain Rouault

We study the moment-generating functions (MGF) for linear eigenvalue statistics of Jacobi unitary, symplectic and orthogonal ensembles. By expressing the MGF as Fredholm determinants of kernels of finite rank, we show that the mean and…

数学物理 · 物理学 2023-08-21 Chao Min , Yang Chen

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

概率论 · 数学 2016-04-08 Charles Bordenave , Pietro Caputo

We study structural properties of the Lyapunov exponent $\gamma$ and the density of states $k$ for ergodic (or just invariant) Jacobi matrices in a general framework. In this analysis, a central role is played by the function…

谱理论 · 数学 2015-05-30 Injo Hur , Christian Remling

The purpose of this paper is to describe a general procedure for computing analogues of Young's seminormal representations of the symmetric groups. The method is to generalize the Jucys-Murphy elements in the group algebras of the symmetric…

表示论 · 数学 2009-09-25 Arun Ram

We consider random n\times n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are…

概率论 · 数学 2015-06-05 Laszlo Erdos , Brendan Farrell

We consider two-sided Jacobi matrices whose coefficients are obtained by continuous sampling along the orbits of a homeomorphim of a compact metric space. Given an ergodic probability measure, we study the topological structure of the…

谱理论 · 数学 2022-08-03 David Damanik , Jake Fillman , Zhenghe Zhang

Goulden-Rattan polynomials give the exact value of the subdominant part of the normalized characters of the symmetric groups in terms of certain quantities ($C_i$) which describe the macroscopic shape of the Young diagram. The…

组合数学 · 数学 2022-06-01 Mikołaj Marciniak