:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	He, Jimmy, Ottolini, Andrea
Format:	Preprint
Published:	2021
Subjects:	Probability Combinatorics 60C05
Online Access:	https://arxiv.org/abs/2108.07355
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Card guessing after an asymmetric riffle shuffle
by: Kuba, Markus
Published: (2026)

On Card guessing after a single shelf shuffle
by: Kuba, Markus
Published: (2026)

Hitting times in the stochastic block model
by: Ottolini, Andrea
Published: (2024)

On the position matrix of single-shelf shuffle and card guessing
by: Tripathi, Raghavendra
Published: (2026)

Pal's permanent conjecture: proof for block uniform matrices
by: Ottolini, Andrea, et al.
Published: (2026)

A concentration inequality for random combinatorial optimisation problems
by: Danielsson, Joel Larsson
Published: (2024)

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

Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions
by: Boros, Endre, et al.
Published: (2021)

A combinatorial approach to phase transitions in random graph isomorphism problems
by: Diamantidis, Dimitris, 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)

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

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

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

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

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

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

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

A Greedy Chip-firing Game
by: Li, Rupert, et al.
Published: (2021)

On the statistics of random-to-top shuffles
by: Clay, Alexander
Published: (2026)

On the longest common subsequence of independent random permutations invariant under conjugation
by: Kammoun, Mohamed Slim
Published: (2019)

The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree
by: Aldous, David J., et al.
Published: (2024)

Bootstrap percolation on the high-dimensional Hamming graph
by: Kang, Mihyun, et al.
Published: (2024)

A note on mixed Poisson distributions
by: Kuba, Markus
Published: (2025)

Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences
by: Mani, Nitya, et al.
Published: (2024)

Thresholds and expectation thresholds for larger p
by: Przybyłowski, Tomasz, et al.
Published: (2023)

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

Lonely passengers: a short proof
by: Haslegrave, John
Published: (2025)

An asymptotically optimal bound for the concentration function of a sum of independent integer random variables
by: Kurauskas, Valentas
Published: (2026)

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

Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)

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

Lipschitz functions on weak expanders
by: Krueger, Robert A., et al.
Published: (2024)

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

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

Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
by: Bohman, Tom, et al.
Published: (2024)

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

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

Lonely passenger problem: the more buses there are, the more lonely passengers there will be
by: Tóth, Imre Péter
Published: (2025)