Glossary
- Asymptotically Almost Surely (a.a.s.):
-
The limit ℙ(E n ) → 1 as n → ∞, where {E n } denotes a sequence of events defined on a random structure (e.g., a random graph) that depends on n
- Event:
-
A subset of the sample space
- \( \mathbb{G}\left( n, p\right) \) :
-
The probability space of simple random graphs that contain n vertices and for which each of the \( \left(\begin{array}{c}\hfill n\hfill \\ {}\hfill 2\hfill \end{array}\right) \) edges occurs with probability p ∈ [0, 1]
- Independent and Identically Distributed (i.i.d):
-
The hypothesis that some given random variables are mutually independent, and each is described by the same probability mass function
- Probability Mass Function (p.m.f.):
-
A function that assigns a probability to the event that a random variable assumes a given value, e.g., p X (x) = ℙ({ω ∈ Ω : X(ω) = x})
- Probability Measure:
-
(ℙ) A function that assigns a probability...
References
Barrat A, Barthélemy M, Vespignani A (2008) Dynamical processes on complex networks. Cambridge University Press, Cambridge
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
Bollobás B (1985) Random graphs. Academic Press, London
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
Durrett R (2007) Random graph dynamics. Cambridge University Press, Cambridge
Erdős P, Rényi A (1959) On random graphs i. Publ Math Debr 6:290–297
Erdős P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17–61
Feller W (1968) An introduction to probability theory and its applications, vol I, 3rd edn. Wiley, New York
Gilbert EN (1959) Random graphs. Ann Math Stat 30:1141–1144
Grimmett G, Stirzaker D (2001) Probability and random processes, 3rd edn. Oxford University Press, Oxford
Harris TE (1989) The theory of branching processes. Dover, Mineola
Janson S, Łuczak T, Ruciński A (2000) Rańdom graphs. Wiley, New York
Kolmogorov AN (1956) Foundations of probability, 2nd edn. Chelsea, New York
Lewin K (1997) Resolving social conflicts and field theory in social science. American Psychological Association, Washington, DC
Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithm 6(2–3):161–180
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
Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford
Vega-Redondo F (2007) Complex social networks. Cambridge University Press, Cambridge
Venkatesh SS (2013) The theory of probability. Cambridge University Press, Cambridge
Wilf HS (2006) Generatingfunctionology, 3rd edn. A K Peters, Wellesley
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media LLC
About this entry
Cite this entry
Snapp, R.R. (2017). 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-7163-9_155-1
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7163-9_155-1
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7163-9
Online ISBN: 978-1-4614-7163-9
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering