:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Grübel, Rudolf
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Probability 05C05, 60C05, 68W40
Online Access:	https://arxiv.org/abs/2302.07850
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)

On Conjectures concerning the Labeled Coupon Collector Problem
by: Barak-Pelleg, Dina, et al.
Published: (2025)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

Large deviations of the greedy independent set algorithm on sparse random graphs
by: Kolesnik, Brett
Published: (2020)

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

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

Vector encoding of phylogenetic trees by ordered leaf attachment
by: Richman, Harry, et al.
Published: (2025)

Random $2$-SAT: The set of atoms of the limiting empirical marginal distribution
by: Müller, Noela, et al.
Published: (2024)

On 3-colorability of (claw, diamond)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2026)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
by: Diamond, Harvey, et al.
Published: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
by: Diamond, Harvey, et al.
Published: (2024)

Note on down-set thresholds
by: Warnke, Lutz
Published: (2023)

A Halász-type theorem for permutation anticoncentration
by: Hunter, Zach, et al.
Published: (2026)

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

A new lower bound for deterministic pop-stack-sorting
by: Bauer, Morgan, et al.
Published: (2023)

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

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

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

On irreducible central limit theorems
by: Caravenna, Francesco, et al.
Published: (2025)

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

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

Mean-Biased Processes for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)

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

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)

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

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

Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
by: Chatterjee, Arnab
Published: (2025)

Sharp Fuss-Catalan thresholds in graph bootstrap percolation
by: Bartha, Zsolt, et al.
Published: (2025)

The permuton limit of random recursive separable permutations
by: Féray, Valentin, et al.
Published: (2023)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

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

Polynomial invariants for rooted trees related to their random destruction
by: Burghart, Fabian
Published: (2023)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

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

A phase transition in block-weighted random maps
by: Fleurat, William, 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)