Localized geometry detection in scale-free random graphs

Abstract

We consider the problem of detecting whether a power-law inhomogeneous random graph contains a geometric community, and we frame this as an hypothesis testing problem. More precisely, we assume that we are given a sample from an unknown distribution on the space of graphs on n vertices. Under the null hypothesis, the sample originates from the inhomogeneous random graph with a heavy-tailed degree sequence. Under the alternative hypothesis, $k=o(n)$ vertices are given spatial locations and connect between each other following the geometric inhomogeneous random graph connection rule. The remaining $n-k$ vertices follow the inhomogeneous random graph connection rule. We propose a simple and efficient test, which is based on counting normalized triangles, to differentiate between the two hypotheses. We prove that our test correctly detects the presence of the community with high probability as $n\to \infty$, and identifies large-degree vertices of the community with high probability.

arXiv comment30 pages, 3 figures

References in corpus (13)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Modularity and community structure in networks
• Hyperbolic Geometry of Complex Networks
• Properties of highly clustered networks
• Sustaining the Internet with Hyperbolic Mapping
• Fast community detection by SCORE
• Network Geometry
• Network Mapping by Replaying Hyperbolic Growth
• Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
• Clustering Spectrum of scale-free networks
• Detecting hyperbolic geometry in networks: why triangles are not enough
• Detecting a planted community in an inhomogeneous random graph