Identifiability for Graphexes and the Weak Kernel Metric
Publication:3295264
DOI10.1007/978-3-662-59204-5_3zbMath1443.05169arXiv1804.03277OpenAlexW2797787146MaRDI QIDQ3295264
Henry Cohn, László Miklós Lovász, Jennifer T. Chayes, Christian Borgs
Publication date: 8 July 2020
Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.03277
regularityPoisson processidentifiabilitysparse networkexpected subgraph countsgraphexweak kernel metric
Nonparametric estimation (62G05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Random measures (60G57) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Exchangeability for stochastic processes (60G09)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Sampling perspectives on sparse exchangeable graphs
- Sampling and estimation for (sparse) exchangeable graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Regularity partitions and the topology of graphons
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- An Introduction to the Theory of Point Processes
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Graphons, cut norm and distance, couplings and rearrangements
- Probability Inequalities for Sums of Bounded Random Variables
- Measure Theory
- Probabilistic Symmetries and Invariance Principles
This page was built for publication: Identifiability for Graphexes and the Weak Kernel Metric
