Cover Image

The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aldous, David J., Janson, Svante
Format:	Preprint
Published:	2024
Subjects:	Probability Combinatorics 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Critical Beta-splitting Random Tree II: Overview and Open Problems
by: Aldous, David J., et al.
Published: (2023)

The Critical Beta-splitting Random Tree IV: Mellin analysis of Leaf Height
by: Aldous, David, et al.
Published: (2024)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
by: Janson, Svante
Published: (2024)

The Critical Beta-splitting Random Tree: Heights and Related Results
by: Aldous, David, et al.
Published: (2023)

Central limit theorem for components in meandric systems through high moments
by: Janson, Svante, et al.
Published: (2023)

On semi-restricted Rock, Paper, Scissors
by: Janson, Svante
Published: (2024)

Fringe subtrees of split trees and fractional split trees
by: Holmgren, Cecilia, et al.
Published: (2026)

Cyclic and alternating $U$-statistics
by: Janson, Svante
Published: (2025)

A note on Pólya urns: the winner may lead all the time
by: Janson, Svante
Published: (2025)

Better-than-average uniform random variables and Eulerian numbers, or: How many candidates should a voter approve?
by: Janson, Svante, et al.
Published: (2024)

Moments of balanced Pólya urns
by: Janson, Svante
Published: (2025)

Preferential Attachment When Stable
by: Janson, Svante, et al.
Published: (2018)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
by: Brandenberger, Anna, et al.
Published: (2025)

How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
by: Janson, Svante, et al.
Published: (2025)

The $k$-Plancherel measure and a Finite Markov Chain
by: Linusson, Svante, et al.
Published: (2025)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

The bunkbed problem and the random cluster model
by: Ayyer, Arvind, et al.
Published: (2025)

Statistics on monotonically ordered non-crossing partitions
by: Blitvic, Natasha, et al.
Published: (2025)

Critical beta-splitting, via contraction
by: Kolesnik, Brett
Published: (2024)

Large Components and Trees of Random Mappings
by: Mutafchiev, Ljuben, et al.
Published: (2025)

Almost sure and moment convergence for triangular Pólya urns
by: Janson, Svante
Published: (2024)

Mixing times of a Burnside process Markov chain on set partitions
by: Paguyo, J. E.
Published: (2022)

Approximation of Subgraph Counts in the Uniform Attachment Model
by: Björklund, Johan, et al.
Published: (2023)

Random trees have height $O(\sqrt{n})$
by: Addario-Berry, Louigi, et al.
Published: (2022)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

Large fringe trees for random trees with given vertex degrees
by: Ojeda, Gabriel Berzunza, et al.
Published: (2026)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)

On the Deepest Cycle of a Random Mapping
by: Mutafchiev, Ljuben, et al.
Published: (2023)

Scaling limits of multitype Bienaymé trees
by: Addario-Berry, Louigi, et al.
Published: (2025)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
by: Addario-Berry, Louigi, et al.
Published: (2026)

Extreme local statistics in random graphs: maximum tree extension counts
by: Araújo, Pedro, et al.
Published: (2023)

Binary search trees of permuton samples
by: Corsini, Benoît, et al.
Published: (2024)

Random Subwords and Pipe Dreams
by: Defant, Colin
Published: (2024)

Limit distributions for cycles of random parking functions
by: Paguyo, J. E., et al.
Published: (2025)

Inversions in Random Permutations Under the Ewens Sampling Distribution With and Without a Prescribed Number of Fixed Points
by: Pinsky, Ross G., et al.
Published: (2025)

Central limit theorem for crossings in randomly embedded graphs
by: Arenas-Velilla, Santiago, et al.
Published: (2023)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)

Asymptotics for the number of bipartite graphs with fixed surplus
by: Clancy Jr, David
Published: (2024)