Fetching the paper…
Reading the bibliography…
A large body of work has been devoted to defining and identifying clusters or communities in social and information networks.
Influence through social communication
K.W. Back · 1951
Earlier work this paper cites.
A novitiate in a period of change: An experimental and case study of social relationships
S.F. Sampson · 1968
Earlier work this paper cites.
A lower bound for the smallest eigenvalue of the laplacian
J. Cheeger · 1969
Earlier work this paper cites.
An effective heuristic procedure for partitioning graphs
B. Kernighan and S. Lin · 1970
Earlier work this paper cites.
Graph-theoretical methods for detecting and describing gestalt clusters
C.T. Zahn · 1971
Earlier work this paper cites.
Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices
W.E. Donath and A.J. Hoffman · 1972
Earlier work this paper cites.
Algebraic connectivity of graphs
M. Fiedler · 1973
Earlier work this paper cites.
An information flow model for conflict and fission in small groups
W.W. Zachary · 1977
Earlier work this paper cites.
A linear-time heuristic for improving network partitions
C.M. Fiduccia and R.M. Mattheyses · 1982
Earlier work this paper cites.
Random Graphs
B. Bollobás · 1985
Earlier work this paper cites.
A new approach to the maximum-flow problem
A.V. Goldberg and R.E. Tarjan · 1988
Earlier work this paper cites.
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
T. Leighton and S. Rao · 1988
Earlier work this paper cites.
A fast parametric maximum flow algorithm and applications
G. Gallo, M.D. Grigoriadis, and R.E. Tarjan · 1989
Earlier work this paper cites.
The Laplacian spectrum of graphs
B. Mohar · 1991
Earlier work this paper cites.
Finding near-optimal cuts: an empirical evaluation
K. Lang and S. Rao · 1993
Earlier work this paper cites.
Social Network Analysis
S. Wasserman and K. Faust · 1994
Earlier work this paper cites.
On implementing push-relabel method for the maximum flow problem
B.V. Cherkassky and A.V. Goldberg · 1995
Earlier work this paper cites.
A multilevel algorithm for partitioning graphs
B. Hendrickson and R. Leland · 1995
Earlier work this paper cites.
A critical point for random graphs with a given degree sequence
M. Molloy and B. Reed · 1995
Earlier work this paper cites.
Spectral partitioning works: Planar graphs and finite element meshes
D.A. Spielman and S.-H. Teng · 1996
Earlier work this paper cites.
http://www.routeviews.org
University of Oregon Route Views Project. Online data and reports · 1997
Earlier work this paper cites.
Spectral graph theory
F.R.K. Chung · 1997
Earlier work this paper cites.
Grooming, Gossip, and the Evolution of Language
Robin Dunbar · 1998
Earlier work this paper cites.
Inferring web communities from link topology
D. Gibson, J. Kleinberg, and P. Raghavan · 1998
Earlier work this paper cites.
Beyond the flow decomposition barrier
A.V. Goldberg and S. Rao · 1998
Earlier work this paper cites.
On the quality of spectral separators
S. Guattery and G.L. Miller · 1998
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
G. Karypis and V. Kumar · 1998
Earlier work this paper cites.
Multilevel k-way partitioning scheme for irregular graphs
G. Karypis and V. Kumar · 1998
Earlier work this paper cites.
The size of the giant component of a random graph with a given degree sequence
M. Molloy and B. Reed · 1998
Earlier work this paper cites.
Collective dynamics of small-world networks
D.J. Watts and S.H. Strogatz · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
R. Z. Albert and A-L. Barabási · 1999
Earlier work this paper cites.
The diameter of the world wide web
R. Z. Albert, H. Jeong, and A-L. Barabási · 1999
Earlier work this paper cites.
On power-law relationships of the internet topology
M. Faloutsos, P. Faloutsos, and C. Faloutsos · 1999
Earlier work this paper cites.
Data clustering: a review
A.K. Jain, M.N. Murty, and P.J. Flynn · 1999
Earlier work this paper cites.
Trawling the web for emerging cyber-communities
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins · 1999
Earlier work this paper cites.
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
T. Leighton and S. Rao · 1999
Earlier work this paper cites.
http://ir.dcs.gla.ac.uk/test_collections/wt10g.html
TREC Web Corpus: WT10g · 2000
Earlier work this paper cites.
A random graph model for massive graphs
W. Aiello, F.R.K. Chung, and L. Lu · 2000
Earlier work this paper cites.
Graph structure in the Web
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener · 2000
Earlier work this paper cites.
Power laws, highly optimized tolerance, and generalized source coding
J. Doyle and J.M. Carlson · 2000
Earlier work this paper cites.
Efficient identification of web communities
G.W. Flake, S. Lawrence, and C.L. Giles · 2000
Earlier work this paper cites.
Stochastic models for the web graph
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal · 2000
Earlier work this paper cites.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
J.B. Tenenbaum, V. de Silva, and J.C. Langford · 2000
Earlier work this paper cites.
A random graph model for power law graphs
W. Aiello, F.R.K. Chung, and L. Lu · 2001
Earlier work this paper cites.
The diameter of sparse random graphs
F.R.K. Chung and L. Lu · 2001
Earlier work this paper cites.
Lethality and centrality in protein networks
H. Jeong, S.P. Mason, A-L. Barabási, and Z.N. Oltvai · 2001
Earlier work this paper cites.
The diameter of random massive graphs
L. Lu · 2001
Earlier work this paper cites.
Identifying web browsing trends and patterns
A.L. Montgomery and C. Faloutsos · 2001
Earlier work this paper cites.
A simple conceptual model for the internet topology
S.L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos · 2001
Earlier work this paper cites.
http://www.google.com/programming-contest/
Google Programming Contest · 2002
Earlier work this paper cites.
Statistical mechanics of complex networks
R. Z. Albert and A-L. Barabási · 2002
Earlier work this paper cites.
The average distances in random graphs with given expected degrees
F.R.K. Chung and L. Lu · 2002
Earlier work this paper cites.
Connected components in random graphs with given expected degree sequences
F.R.K. Chung and L. Lu · 2002
Earlier work this paper cites.
Evolution of networks
S.N. Dorogovtsev and J.F.F. Mendes · 2002
Cited alongside, same era.
Complexity and robustness
J. Doyle and J.M. Carlson · 2002
Cited alongside, same era.
Heuristically optimized trade-offs: A new paradigm for power laws in the Internet
A. Fabrikant, E. Koutsoupias, and C.H. Papadimitriou · 2002
Cited alongside, same era.
Self-organization and identification of web communities
G.W. Flake, S. Lawrence, C.L. Giles, and F.M. Coetzee · 2002
Cited alongside, same era.
Community structure in social and biological networks
M. Girvan and M.E.J. Newman · 2002
Cited alongside, same era.
On the eigenvalue power law
M. Mihail and C.H. Papadimitriou · 2002
Cited alongside, same era.
Random forest similarity for protein-protein interaction prediction from multiple sources
Y. Qi, J.K. Seetharaman, and Z.B. Joseph · 2005
Later among the works it cites.
A spectral clustering approach to finding communities in graphs
S. White and P. Smyth · 2005
Later among the works it cites.
http://www.netflixprize.com/
Netflix prize · 2006
Later among the works it cites.
Local graph partitioning using PageRank vectors
R. Andersen, F.R.K. Chung, and K. Lang · 2006
Later among the works it cites.
Communities from seed sets
R. Andersen and K. Lang · 2006
Later among the works it cites.
Group formation in large social networks: membership, growth, and evolution
L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Ravasz, A.L. Somera, D.A. Mongru, Z.N. Oltvai, and A.-L. Barabási · 2002
Cited alongside, same era.
Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design
M. Ripeanu, I. Foster, and A. Iamnitchi · 2002
Cited alongside, same era.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S. Burer and R.D.C. Monteiro · 2003
Cited alongside, same era.
The average distances in a random graph with given expected degrees
F.R.K. Chung and L. Lu · 2003
Cited alongside, same era.
Eigenvalues of random power law graphs
F.R.K. Chung, L. Lu, and Van Vu · 2003
Cited alongside, same era.
The spectra of random graphs with given expected degrees
F.R.K. Chung, L. Lu, and Van Vu · 2003
Cited alongside, same era.
The mixing time of the giant component of a random graph
I. Benjamini, G. Kozma, and N. Wormald · 2006
Later among the works it cites.
Complex networks: Structure and dynamics
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.U. Hwang · 2006
Later among the works it cites.
Graph mining: Laws, generators, and algorithms
D. Chakrabarti and C. Faloutsos · 2006
Later among the works it cites.
Complex Graphs and Networks
F.R.K. Chung and L. Lu · 2006
Later among the works it cites.
The volume of the giant component of a random graph with given expected degrees
F.R.K. Chung and L. Lu · 2006
Later among the works it cites.
Structural inference of hierarchies in networks
A. Clauset, C. Moore, and M.E.J. Newman · 2006
Later among the works it cites.
Spectral scaling and good expansion properties in complex networks
E. Estrada · 2006
Later among the works it cites.
Community detection as an inference problem
M.B. Hastings · 2006
Later among the works it cites.
Expander graphs and their applications
S. Hoory, N. Linial, and A. Wigderson · 2006
Later among the works it cites.
Graph partitioning using single commodity flows
R. Khandekar, S. Rao, and U. Vazirani · 2006
Later among the works it cites.
Structure and evolution of online social networks
R. Kumar, J. Novak, and A. Tomkins · 2006
Later among the works it cites.
Towards a theory of scale-free graphs: Definition, properties, and implications
L. Li, J.C. Doyle, and W. Willinger · 2006
Later among the works it cites.
On certain connectivity properties of the internet topology
M. Mihail, C.H. Papadimitriou, and A. Saberi · 2006
Later among the works it cites.
Finding community structure in networks using the eigenvectors of matrices
M.E.J. Newman · 2006
Later among the works it cites.
Modularity and community structure in networks
M.E.J. Newman · 2006
Later among the works it cites.
Jellyfish: A conceptual model for the as internet topology
G. Siganos, S.L. Tauro, and M. Faloutsos · 2006
Later among the works it cites.
A tutorial on spectral clustering
U. von Luxburg · 2006
Later among the works it cites.
Growth model for complex networks with hierarchical and modular structures
Q. Xuan, Y. Li, and T.-J. Wu · 2006
Later among the works it cites.
http://www-personal.umich.edu/~mejn/netdata/
Network data · 2007
Later among the works it cites.
A combinatorial, primal-dual approach to semidefinite programs
S. Arora and S. Kale · 2007
Later among the works it cites.
Experimental evaluation of parametric max-flow algorithms
M. Babenko, J. Derryberry, A. Goldberg, R. Tarjan, and Y. Zhou · 2007
Later among the works it cites.
Engineering graph clustering: Models and experimental evaluation
U. Brandes, M. Gaertler, and D. Wagner · 2007
Later among the works it cites.
Visualization of large networks with min-cut plots, A-plots and R-MAT
D. Chakrabarti, C. Faloutsos, and Y. Zhan · 2007
Later among the works it cites.
Four proofs of cheeger inequality and graph partition algorithms
F.R.K Chung · 2007
Later among the works it cites.
The heat kernel as the pagerank of a graph
F.R.K. Chung · 2007
Later among the works it cites.
Random walks and local cuts in graphs
F.R.K. Chung · 2007
Later among the works it cites.
Power-law distributions in empirical data
A. Clauset, C.R. Shalizi, and M.E.J. Newman · 2007
Later among the works it cites.
Characterization of complex networks: A survey of measurements
L. da F. Costa, F.A. Rodrigues, G. Travieso, and P.R. Villas Boas · 2007
Later among the works it cites.
Weighted graph cuts without eigenvectors: A multilevel approach
I.S. Dhillon, Y. Guan, and B. Kulis · 2007
Later among the works it cites.
The diameter of sparse random graphs
D. Fernholz and V. Ramachandran · 2007
Later among the works it cites.
A geometric preferential attachment model of networks II
A.D. Flaxman, A.M. Frieze, and J. Vera · 2007
Later among the works it cites.
Resolution limit in community detection
S. Fortunato and M. Barthélemy · 2007
Later among the works it cites.
The evolution of the mixing rate
N. Fountoulakis and B. Reed · 2007
Later among the works it cites.
Faster mixing and small bottlenecks
N. Fountoulakis and B.A. Reed · 2007
Later among the works it cites.
Robustness of community structure in networks
B. Karrer, E. Levina, and M.E.J. Newman · 2007
Later among the works it cites.
The dynamics of viral marketing
J. Leskovec, L.A. Adamic, and B.A. Huberman · 2007
Later among the works it cites.
Scalable modeling of real graphs using kronecker multiplication
J. Leskovec and C. Faloutsos · 2007
Later among the works it cites.
Graph evolution: Densification and shrinking diameters
J. Leskovec, J. Kleinberg, and C. Faloutsos · 2007
Later among the works it cites.
Patterns of cascading behavior in large blog graphs
J. Leskovec, M. McGlohon, C. Faloutsos, N.S. Glance, and M. Hurst · 2007
Later among the works it cites.
Mixture models and exploratory analysis in networks
M.E.J. Newman and E.A. Leicht · 2007
Later among the works it cites.
Near linear time algorithm to detect community structures in large-scale networks
U. Nandini Raghavan, R.Z. Albert, and S. Kumara · 2007
Later among the works it cites.
Partitioning and modularity of graphs with arbitrary degree distribution
J. Reichardt and S. Bornholdt · 2007
Later among the works it cites.
Applying common identity and bond theory to design of online communities
Y. Ren, R. Kraut, and S. Kiesler · 2007
Later among the works it cites.
An information-theoretic framework for resolving community structure in complex networks
M. Rosvall and C.T. Bergstrom · 2007
Later among the works it cites.
Graph clustering
S.E. Schaeffer · 2007
Later among the works it cites.
Statistical properties of community structure in large social and information networks
J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2008
Closest in time.
Statistical properties of community structure in large social and information networks
J. Leskovec, K.J. Lang, A. Dasgupta, and M.W. Mahoney · 2008
Closest in time.