A dynamic process reference model for sparse networks with reciprocity
From MaRDI portal
Publication:5070518
DOI10.1080/0022250X.2020.1795652zbMATH Open1484.91339arXiv1912.13144OpenAlexW3044597064MaRDI QIDQ5070518FDOQ5070518
Authors: Carter T. Butts
Publication date: 13 April 2022
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Abstract: Many social and other networks exhibit stable size scaling relationships, such that features such as mean degree or reciprocation rates change slowly or are approximately constant as the number of vertices increases. Statistical network models built on top of simple Bernoulli baseline (or reference) measures often behave unrealistically in this respect, leading to the development of sparse reference models that preserve features such as mean degree scaling. In this paper, we generalize recent work on the micro-foundations of such reference models to the case of sparse directed graphs with non-vanishing reciprocity, providing a dynamic process interpretation of the emergence of stable macroscopic behavior.
Full work available at URL: https://arxiv.org/abs/1912.13144
Recommendations
- A dynamic process interpretation of the sparse ERGM reference model
- Reciprocity in directed networks
- Measuring reciprocity in a directed preferential attachment network
- Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
- Emergence of Scaling in Random Networks
social networksreciprocitydynamic processesreference measuresexponential family random graph modelscontact formation process
Cites Work
- A flexible parameterization for baseline mean degree in multiple-network ERGMs
- Adjusting for network size and composition effects in exponential-family random graph models
- Markov Graphs
- On the question of effective sample size in network modeling: an asymptotic inquiry
- Papers on probability, statistics and statistical physics. Ed. by R. D. Rosenkrantz
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- A novel simulation method for binary discrete exponential families, with application to social networks
- A perfect sampling method for exponential family random graph models
- A dynamic process interpretation of the sparse ERGM reference model
Cited In (1)
This page was built for publication: A dynamic process reference model for sparse networks with reciprocity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070518)