Algorithms 2012, 5(4), 629-635; doi:10.3390/a5040629

Testing Goodness of Fit of Random Graph Models

1email, 2email, 3email, 1email, 2,4,* email and 2email
Received: 7 May 2012; in revised form: 8 November 2012 / Accepted: 30 November 2012 / Published: 6 December 2012
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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
PDF Full-text Download PDF Full-Text [136 KB, Updated Version, uploaded 6 December 2012 15:01 CET]
The original version is still available [136 KB, uploaded 6 December 2012 08:45 CET]

Export to BibTeX |

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 Style

Csiszá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 Style

Csiszá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