Statistical test for detecting community structure in real-valued edge-weighted graphs.
We propose a novel method to test the existence of community structure in undirected, real-valued, edge-weighted graphs. The method is based on the asymptotic behavior of extreme eigenvalues of a real symmetric edge-weight matrix. We provide a theoretical foundation for this method and report on its...
Main Author: | Tomoki Tokuda |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5860707?pdf=render |
Similar Items
-
Graphs with vertex-coloring and detectable 2-edge-weighting
by: N. Paramaguru, et al.
Published: (2016-08-01) -
Communities and Anomaly Detection in Large Edged-Labeled Graphs
by: Miguel Ramos de Araújo
Published: (2019) -
Statistical inference for valued-edge networks: the generalized exponential random graph model.
by: Bruce A Desmarais, et al.
Published: (2012-01-01) -
ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs
by: Héctor Muñoz, et al.
Published: (2021-02-01) -
Edge Degree Weight of Sequential Join of Graphs
by: Khidir R. Sharaf, et al.
Published: (2013-09-01)