Metrics for sparse graphs

zbMath1182.05106arXiv0708.1919MaRDI QIDQ3656241

Oliver Riordan, Béla Bollobás

Publication date: 13 January 2010

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

Mathematics Subject Classification ID

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

Related Items (44)

A counterexample to the Bollobás–Riordan conjectures on sparse graph limits ⋮ Nonlinear large deviations ⋮ Interview with Yufei Zhao ⋮ Testing for Equivalence of Network Distribution Using Subgraph Counts ⋮ Graphons and renormalization of large Feynman diagrams ⋮ A graphon counter example ⋮ Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics ⋮ A statistical mechanical model for non-perturbative regimes ⋮ Continuum limit of p-Laplacian evolution problems on graphs: L^q graphons and sparse graphs ⋮ Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon ⋮ Graph limits and hereditary properties ⋮ Continuum Limits of Nonlocal $p$-Laplacian Variational Problems on Graphs ⋮ Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs ⋮ Graph polynomials associated with Dyson-Schwinger equations ⋮ Kontsevich Graphons ⋮ Poset limits and exchangeable random posets ⋮ From Dyson-Schwinger equations to quantum entanglement ⋮ On sparsity, power-law, and clustering properties of graphex processes ⋮ Convergence of graphs with intermediate density ⋮ Exponential Chebyshev inequalities for random graphons and their applications ⋮ Interval graph limits ⋮ Estimating and understanding exponential random graph models ⋮ The large deviation principle for the Erdős-Rényi random graph ⋮ Quasi-random graphs and graph limits ⋮ Differential calculus on the space of countable labelled graphs ⋮ Semantic limits of dense combinatorial objects ⋮ Optimal couplings between sparse block models ⋮ The dynamics of non-perturbative phases via Banach bundles ⋮ The complexities of nonperturbative computations ⋮ Graphon-valued stochastic processes from population genetics ⋮ An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence ⋮ Respondent-driven sampling and sparse graph convergence ⋮ Sparse exchangeable graphs and their limits via graphon processes ⋮ Sampling and estimation for (sparse) exchangeable graphs ⋮ The cut metric, random graphs, and branching processes ⋮ The analytic evolution of Dyson-Schwinger equations via homomorphism densities ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ An introduction to large deviations for random graphs ⋮ An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ Higher-order fluctuations in dense random graph models ⋮ Remarks on power-law random graphs ⋮ Linear embeddings of graphs and graph limits ⋮ A relative Szemerédi theorem

This page was built for publication: Metrics for sparse graphs