Socioeconomic Networks with Long-Range Interactions

Abstract

We study a modified version of a model previously proposed by Jackson and Wolinsky to account for communicating information and allocating goods in socioeconomic networks. In the model, the utility function of each node is given by a weighted sum of contributions from all accessible nodes. The weights, parameterized by the variable $\delta$, decrease with distance. We introduce a growth mechanism where new nodes attach to the existing network preferentially by utility. By increasing $\delta$, the network structure evolves from a power-law to an exponential degree distribution, passing through a regime characterised by shorter average path length, lower degree assortativity and higher central point dominance. In the second part of the paper we compare different network structures in terms of the average utility received by each node. We show that power-law networks provide higher average utility than Poisson random networks. This provides a possible justification for the ubiquitousness of scale-free networks in the real world.

11 pages, 8 figures, minor corrections

References in corpus (15)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Assortative mixing in networks
• Random graphs with arbitrary degree distributions and their applications
• Evolution of networks
• Mixing patterns in networks
• Network robustness and fragility: Percolation on random graphs
• Universal Behavior of Load Distribution in Scale-free Networks
• Betweenness Centrality in Large Complex Networks
• Threshold effects for two pathogens spreading on a network
• A fitness model for the Italian Interbank Money Market
• Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-Free Networks
• Phenomenological Models of Socio-Economic Network Dynamics
• The agents' preferences and the topology of networks

Cited by in corpus (5)

• A dynamical programming approach for controlling the directed abelian Dhar-Ramaswamy model
• Long-range connections and mixed diffusion in fractional networks
• Long-range connections, real-world networks and rates of diffusion
• Fractional networks, the new structure
• Pairing for Generation of Synthetic Populations: the Direct Probabilistic Pairing method