Skip to main content
SpringerLink
Log in

Statistical Research in Networks: Looking Forward

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Social Network Analysis and Mining

  • 17 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Bickel PJ, Chen A (2009) A nonparametric view of network models and Newman–Girvan and other modularities. Proc Natl Acad Sci 106(50):21068

    Article  MATH  Google Scholar 

  • Brockwell PJ, Davis RA (2009) Time series: theory and methods. Springer, New Delhi

    MATH  Google Scholar 

  • Celisse A, Daudin JJ, Pierre L (2011) Consistency of maximum-likelihood and variational estimators in the stochastic block model. Arxiv preprint arXiv: 1105.3288

    Google Scholar 

  • Chatterjee S, Diaconis P (2011) Estimating and understanding exponential random graph models. Arxiv preprint arXiv: 1102.2650

    Google Scholar 

  • Chatterjee S, Diaconis P, Sly A (2011) Random graphs with a given degree sequence. Ann Appl Probab 21(4):1400–1435

    Article  MathSciNet  MATH  Google Scholar 

  • Choi DS, Wolfe PJ, Airoldi EM (2010) Stochastic blockmodels with growing number of classes. Arxiv preprint arXiv: 1011.4644

    Google Scholar 

  • Cohen E, Duffield N, Lund C, Thorup M (2008) Confident estimation for multistage measurement sampling and aggregation. ACM SIGMETRICS Per Eval Rev 36:109–120

    Article  Google Scholar 

  • Cressie NAC (1993) Statistics for spatial data, revised edn. Wiley, New York

    MATH  Google Scholar 

  • Ding Q, Katenka N, Barford P, Kolaczyk ED, Crovella M (2012) Intrusion as (anti)social communication: Characterization and detection. In: Proceedings of the 18th ACM SIGKDD conference on knowledge discovery and data mining. ACM, Beijing, pp 886–894

    Google Scholar 

  • Duffield N (2004) Sampling for passive internet measurement: a review. Stat Sci 19(3):472–498

    Article  MathSciNet  MATH  Google Scholar 

  • Duffield N, Lund C, Thorup M (2005a) Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans Netw 13(5):933–946

    Article  Google Scholar 

  • Duffield N, Lund C, Thorup M (2005b) Optimal combination of sampled network measurements. In: Proceedings of the 5th ACM SIGCOMM conference on internet measurement. USENIX Association, Berkeleye, pp 8–8

    Google Scholar 

  • Frank O (2004) Network sampling and model fitting. In: Carrington PJ, Scott J, Wasserman S (eds) Models and methods in social network analysis. Cambridge University Press, New York

    Google Scholar 

  • Haberman SJ (1981) An exponential family of probability distributions for directed graphs: comment. J Am Stat Assoc 76(373):60–61

    Google Scholar 

  • Handcock MS, Gile KJ (2010) Modeling social networks from sampled data. Ann Appl Stat 4(1):5–25

    Article  MathSciNet  MATH  Google Scholar 

  • Holland PW, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76:33–50

    Article  MathSciNet  MATH  Google Scholar 

  • Iliofotou M, Pappu P, Faloutsos M, Mitzenmacher M, Singh S, Varghese G (2007) Network monitoring using traffic dispersion graphs (tdgs). In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement. ACM, San Diego, pp 315–320

    Google Scholar 

  • Iliofotou M, Faloutsos M, Mitzenmacher M (2009) Exploiting dynamicity in graph-based traffic analysis: techniques and applications. In: Proceedings of the 5th international conference on emerging networking experiments and technologies. ACM, Rome, pp 241–252

    Google Scholar 

  • Jiang X, Kolaczyk ED (2012) A latent eigenprobit model with link uncertainty for prediction of protein–protein interactions. Stat Biosci 4(1):84–104

    Article  Google Scholar 

  • Jiang N, Cao J, Jin Y, Li LE, Zhang ZL (2010) Identifying suspicious activities through DNS failure graph analysis. In: 18th IEEE international conference on network protocols (ICNP) 2010. IEEE, Kyoto, pp 144–153

    Google Scholar 

  • Jin Y, Sharafuddin E, Zhang ZL (2009) Unveiling core network-wide communication patterns through application traffic activity graph decomposition. In: Proceedings of the 11th international joint conference on measurement and modeling of computer systems. ACM, Seattle, pp 49–60

    Google Scholar 

  • Kolaczyk ED (2009) Statistical analysis of network data: methods and models. Springer, New York/London

    Book  MATH  Google Scholar 

  • Kolaczyk ED, Krivitsky PN (2013) On the question of effective sample size in network modeling. Stat Sci (under invited revision)

    Google Scholar 

  • Luscher D, Koskinens J, Robins G (2012) Exponential random graph models for social networks: Theory, methods, and applications. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Rinaldo A, Petrovic S, Fienberg SE (2013) Maximum likelihood estimation in the beta model. Ann Stat (to appear)

    Google Scholar 

  • Robins G, Snijders T, Wang P, Handcock M, Pattison P (2007) Recent developments in exponential random graph (p*) models for social networks. Soc Networks 29(2):192–215

    Article  Google Scholar 

  • Rohe K, Chatterjee S, Yu B (2011) Spectral clustering and the high-dimensional stochastic blockmodel. Ann Stat 39(4):1878–1915

    Article  MathSciNet  MATH  Google Scholar 

  • Viles WE (2013) Uncertainty propagation from network inference to network characterization. Ph.D. thesis, Department of Mathematics & Statistics, Boston University

    Google Scholar 

  • Wiuf C, Brameier M, Hagberg O, Stumpf MPH (2006) A likelihood approach to analysis of network data. Proc Natl Acad Sci 103(20):7566–7570

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Boston University, 111 Cummington Street, Boston, MA, USA

    Eric D. Kolaczyk

Authors
  1. Eric D. Kolaczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eric D. Kolaczyk .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Reda Alhajj

  2. Department of Computer Science, University of Calgary, Calgary, AB, Canada

    Jon Rokne

Section Editor information

  1. Yahoo Inc, London, UK

    Fabrizio Silvestri

  2. University of Calabria, Via Pietro Bucci, 42C, 87036, Arcavacata di Rende, Italy

    Andrea Tagarelli

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Kolaczyk, E.D. (2018). Statistical Research in Networks: Looking Forward. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-7131-2_41

Download citation

Publish with us

Policies and ethics

Search

Navigation