Temporal Exponential Random Graph Models with btergm: Estimation and Bootstrap Confidence Intervals
نویسندگان
چکیده
منابع مشابه
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...
متن کاملOn Teaching Bootstrap Confidence Intervals
notion the theoretical distribution on the random variable ) is not available. All we have ICOTS8 (2010) Invited Paper Engel International Association of Statistical Education (IASE) www.stat.auckland.ac.nz/~iase/ to rely on are the data at hand, i.e. the sample or recapture of size n. These data–if drawn by some random mechanism–may well be taken as a good representation of the total fish popu...
متن کاملEstimating Temporal Exponential Random Graph Models by Bootstrapped Pseudolikelihood
This package vignette is designed as a hands-on tutorial for estimating temporal exponential random graph models (TERGMs) (Desmarais and Cranmer 2010, 2012b; Hanneke et al. 2010) and assessing goodness of fit and predictive performance (Cranmer and Desmarais 2011; Leifeld and Cranmer 2014) using the xergm package (Leifeld et al. 2014) for the statistical computing environment R (R Core Team 201...
متن کاملMarkov Chain Monte Carlo Estimation of Exponential Random Graph Models
This paper is about estimating the parameters of the exponential random graph model, also known as the p∗ model, using frequentist Markov chain Monte Carlo (MCMC) methods. The exponential random graph model is simulated using Gibbs or MetropolisHastings sampling. The estimation procedures considered are based on the Robbins-Monro algorithm for approximating a solution to the likelihood equation...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Software
سال: 2018
ISSN: 1548-7660
DOI: 10.18637/jss.v083.i06