Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research)
DOI10.1007/978-3-030-42687-3_7zbMath1440.68212arXiv1710.08878OpenAlexW3042828438MaRDI QIDQ5118665
No author found.
Publication date: 26 August 2020
Published in: Advances in Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.08878
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- On the rate of convergence in Wasserstein distance of the empirical measure
- Oracle inequalities for network models and sparse graphon estimation
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Representations for partially exchangeable arrays of random variables
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Mean rates of convergence of empirical measures in the Wasserstein metric
- Graph Classification and Clustering Based on Vector Space Embedding
- Graph limits and exchangeable random graphs
- Community Detection and Stochastic Block Models
- Learning Theory and Kernel Machines
- Making polynomials robust to noise
- Statistical topological data analysis using persistence landscapes
This page was built for publication: Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research)
