𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks

✍ Scribed by Wang, Jing; Atchadé, Yves F.

Book ID
121362592
Publisher
Taylor and Francis Group
Year
2013
Tongue
English
Weight
425 KB
Volume
43
Category
Article
ISSN
0361-0918

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Closure, connectivity and degree distrib
Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks
✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph

Missing data in networks: exponential ra
Missing data in networks: exponential random graph (p∗) models for networks with non-respondents
✍ Garry Robins; Philippa Pattison; Jodie Woolcock 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Survey studies of complete social networks often involve non-respondents, whereby certain people within the "boundary" of a network do not complete a sociometric questionnaire-either by their own choice or by the design of the study-yet are still nominated by other respondents as network partners. W