Fetching the paper…
Reading the bibliography…
The analysis of datasets taking the form of simple, undirected graphs continues to gain in importance across a variety of disciplines.
Functional analysis and applied mathematics
Kantorovich, L · 1952
Earlier work this paper cites.
On random graphs I
Erdős, P · 1959
Earlier work this paper cites.
Optimal error bounds for the Newton-Kantorovich theorem
Gragg, W. B · 1974
Earlier work this paper cites.
An information flow model for conflict and fission in small groups
Zachary, W. W · 1977
Earlier work this paper cites.
Analyzing the structure of the centrality-productivity literature created between 1948 and 1979
Hummon, N. P · 1979
Earlier work this paper cites.
An exponential family of probability distributions for directed graphs
Holland, P. W · 1981
Earlier work this paper cites.
Generalized Linear Models
McCullagh, P · 1989
Earlier work this paper cites.
Matrix Computations
Golub, G. H · 1996
Earlier work this paper cites.
Collective dynamics of ’small-world’ networks
Watts, D. J · 1998
Cited alongside, same era.
The structure of scientific collaboration networks
Newman, M. E. J · 2001
Cited alongside, same era.
Connected components in random graphs with given expected degree sequences
Chung, F · 2002
Cited alongside, same era.
Community structure in social and biological networks
Girvan, M · 2002
Cited alongside, same era.
Spectra of random graphs with given expected degrees
Chung, F · 2003
Cited alongside, same era.
Community structure in jazz
Gleiser, P · 2003
Cited alongside, same era.
The political blogosphere and the 2004 US election: Divided they blog
Statistical mechanics of networks
Park, J · 2004
Later among the works it cites.
Community detection in complex networks using extremal optimization
Duch, J · 2005
Later among the works it cites.
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J · 2006
Later among the works it cites.
Emergence of scaling in random networks
Barabási, A. L · 2009
Later among the works it cites.
A sequential importance sampling algorithm for generating random graphs with prescribed degrees
Blitzstein, J · 2011
Later among the works it cites.
Random graphs with a given degree sequence
Chatterjee, S · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adamic, L. A · 2004
Cited alongside, same era.
MM algorithms for generalized Bradley-Terry models
Hunter, D. R · 2004
Cited alongside, same era.
Stochastic blockmodels and community structure in networks
Karrer, B · 2011
Later among the works it cites.
Maximum likelihood estimation in network models
Rinaldo, A · 2011
Later among the works it cites.