:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Harchaoui, Zaid, Oh, Sewoong, Pal, Soumik, Somani, Raghav, Tripathi, Raghavendra
Format:	Preprint
Published:	2022
Subjects:	Probability Machine Learning 05C60, 05C63, 05C80, 68R10, 60K35, 60G09
Online Access:	https://arxiv.org/abs/2210.00422
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Infinite random graphs
by: Kostana, Ziemowit, et al.
Published: (2026)

Local limit of the random degree constrained process
by: Ráth, Balázs, et al.
Published: (2024)

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

Stochastic processes on preferential attachment models
by: Ray, Rounak
Published: (2024)

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

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
by: Khanfir, Robin
Published: (2024)

Random friend trees
by: Berry, Louigi Addario, et al.
Published: (2024)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

An upper bound on the smallest singular value of dense random combinatorial matrices
by: Li, Dongbin, et al.
Published: (2026)

The stable trees revisited
by: Goldschmidt, Christina, et al.
Published: (2025)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
by: Brandenberger, Anna M., et al.
Published: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
by: Rakotoniaina, Fameno, et al.
Published: (2026)

Local limit theorem for joint subgraph counts
by: Sah, Ashwin, et al.
Published: (2024)

On the components of random geometric graphs in the dense limit
by: Penrose, Mathew D., et al.
Published: (2025)

The multi-level friendship paradox for sparse random graphs
by: Hazra, Rajat Subhra, 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)

The Horton-Strahler number of Galton-Watson trees with possibly infinite variance
by: Khanfir, Robin
Published: (2023)

Isomorphisms between dense random graphs
by: Surya, Erlang, et al.
Published: (2023)

Almost all graphs have no cospectral mate with fixed level
by: Wang, Wei, et al.
Published: (2025)

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

Fast Simulation of Size-Constrained Multitype Bienaymé-Galton-Watson Forests and Applications
by: Hernández, Osvaldo Angtuncio
Published: (2020)

The sharp threshold for jigsaw percolation in random graphs
by: Cooley, Oliver, et al.
Published: (2018)

Self-Reinforced Preferential Attachment
by: Dahiya, Yogesh, et al.
Published: (2025)

Can the root cluster remain largest forever in random recursive tree percolation?
by: Zheng, Yushu
Published: (2026)

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

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
by: Chatterjee, Anirban, et al.
Published: (2024)

First passage percolation on Erdős-Rényi graphs with general weights
by: Daly, Fraser, et al.
Published: (2023)

Spatiotemporal Hawkes processes with a graphon-induced connectivity structure
by: Baars, Justin, et al.
Published: (2024)

Explosive appearance of cores and bootstrap percolation on lattices
by: Hartarsky, Ivailo, et al.
Published: (2025)

Two-Point Concentration of the Domination Number of Random Graphs
by: Bohman, Tom, et al.
Published: (2024)

Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)

Condensation in subcritical Cauchy Bienaymé trees
by: Kortchemski, Igor, et al.
Published: (2025)

Particle Systems and McKean--Vlasov Dynamics with Singular Interaction through Local Times
by: Baker, Graeme, et al.
Published: (2025)

Functional central limit theorem for subgraph counts in a dynamic random connection model
by: Hazra, Rajat Subhra, et al.
Published: (2025)

The acyclic directed bunkbed conjecture is false
by: Przybyłowski, Tomasz
Published: (2025)

A large deviation principle for block models
by: Borgs, Christian, et al.
Published: (2020)

Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025)

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