A Dynamic Process Reference Model for Sparse Networks with Reciprocity

12/31/2019
by   Carter T. Butts, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2018

A Dynamic Process Interpretation of the Sparse ERGM Reference Model

Exponential family random graph models (ERGMs) can be understood in term...
research
10/18/2021

Computing Semilinear Sparse Models for Approximately Eventually Periodic Signals

Some elements of the theory and algorithmics corresponding to the comput...
research
03/22/2016

Completely random measures for modeling power laws in sparse graphs

Network data appear in a number of applications, such as online social n...
research
12/11/2013

Sparse Allreduce: Efficient Scalable Communication for Power-Law Data

Many large datasets exhibit power-law statistics: The web graph, social ...
research
09/22/2020

Entropic Compressibility of Lévy Processes

In contrast to their seemingly simple and shared structure of independen...
research
04/13/2022

Grand canonical ensembles of sparse networks and Bayesian inference

Maximum entropy network ensembles have been very successful in modelling...

Please sign up or login with your details

Forgot password? Click here to reset