Fetching the paper…
Reading the bibliography…
We study the problem of graph partitioning, or clustering, in sparse networks with prior information about the clusters.
L. Viana and A. J. Bray, J. Phys C, 18
1985
Earlier work this paper cites.
M. Mezard and G. Parisi, Europhys. Lett. 3
1987
Earlier work this paper cites.
I. Kanter and H. Sompolinsky, Phys. Rev. Lett. 58
1987
Earlier work this paper cites.
Y. Y. Goldschmidt, Phys. Rev. B 43
1991
Earlier work this paper cites.
A. Condon and R. M. Karp Algorithms for Graph Partitioning on the Planted Partition Model
2001
Earlier work this paper cites.
M. Mezard and G. Parisi, Eur. Phys. J. B 20
2001
Earlier work this paper cites.
M. E. J. Newman, Phys. Rev. E 70
2004
Cited alongside, same era.
L. Danon et al
2005
Cited alongside, same era.
G. Getz, N. Shental, and E. Domany, Semi-supervised learning Ð a statistical physics approach
2005
Cited alongside, same era.
M. E. J. Newman, PNAS 103
2006
Cited alongside, same era.
J. Reichardt and S. Bornholdt, Phys. Rev. E 74
2006
Cited alongside, same era.
Let us mention that the straightforward application ( 6
Cited in the paper.
J. Reichardt and M. Leone, Phys. Rev. Lett. 101
2008
Later among the works it cites.
M. Leone et al
2008
Later among the works it cites.
X. Zhu and A. B. Goldberg, Introduction to Semi-Supervised Learning
2009
Closest in time.
Yong-Yeol Ahn, J. P. Bagrow, Sune Lehmann, arXiv:0903.3178 (2009)
2009
Closest in time.
S. Fortunato, Physics Reports 486
2010
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…