2006
DOI: 10.1103/physreve.74.016110
|View full text |Cite
|
Sign up to set email alerts
|

Statistical mechanics of community detection

Abstract: Starting from a general ansatz, we show how community detection can be interpreted as finding the ground state of an infinite range spin glass. Our approach applies to weighted and directed networks alike. It contains the at hoc introduced quality function from [1] and the modularity Q as defined by Newman and Girvan [2] as special cases. The community structure of the network is interpreted as the spin configuration that minimizes the energy of the spin glass with the spin states being the community indices. … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

15
1,603
0
15

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 1,713 publications
(1,684 citation statements)
references
References 30 publications
15
1,603
0
15
Order By: Relevance
“…The goal of such algorithms is to find clusters with strong connectivity and group them together. While a number of different algorithms exist, we used one which uses spin glass quality function from magnetic systems and modularity optimization in its computation 52 .…”
Section: Social Metricsmentioning
confidence: 99%
“…The goal of such algorithms is to find clusters with strong connectivity and group them together. While a number of different algorithms exist, we used one which uses spin glass quality function from magnetic systems and modularity optimization in its computation 52 .…”
Section: Social Metricsmentioning
confidence: 99%
“…We used the spin-glass algorithm, which tests for communities in the network whereby the number and weighted strength of edges within a cluster exceed the number and weighted strength of edges between nodes in another cluster (Reichardt & Bornholdt, 2006). We applied the spin-glass community function of the R package igraph over the glasso network (weights = null, vertex = null, parupdate = false, gamma = 0.5, start temperature = 1, stop temperature = 0.01, cooling factor = 0.99, spins = 17) (Csardi & Nepusz, 2006).…”
Section: Methodsmentioning
confidence: 99%
“…Specifically, we need to establish whether all psychological networks can be validly conceptualized as "spinglasses" (i.e., extensions of Ising models; Reichardt & Bornholdt, 2006). More generally, we need to establish whether we can use the structural topography of a network (i.e., the constellation and weight of edges between nodes) to infer community structure validly in psychological networks.…”
Section: Discussion and Next Stepsmentioning
confidence: 99%
“…One such method is the spinglass community detection algorithm. The spinglass algorithm uses simulations based on the Potts-model from statistical mechanics (Reichardt & Bornholdt, 2006). Due to the simulations, the algorithm is non-deterministic.…”
mentioning
confidence: 99%