System of mobile agents to model social networks.

@article{Gonzlez2006SystemOM,
  title={System of mobile agents to model social networks.},
  author={Marta C. Gonz{\'a}lez and Pedro G. Lind and Hans J. Herrmann},
  journal={Physical review letters},
  year={2006},
  volume={96 8},
  pages={
          088702
        }
}
We propose a model of mobile agents to construct social networks, based on a system of moving particles by keeping track of the collisions during their permanence in the system. We reproduce not only the degree distribution, clustering coefficient, and shortest path length of a large database of empirical friendship networks recently collected, but also some features related with their community structure. The model is completely characterized by the collision rate, and above a critical… 

Figures and Tables from this paper

A NEW DYNAMIC COMMUNITY MODEL FOR SOCIAL NETWORKS
TLDR
It is discovered that the networks generated by the proposed model possess the small-world property and can well reproduce the networks of social contacts.
Contact networks of mobile agents and spreading dynamics
TLDR
This research focuses on the development of appropriate models ofappropriate models of spreading dynamics, such as diffusion models of opinion formation and spreading of infections, that differ from the traditional static graph modeling that is at the core of classical graph theory.
New approaches to model and study social networks
TLDR
A quantity, the spread factor, is introduced, which measures the average maximal fraction of nearest neighbours which get in contact with the gossip, and finds the striking result that there is an optimal non-trivial number of friends for which thespread factor is minimized, decreasing the danger of being gossiped about.
A framework of multilayer social networks for communication behavior with agent-based modeling
TLDR
The simulation results show high correlation between social networks and the transmission of influenza, and demonstrate that individual-based social network models can well reproduce and analyze complex interacting behavior.
Gaussian Networks Generated by Random Walks
TLDR
This work defines a random walker that plays the role of “edges-generator”, and finds that some properties of achieved Gaussian networks, as the clustering coefficient and the assortativity, show a critical behavior.
Social Dilemmas and Cooperation in Complex Networks
TLDR
The investigation of cooperation in some classical evolutionary games on populations where the network of interactions among individuals is of the scale-free type is extended and it is shown that the update rule, the payoff computation and the timing of the operations have a marked influence on the transient dynamics and the amount of cooperation that can be established at equilibrium.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Models of social networks based on social distance attachment.
TLDR
Analytical results are derived, showing that the proposed class of models of social network formation reproduces the main statistical characteristics of real social networks: large clustering coefficient, positive degree correlations, and the emergence of a hierarchy of communities.
The Structure and Function of Complex Networks
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Emergence of a small world from local interactions: modeling acquaintance networks.
TLDR
Here, it is demonstrated that this assumption is sufficient to reproduce major nontrivial features of social networks: short path length, high clustering, and scale-free or exponential link distributions.
Scale-free networks from varying vertex intrinsic fitness.
TLDR
A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).
Identity and Search in Social Networks
TLDR
A model is presented that offers an explanation of social network searchability in terms of recognizable personal identities: sets of characteristics measured along a number of social dimensions that may be applicable to many network search problems.
Classes of small-world networks.
TLDR
Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented.
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Uncovering the overlapping community structure of complex networks in nature and society
TLDR
After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks.
Risk network structure in the early epidemic phase of HIV transmission in Colorado Springs
TLDR
It is suggested that a combined dendritic and cyclic structural network pattern is associated with low to moderate HIV propagation in Colorado Springs, and may account for the absence of intense propagation of the virus.
The web of human sexual contacts
Promiscuous individuals are the vulnerable nodes to target in safe-sex campaigns.
...
1
2
3
4
...