Assessing Goodness of Fit of Exponential Random Graph Models
نویسندگان
چکیده
منابع مشابه
Testing Goodness of Fit of Random Graph Models
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 m...
متن کاملExponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملAssessing the goodness-of-fit of hidden Markov models.
In this article, we propose a graphical technique for assessing the goodness-of-fit of a stationary hidden Markov model (HMM). We show that plots of the estimated distribution against the empirical distribution detect lack of fit with high probability for large sample sizes. By considering plots of the univariate and multidimensional distributions, we are able to examine the fit of both the ass...
متن کاملGoodness of Fit Tests in Random Coefficient Regression Models]
Random coefficient regressions have been applied in a wide range of fields, from biology to economics, and constitute a common frame for several important statistical models. A nonparametric approach to inference in random coefficient models was initiated by Beran and Hall. In this paper we introduce and study goodness of fit tests for the coefficient distributions; their asymptotic behaviour u...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Statistics and Probability
سال: 2013
ISSN: 1927-7040,1927-7032
DOI: 10.5539/ijsp.v2n4p64