Fetching the paper…
Reading the bibliography…
The degrees are a classical and relevant way to study the topology of a network.
On random graphs
Erdös, P. and A. Rényi (1959) · 1959
Earlier work this paper cites.
Probabilistic Models for Some Intelligence and Attainment Tests
Rasch, G. (1960) · 1960
Earlier work this paper cites.
Medical innovation: a diffusion study. indianapolis: the boobs-merrill company
Coleman, J., E. Katz, and H. Menzel (1966) · 1966
Earlier work this paper cites.
Convergence of Probability Measures
Billingsley, P. (1968) · 1968
Earlier work this paper cites.
An information flow model for conflict and fission in small groups
Zachary, W. (1977) · 1977
Earlier work this paper cites.
Structural sociometry
Holland, P. W. and S. Leinhardt (1979) · 1979
Earlier work this paper cites.
The degree variance: An index of graph heterogeneity
Snijders, T. A. B. (1981) · 1981
Earlier work this paper cites.
Social contagion and innovation: cohesion versus structural equivalence
Burt, R. (1987) · 1987
Earlier work this paper cites.
Subgraph counts in random graphs using incomplete u-statistics methods
Nowicki, K. and J. C. Wierman (1988) · 1988
Earlier work this paper cites.
Protecting adolescents from harm: findings from the national longitudinal study on adolescent health
Resnick, M., P. S. Bearman, R. W. Blum, K. E. Bauman, K. M. Harris, J. Jones, J. Tabor, T. Beuhring, R. E. Sieving, M. Shew, et al. (1997) · 1997
Earlier work this paper cites.
Asymptotic statistics
van der Vaart, A. W. (1998) · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
Barabási, A. L. and R. Albert (1999) · 1999
Earlier work this paper cites.
Centrality testing and the distribution of the degree variance in bernoulli graphs
Hagberg, J. (2000) · 2000
Earlier work this paper cites.
Estimation and prediction for stochastic block-structures
Nowicki, K. and T. Snijders (2001) · 2001
Earlier work this paper cites.
Connected components in random graphs with given expected degree sequences
Chung, F. and L. Lu (2002) · 2002
Cited alongside, same era.
General moments of degrees in random graphs
Hagberg, J. (2003) · 2003
Cited alongside, same era.
The structure and function of complex networks
Newman, M. E. (2003) · 2003
Cited alongside, same era.
Spectral analysis of random graphs with skewed degree distributions
Dasgupta, A., J. E. Hopcroft, and F. McSherry (2004) · 2004
Cited alongside, same era.
Degree variance is asymptotically normal
Bloznelis, M. (2005) · 2005
Cited alongside, same era.
Limits of dense graph sequences
Lovász, L. and B. Szegedy (2006) · 2006
Cited alongside, same era.
Uncovering structure in valued graphs: a variational approach
Mariadassou, M., S. Robin, and C. Vacher (2010) · 2010
Later among the works it cites.
The method of moments and degree distributions for network models
Bickel, P. J., A. Chen, and E. Levina (2011) · 2011
Later among the works it cites.
Stochastic blockmodels and community structure in networks
Karrer, B. and M. E. J. Newman (2011) · 2011
Later among the works it cites.
Overlapping stochastic block models with application to the French political blogosphere
Latouche, P., E. Birmelé, and C. Ambroise (2011) · 2011
Later among the works it cites.
Classification and estimation in the stochastic block model based on the empirical degrees
Channarond, A., J.-J. Daudin, and S. Robin (2012) · 2012
Later among the works it cites.
Nonparametric estimation and testing of exchangeable graph models
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Young, S. J. and E. R. Scheinerman (2007) · 2007
Cited alongside, same era.
A mixture model for random graphs
Daudin, J.-J., F. Picard, and S. Robin (2008) · 2008
Cited alongside, same era.
Graph limits and exchangeable random graphs
Diaconis, P. and S. Janson (2008) · 2008
Cited alongside, same era.
Statnet: Software tools for the representation, visualization, analysis and simulation of network data
Handcock, M., D. Hunter, C. Butss, S. Goodreau, and M. Morris (2008) · 2008
Cited alongside, same era.
Goodness of fit of social network models
Hunter, D. R., S. M. Goodreau, and M. S. Handcock (2008) · 2008
Cited alongside, same era.
Assessing the exceptionality of network motifs,
Picard, F., J.-J. Daudin, M. Koskas, S. Schbath, and S. Robin (2008) · 2008
Cited alongside, same era.
Yang, J., C. Han, and E. Airoldi (2014) · 2014
Later among the works it cites.
Hypothesis testing for automated community detection in networks
Bickel, P. J. and P. Sarkar (2016) · 2016
Closest in time.
missMDA: a package for handling missing values in multivariate data analysis
Josse, J. and F. Husson (2016) · 2016
Closest in time.
Variational bayes model averaging for graphon functions and motif frequencies inference in W W -graph models
Latouche, P. and S. Robin (2016) · 2016
Closest in time.
A goodness-of-fit test for stochastic block models
Lei, J. (2016) · 2016
Closest in time.
A test of hypotheses for random graph distributions built from eeg data
Cerqueira, A., D. Fraiman, C. D. Vargas, and F. Leonardi (2017) · 2017
Closest in time.
Statistical inference for network samples using subgraph counts
Maugis, P., C. E. Priebe, S. C. Olhede, and P. J. Wolfe (2017) · 2017
Closest in time.
Goodness of fit of logistic models for random graphs
Latouche, P., S. Robin, and S. Ouadah (2018) · 2018
Closest in time.