Abstract
Given a graph, the popular “modularity” clustering method specifies a partition of the vertex set as the solution of a certain optimization problem. In this paper, we discuss scaling limits of this method with respect to random geometric graphs constructed from i.i.d. points
Citation
Erik Davis. Sunder Sethuraman. "Consistency of modularity clustering on random geometric graphs." Ann. Appl. Probab. 28 (4) 2003 - 2062, August 2018. https://doi.org/10.1214/17-AAP1313
Information