2.1k citations · 2.3k across the 3 of their papers we have counts for
5 papers
(Un)detectable cluster structure in sparse networks
Joerg Reichardt, Michele Leone
We study the problem of recovering a known cluster structure in a sparse network, also known as the planted partitioning problem, by means of statistical mechanics. We find a sharp…
Partitioning and modularity of graphs with arbitrary degree distribution
Joerg Reichardt, Stefan Bornholdt
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In c…
Statistical Mechanics of Community Detection
Joerg Reichardt, Stefan Bornholdt
Starting from a general \textit{ansatz}, we show how community detection can be interpreted as finding the ground state of an infinite range spin glass. Our approach applies to wei…
eBay users form stable groups of common interest
Joerg Reichardt, Stefan Bornholdt
Market segmentation of an online auction site is studied by analyzing the users' bidding behavior. The distribution of user activity is investigated and a network of bidders connec…
Detecting fuzzy community structures in complex networks with a Potts model
Joerg Reichardt, Stefan Bornholdt
A fast community detection algorithm based on a q-state Potts model is presented. Communities in networks (groups of densely interconnected nodes that are only loosely connected to…