References

Albert, Reka, and Albert-Laszlo Barabasi. 2002. “Statistical Mechanics of Complex Networks.” Rev. Mod. Phys. 74 (1): 47–97. https://doi.org/10.1103/RevModPhys.74.47.

Bahoken, Françoise, Laurent Beauguitte, and Serge Lhomme. 2013. “La visualisation des réseaux. Principes, enjeux et perspectives.” https://halshs.archives-ouvertes.fr/halshs-00839905.

Berge, Claude. 1976. Graphs and Hypergraphs. Revised. North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York.

Bhagat, Smriti, Moira Burke, Carlos Diuk, Ismail Onur Filiz, and Sergey Edunov. 2016. “Three and a Half Degrees of Separation.” facebook research blog https://research.fb.com/three-and-a-half-degrees-of-separation/.

Bhatia, Rajendra. 1997. Matrix Analysis. Graduate Texts in Mathematics, 169. New York: Springer-Verlag.

Bishop, Christopher M. 2006. Pattern Recognition and Machine Learning. Information Science and Statistics. Springer, New York.

Blondel, Vincent D., Jean L. Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. “Fast Unfolding of Communities in Large Networks.” Journal of Statistical Mechanics: Theory and Experiment 99 (10): 7821–6.

Bollobás, B. 1985. Random Graphs. Academic, London.

Chatterjee, Sourav, and Persi Diaconis. 2013. “Estimating and Understanding Exponential Random Graph Models.” The Annals of Statistics 41 (5): 2428–61.

Dempster, A. P., N. M. Laird, and D. B. Rubin. 1977. “Maximum Likelihood from Incomplete Data via the EM Algorithm.” J. Roy. Statist. Soc. Ser. B 39 (1): 1–38.

Erdős, P., and T. Gallai. 1961. “Graphs with points of prescribed degree. (Graphen mit Punkten vorgeschriebenen Grades.).” Mat. Lapok 11: 264–74.

Erdős, P., and A. Rényi. 1959. “On Random Graphs. I.” Publicationes Mathematicae 6: 290–97.

Fruchterman, Thomas M. J., and Edward M. Reingold. 1991. “Graph Drawing by Force-Directed Placement.” Software: Practice and Experience 21 (11): 1129–64.

Girvan, M., and M. E. J. Newman. 2002. “Community Structure in Social and Biological Networks.” Proceedings of the National Academy of Sciences 99 (12): 7821–6. https://doi.org/10.1073/pnas.122653799.

Handcock, M., A. Raftery, and J. Tantrum. 2007. “Model-Based Clustering for Social Networks.” Journal of the Royal Statistical Society: Series A (Statistics in Society) 170 (2): 301–54.

Hoff, P. D., A. E. Raftery, and M. S. Handcock. 2002. “Latent Space Approaches to Social Network Analysis.” J. Amer. Statist. Assoc. 97 (460): 1090–98.

Ji, Shuiwang, Wenlu Zhang, and Rongjian Li. 2014. “A Probabilistic Latent Semantic Analysis Model for Coclustering the Mouse Brain Atlas.” IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (6): 1460–8.

Kamada, T., and S. Kawai. 1989. “An Algorithm for Drawing General Undirected Graphs.” Information Processing Letters 31 (1): 7–15.

Kolaczyk, Eric D. 2009. Statistical Analysis of Network Data: Methods and Models. Springer.

Kolaczyk, Eric D., and Gábor Csárdi. 2014. Statistical Analysis of Network Data with R. Use R! Springer, New York.

Lauritzen, Steffen L. 1996. Graphical Models. Vol. 17. Oxford Statistical Science Series. The Clarendon Press, Oxford University Press, New York.

Lei, Jing, and Alessandro Rinaldo. 2015. “Consistency of Spectral Clustering in Stochastic Block Models.” The Annals of Statistics 43 (1): 215–37.

Lhomme, Serge. 2012. “Les modèles de graphes théoriques.” https://halshs.archives-ouvertes.fr/halshs-00773006.

Luke, Douglas A. 2015. A User’s Guide to Network Analysis in R. Springer.

Luxburg, Ulrike von. 2007. “A Tutorial on Spectral Clustering.” Statistics and Computing 17 (4): 395–416. http://dx.doi.org/10.1007/s11222-007-9033-z.

Luxburg, Ulrike von, Mikhail Belkin, and Olivier Bousquet. 2008. “Consistency of Spectral Clustering.” The Annals of Statistics 36 (2): 555–86.

Milgram, Stanley. 1967. “The Small World Problem.” Psychology Today 1 (60): –.

Ng, Andrew Y., Michael I. Jordan, and Yair Weiss. 2001. “On Spectral Clustering: Analysis and an Algorithm.” In Advances in Neural Information Processing Systems, 849–56. MIT Press.

Rohe, K., S. Chatterjee, and B. Yu. 2011. “Spectral Clustering and the High-Dimensional Stochastic Blockmodel.” Annals of Statistics 39 (4): 1878–1915.

Schweinberger, Michael, and Mark S. Handcock. 2015. “Local Dependence in Random Graph Models: Characterization, Properties and Statistical Inference.” Journal of the Royal Statistical Society: Series B (Statistical Methodology) 77 (3): 647–76.

Tufte, Edward R. 2001. The Visual Display of Quantitative Information. Cheshire, CT: Graphics Press.

Yook, Soon-Hyung, Hawoong Jeong, and Albert-Laszlo Barabasi. 2001. “Modeling the Internet’s Large-Scale Topology.”