相关论文: The central limit theorem for extremal characters …

In this paper, we review the representation theory of the infinite symmetric group, and we extend the works of Kerov and Vershik by proving that the irreducible characters of the infinite symmetric group always satisfy a central limit…

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

We prove a central limit theorem for random walks with finite variance on linear groups.

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

A central limit theorem is established for a sum of random variables belonging to a sequence of random fields. The fields are assumed to have zero mean conditional on the past history and to satisfy certain conditional $\alpha$-mixing…

The number of peaks of a random permutation is known to be asymptotically normal. We give a new proof of this and prove a central limit theorem for the distribution of peaks in a fixed conjugacy class of the symmetric group. Our technique…

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

Regarding the conjugacy representation on symmetric groups, we initiate a normalized measure emerging from this representation, namely the conjugacy measure. A central limit theorem for character ratios of random representations of the…

In this paper, we present the results of a computer investigation of asymptotics for maximum dimensions of linear and projective representations of the symmetric group. This problem reduces to the investigation of standard and strict Young…

We prove central limit theorem for linear eigenvalue statistics of orthogonally invariant ensembles of random matrices with one interval limiting spectrum. We consider ensembles with real analytic potentials and test functions with two…

We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…

As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied…

We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…

We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We provide a simple proof for of the central limit theorem for the number of vertices in the giant for super-critical stochastic block model using the breadth-first walk of Konarovskyi, Limic and the author (2024). Our approach follows the…