Dynamics of networking agents competing for high centrality and low degree.

@article{Holme2006DynamicsON,
  title={Dynamics of networking agents competing for high centrality and low degree.},
  author={Petter Holme and Gourab Ghoshal},
  journal={Physical review letters},
  year={2006},
  volume={96 9},
  pages={
          098701
        }
}
We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution, the success of the agents is related only to their position in the network. The agents use strategies based on local information to improve their chance of success. Both the evolution of strategies and network structure are investigated. We find a dramatic time… 

Figures and Tables from this paper

Game Theoretic Formation of a Centrality Based Network
TLDR
It is shown that using conditions necessary for the stability of star topologies the authors can induce the formation of hub players that positively impact the total welfare of the network.
Network evolution based on centrality.
TLDR
A discontinuous transition in the network density between hierarchical and homogeneous networks is found, depending on the rate of link decay, and this evolution mechanism leads to double power-law degree distributions, with interrelated exponents.
Network Evolution Based on Centrality
TLDR
A sharp transition between hierarchical and homogeneous networks is found, depending on the rate of link decay, and it is shown that this evolution mechanism may lead to double power-law degree distributions, with interrelated exponents.
The Diplomat’s Dilemma: Maximal Power for Minimal Effort in Social Networks
TLDR
This work investigates the situation in an adaptive network-evolution model where agents optimize their positions in the network following individual strategies, and using only local information, and describes the time evolution of the network and the agents’ strategies.
Coevolution of strategy and structure in complex networks with dynamical linking.
TLDR
This work provides analytic results for the limiting cases where linking dynamics is much faster than evolutionary dynamics and vice versa, and shows how the individual capacity of forming new links or severing inconvenient ones maps into the problem of strategy evolution in a well-mixed population under a different game.
On algebraic graph theory and the dynamics of innovation networks
TLDR
This paper analyzes the relation between the growth rate of the knowledge stock of the agents from R&D collaborations and the properties of the adjacency matrix associated with the network of collaborations.
Dynamic model of time-dependent complex networks.
  • S. Hill, D. Braha
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
TLDR
This work presents an approach to explain real-world dynamic networks and qualitatively reproduce these dynamic centrality phenomena, based on a dynamic preferential attachment mechanism, which exhibits a sharp transition from a base pure random walk scheme.
Graph topology and the evolution of cooperation
TLDR
The main motivation of this work is to examine the influence of the structure of the graph in maintaining cooperation, and found that the graph centrality is related to the ability of certain strategies to invade the population.
Dynamic and Topological Interplay in Adaptive Networks
TLDR
This chapter is devoted to adaptive networks which combine topological evolution of the network with dynamics in the network nodes – a property which yields a rich dynamical interplay between the state and the topology of thenetwork.
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Cooperation and the Emergence of Role Differentiation in the Dynamics of Social Networks1
By means of extensive computer simulations, the authors consider the entangled coevolution of actions and social structure in a new version of a spatial Prisoner’s Dilemma model that naturally gives
Cooperation, social networks, and the emergence of leadership in a prisoner's dilemma with adaptive local interactions.
TLDR
It is shown how the network adaptation dynamics favors the emergence of cooperators with the highest payoff, and these "leaders" are shown to sustain the global cooperative steady state.
Scale-free networks provide a unifying framework for the emergence of cooperation.
TLDR
It is found that, whenever individuals interact following networks of contacts generated via growth and preferential attachment, cooperation becomes the dominating trait throughout the entire range of parameters of both games, as such providing a unifying framework for the emergence of cooperation.
Dynamic instabilities induced by asymmetric influence: prisoners' dilemma game in small-world networks.
A two-dimensional small-world-type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node, with a finite density of directed random links
Modeling dynamics of information networks.
We propose an information-based model for network dynamics in which imperfect information leads to networks where the different vertices have widely different numbers of edges to other vertices, and
Coevolutionary games on networks.
TLDR
The transition from subcritical to critical avalanche dynamics can be traced to a change in the degeneracy of the cooperative macrostate and is observed for many variants of this game.
Spatial prisoner's dilemma game with volunteering in Newman-Watts small-world networks.
TLDR
In the case of very low temptation to defect, it is found that agents are willing to participate in the game in typical small-world region and intensive collective oscillations arise in more random region.
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Evolutionary prisoner's dilemma game on hierarchical lattices.
TLDR
An evolutionary prisoner's dilemma (PD) game is studied with players located on a hierarchical structure of layered square lattices to study how the measure of cooperation is affected by the number of hierarchical levels (Q) and by the temptation to defect.
Prisoners' dilemma in real-world acquaintance networks: spikes and quasiequilibria induced by the interplay between structure and dynamics.
TLDR
It is argued that the crucial structural ingredients causing the observed behavior is an inhomogeneous degree distribution and that the connections within vertices of highest degree are rather sparse.
...
...