Very large graphs
From MaRDI portal
Publication:3645674
zbMath1179.05100arXiv0902.0132MaRDI QIDQ3645674
Publication date: 18 November 2009
Full work available at URL: https://arxiv.org/abs/0902.0132
graphonproperty testingsparse graphsdense graphsneighborhood samplingsubgraph samplingvery large finite graphs
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Internet topics (68M11)
Related Items (24)
Reciprocity in directed networks ⋮ Edgeworth expansions for network moments ⋮ Bootstrapping exchangeable random graphs ⋮ Non-perturbative graph languages, halting problem and complexity ⋮ Asymptotic structure of constrained exponential random graph models ⋮ Replica symmetry in upper tails of mean-field hypergraphs ⋮ An approximate version of Sidorenko's conjecture ⋮ On an anti-Ramsey threshold for random graphs ⋮ Extremal graph theory and finite forcibility ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Matrix and discrepancy view of generalized random and quasirandom graphs ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ An equation-free approach to coarse-graining the dynamics of networks ⋮ Testing goodness of fit of random graph models ⋮ Asymptotic structure and singularities in constrained directed graphs ⋮ The dynamics of non-perturbative phases via Banach bundles ⋮ An analytic approach to stability ⋮ The analytic evolution of Dyson-Schwinger equations via homomorphism densities ⋮ On the phase transition curve in a directed exponential random graph model ⋮ The number of cliques in graphs of given order and size ⋮ A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma ⋮ Asymptotics of Visibility in the Hyperbolic Plane ⋮ Emergent Structures in Large Networks
This page was built for publication: Very large graphs
