Image de couverture de livre

Optimal recovery of correlated Erdős-Rényi graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Du, Hang
Format:	Preprint
Publié:	2025
Sujets:	Probability 60C05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Fluid limit and gelation in the frozen Erdős-Rényi random graph
par: Haas, Bénédicte, et autres
Publié: (2025)

Fluctuations of functions of sparse Erdős-Rényi graphs
par: Chu, Hok-Yin
Publié: (2025)

The process of fluctuations of the giant component of an Erdős-Rényi graph
par: Enriquez, Nathanaël, et autres
Publié: (2023)

Near critical asymptotics in the Frozen Erdős-Rényi
par: Viau, Vincent
Publié: (2024)

Edge universality of sparse Erdős-Rényi digraphs
par: He, Yukun
Publié: (2023)

Return probability on Bienaymé-Galton-Watson trees and spectral asymptotics of sparse Erdős-Rényi random graphs
par: Heydenreich, Markus, et autres
Publié: (2026)

Functional Central Limit Theorem for the principal eigenvalue of dynamic Erdős-Rényi random graphs
par: Hazra, Rajat Subhra, et autres
Publié: (2024)

Semicircle laws with combined variance for non-uniform Erdős-Rényi hypergraphs
par: Avena, Luca, et autres
Publié: (2026)

Limit theorems for walks and triangles on Erdös-Rényi random graphs with large interaction radius
par: Khorunzhiy, O.
Publié: (2024)

An Erd\H os Rényi Law for the Longest Consecutive Monotone Block in a Random Permutation
par: Godbole, Anant
Publié: (2026)

Shotgun assembly of random regular graphs
par: Huang, Brice, et autres
Publié: (2015)

Optimal subgraphs in geometric scale-free random graphs
par: Michielan, Riccardo, et autres
Publié: (2024)

Central limit theorem for crossings in randomly embedded graphs
par: Arenas-Velilla, Santiago, et autres
Publié: (2023)

Optimal Thresholds for Monotone Non-Boolean Functions
par: Lepsveridze, Saba, et autres
Publié: (2025)

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

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

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

Majority dynamics on sparse random graphs
par: Chakraborti, Debsoumya, et autres
Publié: (2021)

On the upper tail of star counts in random graphs
par: Akhmejanova, Margarita, et autres
Publié: (2025)

A combinatorial approach to phase transitions in random graph isomorphism problems
par: Diamantidis, Dimitris, et autres
Publié: (2024)

Optimal Unimodular Matching
par: Enriquez, Nathanaël, et autres
Publié: (2024)

Asymptotics for the number of bipartite graphs with fixed surplus
par: Clancy Jr, David
Publié: (2024)

Limits of chordal graphs with bounded tree-width
par: Castellví, Jordi, et autres
Publié: (2023)

Bootstrap percolation on the high-dimensional Hamming graph
par: Kang, Mihyun, et autres
Publié: (2024)

Universal diameter bounds for random graphs with given degrees
par: Addario-Berry, Louigi, et autres
Publié: (2025)

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

Optimal matching under size priority
par: Enriquez, Nathanaël, et autres
Publié: (2026)

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

Normal approximation for exponential random graphs
par: Fang, Xiao, et autres
Publié: (2024)

Asymptotics for cliques in scale-free random graphs
par: Daly, Fraser, et autres
Publié: (2020)

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

Conditional central limit theorems for exponential random graphs
par: Fang, Xiao, et autres
Publié: (2025)

Wasserstein distances between ERGMs and Erdős-Rényi models
par: Winstein, Vilas
Publié: (2026)

Poisson approximation for cycles in the generalised random graph
par: Lienau, Matthias
Publié: (2024)

Approximating inter-point distances in directed Bernoulli graphs
par: Barbour, A. D., et autres
Publié: (2026)

Approximation of Subgraph Counts in the Uniform Attachment Model
par: Björklund, Johan, et autres
Publié: (2023)

A full characterization of invariant embeddability of unimodular planar graphs
par: Timár, Ádám, et autres
Publié: (2021)

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

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
par: Collares, Maurício, et autres
Publié: (2025)