A large deviation principle for block models
Fuente:
arXiv
Saved in:
| Main Authors: | Borgs, Christian, Chayes, Jennifer, Gaudio, Julia, Petti, Samantha, Sen, Subhabrata |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025)
by: Basak, Anirban, et al.
Published: (2025)
On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, et al.
Published: (2025)
by: Akhmejanova, Margarita, et al.
Published: (2025)
Two-Point Concentration of the Domination Number of Random Graphs
by: Bohman, Tom, et al.
Published: (2024)
by: Bohman, Tom, et al.
Published: (2024)
Upper tails of subgraph counts in directed random graphs
by: Park, Jiyun
Published: (2024)
by: Park, Jiyun
Published: (2024)
Marked random graphs with given degree sequence: large deviations on the local topology
by: Baldasso, Rangel, et al.
Published: (2023)
by: Baldasso, Rangel, et al.
Published: (2023)
Typical structure of sparse exponential random graph models
by: Cook, Nicholas A., et al.
Published: (2022)
by: Cook, Nicholas A., et al.
Published: (2022)
Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)
by: Chakraborty, Suman, et al.
Published: (2021)
Hitting times in the stochastic block model
by: Ottolini, Andrea
Published: (2024)
by: Ottolini, Andrea
Published: (2024)
Large deviations of the giant component in scale-free inhomogeneous random graphs
by: Jorritsma, Joost, et al.
Published: (2024)
by: Jorritsma, Joost, et al.
Published: (2024)
A Galton-Watson tree approach to local limits of permutations avoiding a pattern of length three
by: Park, Jungeun, et al.
Published: (2024)
by: Park, Jungeun, et al.
Published: (2024)
Preferential Attachment When Stable
by: Janson, Svante, et al.
Published: (2018)
by: Janson, Svante, et al.
Published: (2018)
Diameter and mixing time of the giant component in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)
by: Anastos, Michael, et al.
Published: (2025)
A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)
by: Anastos, Michael, et al.
Published: (2025)
Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
by: Andrade, Mauricio Daros, et al.
Published: (2025)
by: Andrade, Mauricio Daros, et al.
Published: (2025)
Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations
by: Budzinski, Thomas, et al.
Published: (2026)
by: Budzinski, Thomas, et al.
Published: (2026)
Local limit theorem for joint subgraph counts
by: Sah, Ashwin, et al.
Published: (2024)
by: Sah, Ashwin, et al.
Published: (2024)
Graph connectivity with fixed endpoints in the random-connection model
by: Liu, Qingwei, et al.
Published: (2023)
by: Liu, Qingwei, et al.
Published: (2023)
A tail bound for cumulant series for complex functions of independent random variables
by: Isaev, Mikhail
Published: (2025)
by: Isaev, Mikhail
Published: (2025)
Concentration inequalities for Poisson $U$-statistics
by: Bonnet, Gilles, et al.
Published: (2024)
by: Bonnet, Gilles, et al.
Published: (2024)
The law of the circumference of sparse binomial random graphs
by: Anastos, Michael, et al.
Published: (2025)
by: Anastos, Michael, et al.
Published: (2025)
Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
by: Rybarczyk, Katarzyna, et al.
Published: (2025)
Normal approximation for subgraph count in random hypergraphs
by: Michalczuk, Wojciech, et al.
Published: (2024)
by: Michalczuk, Wojciech, et al.
Published: (2024)
A novel approach to the giant component fluctuations
by: Corujo, Josué, et al.
Published: (2024)
by: Corujo, Josué, et al.
Published: (2024)
A limit theorem for the total progeny distribution of multi-type branching processes
by: Hoogendijk, Jochem, et al.
Published: (2025)
by: Hoogendijk, Jochem, et al.
Published: (2025)
The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)
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)
by: Donderwinkel, Serte, et al.
Published: (2024)
Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)
by: Addario-Berry, Louigi, 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)
by: Addario-Berry, Louigi, et al.
Published: (2026)
A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
by: Bohman, Tom, et al.
Published: (2024)
by: Bohman, Tom, et al.
Published: (2024)
A phase transition in block-weighted random maps
by: Fleurat, William, et al.
Published: (2023)
by: Fleurat, William, et al.
Published: (2023)
Large deviations for probability graphons
by: Dionigi, Pierfrancesco, et al.
Published: (2025)
by: Dionigi, Pierfrancesco, et al.
Published: (2025)
Spectral properties of the stochastic block model and their application to hitting times of random walks
by: Löwe, Matthias, et al.
Published: (2024)
by: Löwe, Matthias, et al.
Published: (2024)
Scaling limits of random graphs
by: Addario-Berry, Louigi, et al.
Published: (2024)
by: Addario-Berry, Louigi, et al.
Published: (2024)
On the Deepest Cycle of a Random Mapping
by: Mutafchiev, Ljuben, et al.
Published: (2023)
by: Mutafchiev, Ljuben, et al.
Published: (2023)
Large Components and Trees of Random Mappings
by: Mutafchiev, Ljuben, et al.
Published: (2025)
by: Mutafchiev, Ljuben, et al.
Published: (2025)
Universal diameter bounds for random graphs with given degrees
by: Addario-Berry, Louigi, et al.
Published: (2025)
by: Addario-Berry, Louigi, et al.
Published: (2025)
Limits of chordal graphs with bounded tree-width
by: Castellví, Jordi, et al.
Published: (2023)
by: Castellví, Jordi, et al.
Published: (2023)
Majority dynamics on sparse random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)
by: Chakraborti, Debsoumya, et al.
Published: (2021)
The Horton-Strahler Number of Conditioned Galton-Watson Trees
by: Brandenberger, Anna M., et al.
Published: (2020)
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)
by: Rakotoniaina, Fameno, et al.
Published: (2026)
Similar Items
-
Upper tail bounds for irregular graphs
by: Basak, Anirban, et al.
Published: (2025) -
On the upper tail of star counts in random graphs
by: Akhmejanova, Margarita, 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) -
Marked random graphs with given degree sequence: large deviations on the local topology
by: Baldasso, Rangel, et al.
Published: (2023)