Constructing Socially-Inspired Networks Using the Static Edge Voting Model

Static Edge Voting Model is a random graph model that implements a streamlined approach to graph construction. Within this framework, a finite set of nodes constitutes the network, where each node establishes connections by “voting” for potential edges, influenced by their unique states. The probability of forming a connection between two distinct nodes depends on the aggregate votes. This study demonstrates how this model can be employed to generate networks that exhibit the key attributes of socially constructed networks. These networks have a giant component, are small-worlds, have a fat-tailed degree distribution, exhibit high clustering coefficients and assortative. The model’s parameters are intuitively interpretable, allowing for the manipulation of different network properties to quantify their impact on various processes.