
- freely available
- re-usable
Algorithms 2012, 5(4), 629-635; doi:10.3390/a5040629
Article
Testing Goodness of Fit of Random Graph Models
1
Department of Probability Theory and Statistics, Eötvös Loránd University, Budapest, 1053, Hungary
2
Alfréd Rényi Mathematical Institute of the Hungarian Academy of Sciences, Budapest, 1053, Hungary
3
Department of Mathematics, Rutgers University, New Brunswick, NJ 08901, USA
4
Statistics Program, University of Delaware, Newark, DE 19716, USA
* Author to whom correspondence should be addressed.
Received: 7 May 2012; in revised form: 8 November 2012 / Accepted: 30 November 2012 / Published: 6 December 2012

The original version is still available [136 KB, uploaded 6 December 2012 08:45 CET]
Abstract: Random graphs are matrices with independent 0–1 elements with probabilities determined by a small number of parameters. One of the oldest models is the Rasch model where the odds are ratios of positive numbers scaling the rows and columns. Later Persi Diaconis with his coworkers rediscovered the model for symmetric matrices and called the model beta. Here we give goodness-of-fit tests for the model and extend the model to a version of the block model introduced by Holland, Laskey and Leinhard.
Keywords: random graph; maximum likelihood; rank entropy
Article Statistics
Click here to load and display the download statistics.Cite This Article
MDPI and ACS Style
Csiszár, V.; Hussami, P.; Komlós, J.; Móri, T.F.; Rejtõ, L.; Tusnády, G. Testing Goodness of Fit of Random Graph Models . Algorithms 2012, 5, 629-635.
AMA StyleCsiszár V, Hussami P, Komlós J, Móri TF, Rejtõ L, Tusnády G. Testing Goodness of Fit of Random Graph Models . Algorithms. 2012; 5(4):629-635.
Chicago/Turabian StyleCsiszár, Villõ; Hussami, Péter; Komlós, János; Móri, Tamás F.; Rejtõ, Lídia; Tusnády, Gábor. 2012. "Testing Goodness of Fit of Random Graph Models ." Algorithms 5, no. 4: 629-635.
Algorithms
EISSN 1999-4893
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert