testing goodness of fit of random graph models测试随机图模型的拟合优度.pdfVIP

Algorithms 2012, 5, 629-635; doi:10.3390/a5040629 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Testing Goodness of Fit of Random Graph Models ˝ ´ ´ ´ ´ ´ ´ ´ ˝ Villo Csiszar , Peter Hussami , Janos Komlos , Tamas F. Mori , Lıdia Rejto * and ´ ´ Gabor Tusnady ¨ ¨ ´ Department of Probability Theory and Statistics, Eotvos Lorand University, Budapest 1053, Hungary; E-Mails: villo@ludens.elte.hu (V.C.); moritamas@ludens.elte.hu (T.F.M.) ´ ´ Alfred Renyi Mathematical Institute of the Hungarian Academy of Sciences, Budapest 1053, Hungary; E-Mails: haprim@ (P.H.); tusnady.gabor@renyi.mta.hu (G.T.) Department of Mathematics, Rutgers University, New Brunswick, NJ 08901, USA; E-Mail:komlos@ (J.K.) Statistics Program, University of Delaware, Newark, DE 19716, USA * Author to whom correspondence should be addressed; E-Mail: rejto@; Tel.: +1-302-831-8034; Fax: +1-302-831-6243. Received: 7 May 2012; in revised form: 8 November 2012 / Accepted: 30 November 2012 / Published: 6 December 2012 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