Skip to main content

Probabilistic Analysis

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

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,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

  • Barrat A, Barthélemy M, Vespignani A (2008) Dynamical processes on complex networks. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Bearman PS, Moody J, Stovel K (2004) Chains of affection: the structure of adolescent romantic and sexual networks. Am J Sociol 110(1):44–91

    Google Scholar 

  • Bollobás B (1985) Random graphs. Academic Press, London

    MATH  Google Scholar 

  • Chernoff H (1952) A measure of asymptotic efficiency for test of a hypothesis base on a sum of observations. Ann Math Stat 23:493–507

    MATH  MathSciNet  Google Scholar 

  • Durrett R (2007) Random graph dynamics. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Erdős P, Rényi A (1959) On random graphs i. Publ Math Debr 6:290–297

    Google Scholar 

  • Erdős P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17–61

    Google Scholar 

  • Feller W (1968) An introduction to probability theory and its applications, vol I, 3rd edn. Wiley, New York

    MATH  Google Scholar 

  • Gilbert EN (1959) Random graphs. Ann Math Stat 30:1141–1144

    MATH  Google Scholar 

  • Grimmett G, Stirzaker D (2001) Probability and random processes, 3rd edn. Oxford University Press, Oxford

    Google Scholar 

  • Harris TE (1989) The theory of branching processes. Dover, Mineola, New York

    Google Scholar 

  • Janson S, Łuczak T, Ruciński A (2000) Rańdom graphs. Wiley, New York

    MATH  Google Scholar 

  • Kolmogorov AN (1956) Foundations of probability, 2nd edn. Chelsea, New York

    MATH  Google Scholar 

  • Lewin K (1997) Resolving social conflicts and field theory in social science. American Psychological Association, Washington, DC

    Google Scholar 

  • Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2–3):161–180

    MATH  MathSciNet  Google Scholar 

  • Molloy M, Reed B (1998) The size of the giant component of a random graph with a given degree sequence. Comb Probab Comput 7(3):295–305

    MATH  MathSciNet  Google Scholar 

  • Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford

    Google Scholar 

  • Vega-Redondo F (2007) Complex social networks. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Venkatesh SS (2013) The theory of probability. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  • Wilf HS (2006) generatingfunctionology, 3rd edn. A K Peters, Wellesley

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Snapp, R.R. (2014). Probabilistic Analysis. In: Alhajj, R., Rokne, J. (eds) Encyclopedia of Social Network Analysis and Mining. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6170-8_155

Download citation

Publish with us

Policies and ethics