Exponential Chebyshev inequalities for random graphons and their applications

DOI10.1134/S0037446620040114zbMath1448.05180OpenAlexW3045654910WikidataQ115526031 ScholiaQ115526031MaRDI QIDQ2203445

Yanyan Li

Publication date: 7 October 2020

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446620040114

zbMATH Keywords

graphonlaw of large numberslarge deviation principleErdős-Rényi graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Chebyshev-Type Inequalities and Large Deviation Principles ⋮ Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• The large deviation principle for the Erdős-Rényi random graph
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Chebyshev-Type Exponential Inequalities for Sums of Random Vectors and for Trajectories of Random Walks
• Metrics for sparse graphs
• Introduction to Real Analysis

This page was built for publication: Exponential Chebyshev inequalities for random graphons and their applications