Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-22T15:42:27.941Z Has data issue: false hasContentIssue false
Series:   SemStat Elements

Topics at the Frontier of Statistics and Network Analysis

(Re)Visiting the Foundations

Published online by Cambridge University Press:  06 June 2017

Eric D. Kolaczyk
Eric D. Kolaczyk
Affiliation:
Boston University

Summary

This snapshot of the current frontier of statistics and network analysis focuses on the foundational topics of modeling, sampling, and design. Primarily for graduate students and researchers in statistics and closely related fields, emphasis is not only on what has been done, but on what remains to be done.
Get access
Type
Element
Information
Series: SemStat Elements
Online ISBN: 9781108290159
Publisher: Cambridge University Press
Print publication: 10 August 2017

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abbe, E., and Sandon, C. 2015. Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery. 56th IEEE Annual Symposium on Foundations of Computer Science (FOCS), 670–688.Google Scholar
Achlioptas, D., Clauset, A., Kempe, D., and Moore, C. 2005. On the bias of trace-route sampling. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 694–703.Google Scholar
Ahmed, N.K., Neville, J., and Kompella, R. 2010. Reconsidering the foundations of network sampling. Proceedings of the 2nd Workshop on Information in Networks.Google Scholar
Ahmed, N.K., Neville, J., and Kompella, R. 2014. Network sampling: From static to streaming graphs. ACM Transactions on Knowledge Discovery from Data (TKDD), 8(2), 7.CrossRefGoogle Scholar
Aicher, C., Jacobs, A.Z., and Clauset, A. 2014. Learning latent block structure in weighted networks. Journal of Complex Networks, cnu026.Google Scholar
Airoldi, E.M., Blei, D.M., Fienberg, S.E., and Xing, E.P. 2008. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9(Sep), 1981–2014.Google Scholar
Airoldi, E.M., Choi, D.S., and Wolfe, P.J. 2011. Confidence sets for network structure. Statistical Analysis and Data Mining, 4(5), 461–469.Google Scholar
Airoldi, E.M., Costa, T.B., and Chan, S.H. 2013. Stochastic blockmodel approximation of a graphon: Theory and consistent estimation. Advances in Neural Information Processing Systems, 692–700.Google Scholar
Aldous, D. 1985. Exchangeability and related topics. École d’Été de Probabilités de Saint-Flour XIII1983, 1–198.Google Scholar
Allman, E.S., Matias, C., and Rhodes, J.A. 2009. Identifiability of parameters in latent structure models with many observed variables. Annals of Statistics, 37(6A), 3099–3132.Google Scholar
Allman, E.S., Matias, C., and Rhodes, J.A. 2011. Parameter identifiability in a class of random graph mixture models. Journal of Statistical Planning and Inference, 141(5), 1719–1736.CrossRefGoogle Scholar
Almquist, Z.W. 2012. Random errors in egocentric networks. Social Networks, 34(4), 493–505.Google Scholar
Ambroise, C., and Matias, C. 2012. New consistent and asymptotically normal parameter estimates for random-graph mixture models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 74(1), 3–35.Google Scholar
Amini, A.A., Chen, A., Bickel, P.J., and Levina, E. 2013. Pseudo-likelihood methods for community detection in large sparse networks. Annals of Statistics, 41(4), 2097–2122.Google Scholar
Aral, S. 2016. Networked experiments: A review of methods and innovations. In: Bramoulle, Y., Galeotti, A., and Rogers, B. (eds), The Oxford Handbook of the Economics of Networks. Oxford: Oxford University Press.Google Scholar
Aral, S., and Walker, D. 2011. Creating social contagion through viral product design: A randomized trial of peer influence in networks. Management Science, 57(9), 1623–1639.Google Scholar
Aronow, P.M., and Samii, C. 2013. Estimating average causal effects under interference between units. arXiv preprint arXiv:1305.6156.Google Scholar
Athey, S., Eckles, D., and Imbens, G.W. 2017. Exact p-values for network interference. Journal of the American Statistical Association (in press).Google Scholar
Austin, T. 2008. On exchangeable random variables and the statistics of large graphs and hypergraphs. Probability Surveys, 5(1), 80–145.Google Scholar
Aydin, B., Pataki, G., Wang, H., Bullitt, E., and Marron, J.S. 2009. A principal component analysis for trees. Annals of Applied Statistics, 3(4), 1597–1615.Google Scholar
Balachandran, P., Kolaczyk, E.D., and Viles, W.D. 2014. On the propagation of low-rate measurement error to subgraph counts in large networks. arXiv preprint arXiv:1409.5640.Google Scholar
Barden, D., Le, H., and Owen, M. 2013. Central limit theorems for Fréchet means in the space of phylogenetic trees. Electronic Journal of Probability, 18(25), 1–25.Google Scholar
Basse, G.W., and Airoldi, E.M. 2016. Optimal model-assisted design of experiments for network correlated outcomes suggests new notions of network balance. arXiv preprint arXiv:1507.00803.Google Scholar
Bickel, P.J., and Chen, A. 2009. A nonparametric view of network models and Newman–Girvan and other modularities. Proceedings of the National Academy of Sciences, 106(50), 21068–21073.Google Scholar
Bickel, P.J., and Sarkar, P. 2016. Hypothesis testing for automated community detection in networks. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 78(1), 253–273.Google Scholar
Bickel, P.J., Chen, A., and Levina, E. 2011. The method of moments and degree distributions for network models. Annals of Statistics, 39(5), 2280–2301.Google Scholar
Bickel, P.J., Choi, D.S., Chang, X., and Zhang, H. 2013. Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels. Annals of Statistics, 41(4), 1922–1943.Google Scholar
Biernacki, C., Celeux, G., and Govaert, G. 2000. Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(7), 719–725.Google Scholar
Billera, L.J., Holmes, S., and Vogtmann, K. 2001. Geometry of the space of phylogenetic trees. Advances in Applied Mathematics, 27(4), 733–767.Google Scholar
Biswal, B.B., Mennes, M., Zuo, X.-N., Gohel, S., Kelly, C., Smith, S.M., et al. 2010. Toward discovery science of human brain function. Proceedings of the National Academy of Sciences, 107(10), 4734–4739.Google Scholar
Bollobás, B. 1998. Modern Graph Theory. New York: Springer.CrossRefGoogle Scholar
Bollobás, B. 2001. Random Graphs, 2nd edn. New York: Cambridge University Press.Google Scholar
Bollobás, B., and Riordan, O. 2011. Sparse graphs: Metrics and random models. Random Structures & Algorithms, 39(1), 1–38.Google Scholar
Bollobás, B., Janson, S., and Riordan, O. 2007. The phase transition in inhomogeneous random graphs. Random Structures & Algorithms, 31(1), 3–122.CrossRefGoogle Scholar
Borgs, C., Chayes, J., Lovász, L., Sós, V.T., Szegedy, B., and Vesztergombi, K. 2006. Graph limits and parameter testing. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 261–270.Google Scholar
Borgs, C., Chayes, J.T., Lovász, L., Sós, V.T., and Vesztergombi, K. 2008. Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing. Advances in Mathematics, 219(6), 1801–1851.Google Scholar
Bramoullé, Y., Djebbari, H., and Fortin, B. 2009. Identification of peer effects through social networks. Journal of Econometrics, 150(1), 41–55.Google Scholar
Brandes, U., and Pich, C. 2007. Centrality estimation in large networks. International Journal of Bifurcation and Chaos, 17(7), 2303–2318.Google Scholar
Brault, V., and Mariadassou, M. 2015. Co-clustering through latent bloc model: A review. Journal de la Société Française de Statistique, 156(3), 120–139.Google Scholar
Bunge, J., and Fitzpatrick, M. 1993. Estimating the number of species: A review. Journal of the American Statistical Association, 88(421), 364–373.Google Scholar
Caron, F., and Fox, E.B. 2014. Sparse graphs using exchangeable random measures. arXiv preprint arXiv:1401.1137.Google Scholar
Celisse, A., Daudin, J.-J., and Pierre, L. 2012. Consistency of maximum-likelihood and variational estimators in the stochastic block model. Electronic Journal of Statistics, 6, 1847–1899.Google Scholar
Chan, S.H., and Airoldi, E.M. 2014. A consistent histogram estimator for exchangeable graph models. Proceedings of the 31st International Conference on Machine Learning, 208–216.Google Scholar
Chandrasekhar, A.G., and Jackson, M.O. 2014. Tractable and consistent random graph models. Technical Report of the National Bureau of Economic Research.Google Scholar
Chatterjee, S. 2015. Matrix estimation by universal singular value thresholding. Annals of Statistics, 43(1), 177–214.Google Scholar
Chatterjee, S., and Diaconis, P. 2013. Estimating and understanding exponential random graph models. Annals of Statistics, 41(5), 2428–2461.Google Scholar
Choi, D.S., Wolfe, P.J., and Airoldi, E.M. 2012. Stochastic blockmodels with a growing number of classes. Biometrika, 99(2), 273–284.CrossRefGoogle ScholarPubMed
Christakis, N.A., and Fowler, J.H. 2007. The spread of obesity in a large social network over 32 years. New England Journal of Medicine, 357(4), 370–379.CrossRefGoogle Scholar
Christakis, N.A., and Fowler, J.H. 2008. The collective dynamics of smoking in a large social network. New England Journal of Medicine, 358(21), 2249–2258.Google Scholar
Chung, F., and Lu, L. 2006. Complex Graphs and Networks. American Mathematical Society.CrossRefGoogle Scholar
Chung, F.R.K. 1997. Spectral Graph Theory. American Mathematical Society.Google Scholar
Clauset, A., and Moore, C. 2005. Accuracy and scaling phenomena in Internet mapping. Physical Review Letters, 94(1), 18701.Google Scholar
Clauset, A., Moore, C., and Newman, M.E.J. 2008. Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191), 98–101.Google Scholar
Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. 2003. Introduction to Algorithms. Cambridge, MA: MIT Press.Google Scholar
Cornea, E.l., Zhu, H., Kim, P., and Ibrahim, J.G. 2016. Regression models on Riemannian symmetric spaces. Journal of the Royal Statistical Society: Series B (Statistical Methodology) (in press).Google Scholar
Cox, D.R. 1958. Planning of Experiments. New York: Wiley.Google Scholar
Crane, H., and Dempsey, W. 2015. A framework for statistical network modeling. arXiv preprint arXiv:1509.08185.Google Scholar
Crane, H., and Dempsey, W. 2016. Edge exchangeable models for network data. arXiv preprint arXiv:1603.04571.Google Scholar
Daudin, J.-J., Picard, F., and Robin, S. 2008. A mixture model for random graphs. Statistics and Computing, 18(2), 173–183.Google Scholar
De Nooy, W., Mrvar, A., and Batagelj, V. 2011. Exploratory Social Network Analysis with Pajek, Vol. 27. Cambridge: Cambridge University Press.Google Scholar
Dempster, A.P., Laird, N.M., and Rubin, D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (Methodological), 39(1), 1–38.Google Scholar
Diaconis, P., and Janson, S. 2008. Graph limits and exchangeable random graphs. Rendiconti di Matematica, Serie VII, 28, 33–61.Google Scholar
Diestel, R. 2005. Graph Theory, 3rd edn. Heidelberg: Springer-Verlag.Google Scholar
Dodds, P.S., Muhamad, R., and Watts, D.J. 2003. An experimental study of search in global social networks. Science, 301(5634), 827–829.Google Scholar
DuBois, C., Butts, C.T., and Smyth, P. 2013. Stochastic blockmodeling of relational event dynamics. Proceedings of the 16th International Conference on Artificial Intelligence and Statistics (AISTATS).Google Scholar
Durante, D., Dunson, D.B., and Vogelstein, J.T. 2016. Nonparametric Bayes modeling of populations of networks. Journal of the American Statistical Association (in press).Google Scholar
Durrett, R. 2007. Random Graph Dynamics. Cambridge: Cambridge University Press.Google Scholar
Eckles, D., Karrer, B., and Ugander, J. 2014. Design and analysis of experiments in networks: Reducing bias from interference. arXiv preprint arXiv:1404.7530.Google Scholar
Eldar, Y.C. 2009. Generalized SURE for exponential families: Applications to regularization. IEEE Transactions on Signal Processing, 57(2), 471–481.CrossRefGoogle Scholar
Eppstein, D., and Wang, J. 2004. Fast approximation of centrality. Journal of Graph Algorithms and Applications, 8(1), 39–45.CrossRefGoogle Scholar
Erdös, P., and Rényi, A. 1959. On random graphs. Publicationes Mathematicae, 6(290), 290–297.Google Scholar
Erdös, P., and Rényi, A. 1960. On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17–61.Google Scholar
Erdös, P., and Rényi, A. 1961. On the strength of connectedness of a random graph. Acta Mathematica Hungarica, 12, 261–267.Google Scholar
Fienberg, S.E. 2012. A brief history of statistical models for network analysis and open challenges. Journal of Computational and Graphical Statistics, 21(4), 825–839.Google Scholar
Forastiere, L., Airoldi, E.M., and Mealli, F. 2016. Identification and estimation of treatment and interference effects in observational studies on networks. arXiv preprint arXiv:1609.06245.Google Scholar
Frank, O. 1977. Estimation of graph totals. Scandinavian Journal of Statistics, 4, 81–89.Google Scholar
Frank, O. 1978a. Estimation of the number of connected components in a graph by using a sampled subgraph. Scandinavian Journal of Statistics, 5, 177–188.Google Scholar
Frank, O. 1978b. Sampling and estimation in large social networks. Social Networks, 1(1), 91–101.Google Scholar
Frank, O. 1980. Estimation of the number of vertices of different degrees in a graph. Journal of Statistical Planning and Inference, 4(1), 45–50.Google Scholar
Frank, O. 1981. A survey of statistical methods for graph analysis. Sociological Methodology, 12, 110–155.Google Scholar
Frank, O. 2004. Network sampling and model fitting. In: Carrington, P.J., Scott, J., and Wasserman, S. (eds), Models and Methods in Social Network Analysis. New York: Cambridge University Press.Google Scholar
Frank, O., and Harary, F. 1982. Cluster inference by using transitivity indices in empirical graphs. Journal of the American Statistical Association, 77(380), 835–840.Google Scholar
Frank, O., and Strauss, D. 1986. Markov graphs. Journal of the American Statistical Association, 81(395), 832–842.Google Scholar
Frieze, A., and Kannan, R. 1999. Quick approximation to matrices and applications. Combinatorica, 19(2), 175–220.Google Scholar
Fu, W., Song, L., and Xing, E.P. 2009. Dynamic mixed membership blockmodel for evolving networks. Proceedings of the 26th International Conference on Machine Learning, 329–336.Google Scholar
Ganguly, A., and Kolaczyk, E.D. Estimation of vertex degrees in a sampled network. arXiv preprint arXiv:1701.07203.Google Scholar
Gao, C., Lu, Y., and Zhou, H.H. 2015. Rate-optimal graphon estimation. Annals of Statistics, 43(6), 2624–2652.Google Scholar
Gile, K.J. 2012. Improved inference for respondent-driven sampling data with application to HIV prevalence estimation. Journal of the American Statistical Association, 106, 135–146.Google Scholar
Gile, K.J., and Handcock, M.S. 2010. Respondent-driven sampling: An assessment of current methodology. Sociological Methodology, 40(1), 285–327.Google Scholar
Gile, K.J., and Handcock, M.S. 2015. Network model-assisted inference from respondent-driven sampling data. Journal of the Royal Statistical Society: Series A (Statistics in Society), 178(3), 619–639.Google Scholar
Ginestet, C.E., Li, J., Balanchandran, P., Rosenberg, S., and Kolaczyk, E.D. 2017. Hypothesis testing for network data in functional neuroimaging. Annals of Applied Statistics (accepted for publication).Google Scholar
Gjoka, M., Kurant, M., Butts, C.T., and Markopoulou, A. 2010. Walking in Facebook: A case study of unbiased sampling of OSNs. IEEE INFOCOM, 1–9.Google Scholar
Goel, S., and Salganik, M.J. 2010. Assessing respondent-driven sampling. Proceedings of the National Academy of Sciences, 107(15), 6743–6747.Google Scholar
Gowers, W.T. 1997. Lower bounds of tower type for Szemerédi’s uniformity lemma. Geometric & Functional Analysis, 7(2), 322–337.Google Scholar
Granovetter, M. 1976. Network sampling: Some first steps. American Journal of Sociology, 81(6), 1287–1303.Google Scholar
Gross, J.L., and Yellen, J. 1999. Graph Theory and Its Applications. Boca Raton, FL: Chapman & Hall/CRC.Google Scholar
Guare, J. 1990. Six Degrees of Separation: A Play. New York: Vintage.Google Scholar
Halloran, M.E., and Struchiner, C.J. 1995. Causal inference in infectious diseases. Epidemiology, 6(2), 142–151.Google Scholar
Han, J.D.J., Dupuy, D., Bertin, N., Cusick, M.E., and Vidal, M. 2005. Effect of sampling on topology predictions of protein–protein interaction networks. Nature Biotechnology, 23, 839–844.Google Scholar
Handcock, M.S. 2003. Assessing degeneracy in statistical models of social networks. Technical Report No. 39 of the Center for Statistics and the Social Sciences, University of Washington.Google Scholar
Handcock, M.S., and Gile, K.J. 2010. Modeling social networks from sampled data. Annals of Applied Statistics, 4(1), 5.Google Scholar
Hart, G.T., Ramani, A.K., and Marcotte, E.M. 2006. How complete are current yeast and human protein–interaction networks? Genome Biology, 7(11), 1.Google Scholar
Heckathorn, D.D. 1997. Respondent-driven sampling: A new approach to the study of hidden populations. Social Problems, 44(2), 174–199.Google Scholar
Heckathorn, D.D. 2002. Respondent-driven sampling II: Deriving valid population estimates from chain-referral samples of hidden populations. Social Problems, 49(1), 11–34.Google Scholar
Ho, Q., Parikh, A.P., and Xing, E.P. 2012. Multiscale community blockmodel for network exploration. Journal of the American Statistical Association, 107(499), 916–934.Google Scholar
Ho, Q., Yin, J., and Xing, E.P. 2016. Latent space inference of Internet-scale networks. Journal of Machine Learning Research, 17(78), 1–41.Google Scholar
Hoff, P.D. 2008. Modeling homophily and stochastic equivalence in symmetric relational data. Advances in Neural Information Processing Systems (NIPS).Google Scholar
Holland, P.W. 1986. Statistics and causal inference. Journal of the American Statistical Association, 81(396), 945–960.Google Scholar
Holland, P.W., Laskey, K.B., and Leinhardt, S. 1983. Stochastic blockmodels: First steps. Social Networks, 5(2), 109–137.Google Scholar
Hoover, D.N. 1979. Relations on probability spaces and arrays of random variables. Preprint, Institute for Advanced Study, Princeton, NJ.Google Scholar
Horvitz, D.G., and Thompson, D.J. 1952. A generalization of sampling without replacement from a finite universe. Journal of the American Statistical Association, 47(260), 663–685.Google Scholar
Hübler, C., Kriegel, H.-P., Borgwardt, K., and Ghahramani, Z. 2008. Metropolis algorithms for representative subgraph sampling. Proceedings of the 8th IEEE International Conference on Data Mining, 283–292.Google Scholar
Hudgens, M.G., and Halloran, M.E. 2012. Toward causal inference with interference. Journal of the American Statistical Association, 103(482), 832–842.Google Scholar
Imbens, G.W., and Rubin, D.B. 2015. Causal Inference in Statistics, Social, and Biomedical Sciences. Cambridge: Cambridge University Press.Google Scholar
Jackson, M.O. 2008. Social and Economic Networks. Princeton, NJ: Princeton University Press.Google Scholar
Jiang, Q., Zhang, Y., and Sun, M. 2009. Community detection on weighted networks: A variational Bayesian method. Proceedings of the Asian Conference on Machine Learning, 176–190.Google Scholar
Jiang, X., and Kolaczyk, E.D. 2012. A latent eigenprobit model with link uncertainty for prediction of protein–protein interactions. Statistics in Biosciences, 4(1), 84–104.Google Scholar
Jiang, X., Gold, D., and Kolaczyk, E.D. 2011. Network-based auto-probit modeling for protein function prediction. Biometrics, 67(3), 958–966.Google Scholar
Johnston, L.G., Hakim, A.J., Dittrich, S., Burnett, J., Kim, E., and White, R.G. 2016. A systematic review of published respondent-driven sampling surveys collecting behavioral and biologic data. AIDS and Behavior, 20(8), 1754–1776.CrossRefGoogle ScholarPubMed
Jordan, M.I., Ghahramani, Z., Jaakkola, T.S., and Saul, L.K. 1999. An introduction to variational methods for graphical models. Machine Learning, 37(2), 183–233.Google Scholar
Kallenberg, O. 1999. Multivariate sampling and the estimation problem for exchangeable arrays. Journal of Theoretical Probability, 12(3), 859–883.Google Scholar
Kallenberg, O. 2006. Probabilistic Symmetries and Invariance Principles. Berlin: Springer Science & Business Media.Google Scholar
Karrer, B., and Newman, M.E.J. 2011. Stochastic blockmodels and community structure in networks. Physical Review E, 83(1), 016107.Google Scholar
Keele, L. 2015. The statistics of causal inference: A view from political methodology. Political Analysis, 23(3), 313–335.Google Scholar
Killworth, P.D., McCarty, C., Bernard, H.R., Shelley, G.A., and Johnsen, E.C. 1998. Estimation of seroprevalence, rape, and homelessness in the United States using a social network approach. Evaluation Review, 22(2), 289–308.Google Scholar
Kohavi, R., and Longbotham, R. 2015. Online controlled experiments and A/B tests. In: Sammut, C., and Webb, G. (eds), Encyclopedia of Machine Learning and Data Mining. Berlin: Springer-Verlag.Google Scholar
Kolaczyk, E.D. 2009. Statistical Analysis of Network Data: Methods and Models. Berlin: Springer-Verlag.Google Scholar
Kolaczyk, E.D., and Csárdi, G. 2014. Statistical Analysis of Network Data with R. Berlin: Springer-Verlag.Google Scholar
Kolar, M., Liu, H., and Xing, E.P. 2014. Graph estimation from multi-attribute data. Journal of Machine Learning Research, 15(1), 1713–1750.Google Scholar
Koutsourelakis, P.-S., and Eliassi-Rad, T. 2008. Finding mixed-memberships in social networks. AAAI Spring Symposium: Social Information Processing, 48–53.Google Scholar
Krivitsky, P.N., and Kolaczyk, E.D. 2015. On the question of effective sample size in network modeling: An asymptotic inquiry. Statistical Science, 30(2), 184.Google Scholar
Lakhina, A., Byers, J.W., Crovella, M., and Xie, P. 2003. Sampling biases in IP topology measurements. IEEE INFOCOM, 332–341.Google Scholar
Lee, S.H., Kim, P.J., and Jeong, H. 2006. Statistical properties of sampled networks. Physical Review E, 73(1), 16102.Google Scholar
Lei, J. 2016. A goodness-of-fit test for stochastic block models. Annals of Statistics, 44(1), 401–424.Google Scholar
Leskovec, J., and Faloutsos, C. 2006. Sampling from large graphs. Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), 631–636.Google Scholar
Leung, M. 2016. Treatment and spillover effects under network interference. Available at: ssrn 2757313.Google Scholar
Li, X., and Rohe, K. 2015. Central limit theorems for network-driven sampling. arXiv preprint arXiv:1509.04704.Google Scholar
Lovász, L. 2012. Large Networks and Graph Limits, Vol. 60. American Mathematical Society.Google Scholar
Lovász, L., and Szegedy, B. 2006. Limits of dense graph sequences. Journal of Combinatorial Theory, Series B, 96(6), 933–957.Google Scholar
Lu, X., Bengtsson, L., Britton, T., Camitz, M., Kim, B.J., Thorson, A., and Liljeros, F. 2012. The sensitivity of respondent-driven sampling. Journal of the Royal Statistical Society: Series A (Statistics in Society), 175(1), 191–216.CrossRefGoogle Scholar
Lu, X., Malmros, J., Liljeros, F., and Britton, T. 2013. Respondent-driven sampling on directed networks. Electronic Journal of Statistics, 7, 292–322.Google Scholar
Lunagomez, S., and Airoldi, E.M. 2014. Valid inference from non-ignorable network sampling designs. arXiv preprint arXiv:1401.4718.Google Scholar
Lusher, D., Koskinen, J., and Robins, G.L. 2012. Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Cambridge: Cambridge University Press.Google Scholar
Lyons, R. 2011. The spread of evidence-poor medicine via flawed social-network analysis. Statistics, Politics, and Policy, 2(1).Google Scholar
Manski, C.F. 1993. Identification of endogenous social effects: The reflection problem. Review of Economic Studies, 60(3), 531–542.Google Scholar
Manski, C.F. 2013. Identification of treatment response with social interactions. Econometrics Journal, 16(1), S1–S23.Google Scholar
Mariadassou, M., Robin, S., and Vacher, C. 2010. Uncovering latent structure in valued graphs: A variational approach. Annals of Applied Statistics, 4(2), 715–742.Google Scholar
Matias, C., and Miele, V. 2017. Statistical clustering of temporal networks through a dynamic stochastic block model. Journal of the Royal Statistical Society: Series B (Statistical Methodology) (in press).Google Scholar
Matias, C., and Robin, S. 2014. Modeling heterogeneity in random graphs through latent space models: A selective review. ESAIM: Proceedings and Surveys, 47, 55–74.Google Scholar
McCormick, T.H., Salganik, M.J., and Zheng, T. 2010. How many people do you know? Efficiently estimating personal network size. Journal of the American Statistical Association, 105(489), 59–70.Google Scholar
Meinshausen, N., and Bühlmann, P. 2006. High-dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34(3), 1436–1462.Google Scholar
Michael, J.H. 1997. Labor dispute reconciliation in a forest products manufacturing facility. Forest Products Journal, 47(11/12), 41.Google Scholar
Milgram, S. 1967. The small world problem. Psychology Today, 2(1), 60–67.Google Scholar
Newman, M.E.J. 2010. Networks: An Introduction. Oxford: Oxford University Press.Google Scholar
Nowicki, K., and Snijders, T.A.B. 2001. Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96(455), 1077–1087.Google Scholar
Ogburn, E.L., and VanderWeele, T.J. 2014. Causal diagrams for interference. Statistical Science, 29(4), 559–578.Google Scholar
Olhede, S.C., and Wolfe, P.J. 2014. Network histograms and universality of blockmodel approximation. Proceedings of the National Academy of Sciences, 111(41), 14722–14727.Google Scholar
Orbanz, P., and Roy, D.M. 2015. Bayesian models of graphs, arrays and other exchangeable random structures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(2), 437–461.Google Scholar
Paluck, E.L. 2011. Peer pressure against prejudice: A high school field experiment examining social network change. Journal of Experimental Social Psychology, 47(2), 350–358.Google Scholar
Park, J., and Newman, M.E.J. 2004. Solution of the two-star model of a network. Physical Review E, 70(6), 066146.Google Scholar
Priebe, C.E., Sussman, D.L., Tang, M., and Vogelstein, J.T. 2015. Statistical inference on errorfully observed graphs. Journal of Computational and Graphical Statistics, 24(4), 930–953.Google Scholar
Ramani, S., Blu, T., and Unser, M. 2008. Monte-Carlo SURE: A black-box optimization of regularization parameters for general denoising algorithms. IEEE Transactions on Image Processing, 17(9), 1540–1554.Google Scholar
Robins, G.L., and Morris, M. 2007. Advances in exponential random graph (p*) models. Social Networks, 29(2), 169–172.Google Scholar
Robins, G.L., Pattison, P.E., Kalish, Y., and Lusher, D. 2007a. An introduction to exponential random graph (p*) models for social networks. Social Networks, 29(2), 173–191.Google Scholar
Robins, G.L., Snijders, T., Wang, P., Handcock, M., and Pattison, P.E. 2007b. Recent developments in exponential random graph (p*) models for social networks. Social Networks, 29(2), 192–215.Google Scholar
Rohe, K., Chatterjee, S., and Yu, B. 2011. Spectral clustering and the high-dimensional stochastic blockmodel. Annals of Statistics, 39(4), 1878–1915.Google Scholar
Ron, D. 2001. Property testing. Journal of Combinatorial Optimization, 9(2), 597–643.Google Scholar
Rosenbaum, P.R. 1999. Reduced sensitivity to hidden bias at upper quantiles in observational studies with dilated treatment effects. Biometrics, 5(2), 560–564.Google Scholar
Rosenbaum, P.R. 2007. Interference between units in randomized experiments. Journal of the American Statistical Association, 102(477), 191–200.Google Scholar
Ross, R. 1916. An application of the theory of probabilities to the study of a priori pathometry. Part I. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character, 92(638), 204–230.Google Scholar
Rubin, D.B. 1974. Estimating causal effects of treatments in randomized and nonrandomized studies. Journal of Educational Psychology, 66(5), 688.Google Scholar
Rubin, D.B. 1990. [On the Application of Probability Theory to Agricultural Experiments. Essay on Principles. Section 9.] Comment: Neyman (1923) and Causal Inference in Experiments and Observational Studies. Statistical Science, 5(4), 472–480.Google Scholar
Salganik, M.J., and Heckathorn, D.D. 2004. Sampling and estimation in hidden populations using respondent-driven sampling. Sociological Methodology, 34(1), 193–240.Google Scholar
Schweinberger, M. 2011. Instability, sensitivity, and degeneracy of discrete exponential families. Journal of the American Statistical Association, 106(496), 1361–1370.Google Scholar
Schweinberger, M., and Handcock, M.S. 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–676.Google Scholar
Shalizi, C.R., and Rinaldo, A. 2013. Consistency under sampling of exponential random graph models. Annals of Statistics, 41(2), 508–535.Google Scholar
Shalizi, C.R., and Thomas, A.C. 2011. Homophily and contagion are generically confounded in observational social network studies. Sociological Methods & Research, 40(2), 211–239.Google Scholar
Shuai, H.-H., Yang, D.-N., Shen, C.-Y., Philip, S.Y., and Chen, M.-S. 2015. QMSampler: Joint sampling of multiple networks with quality guarantee. arXiv preprint arXiv:1502.07439.Google Scholar
Snijders, T.A.B., and Nowicki, K. 1997. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification, 14(1), 75–100.Google Scholar
Sobel, M.E. 2006. What do randomized studies of housing mobility demonstrate? Causal inference in the face of interference. Journal of the American Statistical Association, 101(476), 1398–1407.Google Scholar
Söderberg, B. 2002. General formalism for inhomogeneous random graphs. Physical Review E, 66(6), 066121.Google Scholar
Söderberg, B. 2003a. Properties of random graphs with hidden color. Physical Review E, 68(2), 026107.Google Scholar
Söderberg, B. 2003b. Random graphs with hidden color. Physical Review E, 68(1), 015102.Google Scholar
Solomon, P., Cavanaugh, M.M., and Draine, J. 2009. Randomized Controlled Trials: Design and Implementation for Community-Based Psychosocial Interventions. Oxford: Oxford University Press.Google Scholar
Stanley, N., Shai, S., Taylor, D., and Mucha, P. 2015. Clustering network layers with the strata multilayer stochastic block model. IEEE Transactions on Network Science and Engineering, 3(2), 95–105.Google Scholar
Stanley, N., Shai, S., Taylor, D., and Mucha, P. 2016. Clustering network layers with the strata multilayer stochastic block model. IEEE Transactions on Network Science and Engineering, 3(2), 95–105.Google Scholar
Stumpf, M.P.H., and Wiuf, C. 2005. Sampling properties of random graphs: The degree distribution. Physical Review E, 72(3), 36118.Google Scholar
Stumpf, M.P.H., Wiuf, C., and May, R.M. 2005. Subnets of scale-free networks are not scale-free: Sampling properties of networks. Proceedings of the National Academy of Sciences, 102(12), 4221–4224.Google Scholar
Sussman, D.L., Tang, M., Fishkind, D.E., and Priebe, C.E. 2012. A consistent adjacency spectral embedding for stochastic blockmodel graphs. Journal of the American Statistical Association, 107(499), 1119–1128.Google Scholar
Sweet, T.M. 2015. Incorporating covariates into stochastic blockmodels. Journal of Educational and Behavioral Statistics, 40(6), 635–664.Google Scholar
Tallberg, C. 2004. A Bayesian approach to modeling stochastic blockstructures with covariates. Journal of Mathematical Sociology, 29(1), 1–23.Google Scholar
Tang, M., Sussman, D.L., and Priebe, C.E. 2013. Universally consistent vertex classification for latent positions graphs. Annals of Statistics, 41(3), 1406–1430.Google Scholar
Tang, R., Ketcha, M., Vogelstein, J.T., Priebe, C.E., and Sussman, D.L. 2016. Law of large graphs. arXiv preprint arXiv:1609.01672.Google Scholar
Tchetgen, E.J.T., and VanderWeele, T.J. 2012. On causal inference in the presence of interference. Statistical Methods in Medical Research, 21(1), 55–75.Google Scholar
Thompson, S.K. 2002. Sampling, 2nd edn. New York: Wiley.Google Scholar
Thompson, S.K., and Frank, O. 2000. Model-based estimation with link-tracing sampling designs. Survey Methodology, 26(1), 87–98.Google Scholar
Toulis, P., and Kao, E.K. 2013. Estimation of causal peer influence effects. Proceedings of the 30th International Conference on Machine Learning, 1489–1497.Google Scholar
Ugander, J., Karrer, B., Backstrom, L., and Kleinberg, J. 2013. Graph cluster randomization: Network exposure to multiple universes. Proceedings of the 19th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), 329–337.Google Scholar
Veitch, V., and Roy, D.M. 2015. The class of random graphs arising from exchangeable random measures. arXiv preprint arXiv:1512.03099.Google Scholar
Volz, E., and Heckathorn, D.D. 2008. Probability based estimation theory for respondent driven sampling. Journal of Official Statistics, 24(1), 79.Google Scholar
Vu, D.Q., Hunter, D.R., and Schweinberger, M. 2013. Model-based clustering of large networks. Annals of Applied Statistics, 7(2), 1010.Google Scholar
Wang, H., and Marron, J.S. 2007. Object oriented data analysis: Sets of trees. Annals of Statistics, 35(5), 1849–1873.Google Scholar
Wang, Y.J., and Wong, G.Y. 1987. Stochastic blockmodels for directed graphs. Journal of the American Statistical Association, 82(397), 8–19.Google Scholar
Wasserman, S., and Pattison, P.E. 1996. Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p*. Psychometrika, 61(3), 401–425.Google Scholar
Wolfe, P.J., and Olhede, S.C. 2013. Nonparametric graphon estimation. arXiv preprint arXiv:1309.5936.Google Scholar
Xu, K.S., and Hero, A.O. 2014. Dynamic stochastic blockmodels for time-evolving social networks. IEEE Journal of Selected Topics in Signal Processing, 8(4), 552–562.Google Scholar
Yang, J., and Leskovec, J. 2012. Defining and evaluating network communities based on ground-truth. Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics, 3.Google Scholar
Yang, J., Han, C., and Airoldi, E.M. 2014. Nonparametric estimation and testing of exchangeable graph models. AISTATS, 1060–1067.Google Scholar
Yang, T., Chi, Y., Zhu, S., Gong, Y., and Jin, R. 2011. Detecting communities and their evolutions in dynamic social networks – a Bayesian approach. Machine Learning, 82(2), 157–189.Google Scholar
Young, S.J., and Scheinerman, E.R. 2007. Random dot product graph models for social networks. International Workshop on Algorithms and Models for the Web-Graph, 138–149.Google Scholar
Zhang, C.-H. 2005. Estimation of sums of random variables: Examples and information bounds. Annals of Statistics, 33(5), 2022–2041.Google Scholar
Zhang, Y., Kolaczyk, E.D., and Spencer, B.D. 2015a. Estimating network degree distributions under sampling: An inverse problem, with applications to monitoring social media networks. Annals of Applied Statistics, 9(1), 166–199.Google Scholar
Zhang, Y., Levina, E., and Zhu, J. 2015b. Estimating network edge probabilities by neighborhood smoothing. arXiv preprint arXiv:1509.08588.Google Scholar
Zhao, Y., Levina, E., and Zhu, J. 2012. Consistency of community detection in networks under degree-corrected stochastic block models. Annals of Statistics, 40(4), 2266–2292.Google Scholar

Save element to Kindle

To save this element to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Topics at the Frontier of Statistics and Network Analysis
Available formats
×

Save element to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Topics at the Frontier of Statistics and Network Analysis
Available formats
×

Save element to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Topics at the Frontier of Statistics and Network Analysis
Available formats
×