Paper detail

The central limit theorem for extremal characters of the infinite symmetric group

The asymptotics of the first rows and columns of random Young diagrams corresponding to extremal characters of the infinite symmetric group is studied. We consider rows and columns with linear growth in $n$, the number of boxes of random diagrams, and prove the central limit theorem for them in the case of distinct Thoma parameters. We also establish a more precise statement relating the growth of rows and columns of Young diagrams to a simple independent random sampling model. After this paper was completed, the author learned that the central limit theorem has been also proved in the work of Méliot (arXiv:1105.0091v1) by a different method.

preprint2011arXivOpen access

Signal facts

What is known right now

Open access1 author2 topics

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.