A Quest to Unravel the Metric Structure Behind Perturbed Networks
From MaRDI portal
Publication:4580131
DOI10.4230/LIPIcs.SoCG.2017.53zbMath1432.68368arXiv1703.05475OpenAlexW2605132528MaRDI QIDQ4580131
Minghao Tian, David Sivakoff, Srinivasan Parthasarathy, Yusu Wang
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1703.05475
Probability measures on topological spaces (60B05) Nonparametric estimation (62G05) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
On the clique number of noisy random geometric graphs ⋮ Phase transition in noisy high-dimensional random geometric graphs ⋮ Adaptive estimation of nonparametric geometric graphs ⋮ On the estimation of latent distances using graph distances
This page was built for publication: A Quest to Unravel the Metric Structure Behind Perturbed Networks
