Exponential Chebyshev inequalities for random graphons and their applications
From MaRDI portal
Recommendations
- Chebyshev-type inequalities and large deviation principles
- The large deviation principle for the Erdős-Rényi random graph
- Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph
- The large deviation principle for inhomogeneous Erdős-Rényi random graphs
- A large deviation principle for the Erdős-Rényi uniform random graph
Cites work
- Asymptotic analysis of random walks. Rapidly decreasing distributions of increments
- Chebyshev-type exponential inequalities for sums of random vectors and for trajectories of random walks
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3787772 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- Introduction to Real Analysis
- Metrics for sparse graphs
- Random graphs.
- The large deviation principle for the Erdős-Rényi random graph
Cited in
(4)
This page was built for publication: Exponential Chebyshev inequalities for random graphons and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203445)