:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Harchaoui, Zaid, Oh, Sewoong, Pal, Soumik, Somani, Raghav, Tripathi, Raghavendra
Format:	Preprint
Publié:	2022
Sujets:	Probability Machine Learning 05C60, 05C63, 05C80, 68R10, 60K35, 60G09
Accès en ligne:	https://arxiv.org/abs/2210.00422
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Infinite random graphs
par: Kostana, Ziemowit, et autres
Publié: (2026)

Local limit of the random degree constrained process
par: Ráth, Balázs, et autres
Publié: (2024)

The largest common subtree of two random trees
par: Angel, Omer, et autres
Publié: (2025)

Stochastic processes on preferential attachment models
par: Ray, Rounak
Publié: (2024)

Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
par: Andrade, Mauricio Daros, et autres
Publié: (2025)

Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
par: Khanfir, Robin
Publié: (2024)

Random friend trees
par: Berry, Louigi Addario, et autres
Publié: (2024)

Genealogies of records of stochastic processes with stationary increments as unimodular trees
par: Baccelli, François, et autres
Publié: (2024)

Network evolution with self-reinforcement
par: Bhamidi, Shankar, et autres
Publié: (2026)

An upper bound on the smallest singular value of dense random combinatorial matrices
par: Li, Dongbin, et autres
Publié: (2026)

The stable trees revisited
par: Goldschmidt, Christina, et autres
Publié: (2025)

The Horton-Strahler Number of Conditioned Galton-Watson Trees
par: Brandenberger, Anna M., et autres
Publié: (2020)

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
par: Rakotoniaina, Fameno, et autres
Publié: (2026)

Local limit theorem for joint subgraph counts
par: Sah, Ashwin, et autres
Publié: (2024)

On the components of random geometric graphs in the dense limit
par: Penrose, Mathew D., et autres
Publié: (2025)

The multi-level friendship paradox for sparse random graphs
par: Hazra, Rajat Subhra, et autres
Publié: (2025)

Tight universal bounds on the height times the width of random trees
par: Donderwinkel, Serte, et autres
Publié: (2024)

Critical trees are neither too short nor too fat
par: Addario-Berry, Louigi, et autres
Publié: (2023)

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

Isomorphisms between dense random graphs
par: Surya, Erlang, et autres
Publié: (2023)

Almost all graphs have no cospectral mate with fixed level
par: Wang, Wei, et autres
Publié: (2025)

A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
par: Park, Jungeun, et autres
Publié: (2024)

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

The sharp threshold for jigsaw percolation in random graphs
par: Cooley, Oliver, et autres
Publié: (2018)

Self-Reinforced Preferential Attachment
par: Dahiya, Yogesh, et autres
Publié: (2025)

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

Scaling limits of random graphs
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Higher-Order Graphon Theory: Fluctuations, Degeneracies, and Inference
par: Chatterjee, Anirban, et autres
Publié: (2024)

First passage percolation on Erdős-Rényi graphs with general weights
par: Daly, Fraser, et autres
Publié: (2023)

Spatiotemporal Hawkes processes with a graphon-induced connectivity structure
par: Baars, Justin, et autres
Publié: (2024)

Explosive appearance of cores and bootstrap percolation on lattices
par: Hartarsky, Ivailo, et autres
Publié: (2025)

Two-Point Concentration of the Domination Number of Random Graphs
par: Bohman, Tom, et autres
Publié: (2024)

Upper tails of subgraph counts in directed random graphs
par: Park, Jiyun
Publié: (2024)

Condensation in subcritical Cauchy Bienaymé trees
par: Kortchemski, Igor, et autres
Publié: (2025)

Particle Systems and McKean--Vlasov Dynamics with Singular Interaction through Local Times
par: Baker, Graeme, et autres
Publié: (2025)

Functional central limit theorem for subgraph counts in a dynamic random connection model
par: Hazra, Rajat Subhra, et autres
Publié: (2025)

The acyclic directed bunkbed conjecture is false
par: Przybyłowski, Tomasz
Publié: (2025)

A large deviation principle for block models
par: Borgs, Christian, et autres
Publié: (2020)

Upper tail bounds for irregular graphs
par: Basak, Anirban, et autres
Publié: (2025)

Extreme local statistics in random graphs: maximum tree extension counts
par: Araújo, Pedro, et autres
Publié: (2023)