A comparative power analysis of the maximum degree and size invariants for random graph inference

Journal of Statistical Planning and Inference

Volumn 141, Issue 2, 2011, Pages 1041-1046

  Rukhin, Andrey ^a   Priebe, Carey E ^b  

^a NAVAL SURFACE WARFARE CENTER   (United States)

^b Johns Hopkins University   (United States)

Author keywords

Comparative power analysis; Erdos Renyi random graphs; Statistical inference

Indexed keywords

EID: 77956871507     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jspi.2010.09.013     Document Type: Article

References (5)

1. Bollobás B. Random Graphs 2001, Cambridge University Press.
2. Chung K.L. A Course in Probability Theory 1974, Academic Press, New York.
3. Nowicki K., Snijders T.A.B. Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association 2001, 96(455):1077.
4. Rukhin, A., 2009. Asymptotic analysis of various statistics for random graph inference. Ph.D. Dissertation, The Johns Hopkins University, Department of Applied Mathematics and Statistics, May.
5. Wasserman S., Anderson C. Stochastic a posteriori blockmodels: construction and assessment. Social Networks 1987, (9):1-36.