The large deviation principle for inhomogeneous Erdős-Rényi random graphs

DOI10.1007/s10959-022-01181-1zbMath1515.05161arXiv2010.03504OpenAlexW4282834232WikidataQ114225088 ScholiaQ114225088MaRDI QIDQ6161583

Maarten Markering

Publication date: 5 June 2023

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.03504

zbMATH Keywords

graphonlarge deviationsrate functionlargest eigenvalueinhomogeneous Erdős-Rényi random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Large deviations (60F10)

Related Items (3)

A large-deviations principle for all the components in a sparse inhomogeneous random graph ⋮ A sample-path large deviation principle for dynamic Erdős-Rényi random graphs ⋮ Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The large deviation principle for the Erdős-Rényi random graph
• Large deviation for uniform graphs with given degrees
• Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Estimating and understanding exponential random graph models
• An introduction to large deviations for random graphs

This page was built for publication: The large deviation principle for inhomogeneous Erdős-Rényi random graphs