Advertisement

The socio-network model with an agent-based approach

  • Kousuke Shinoda
  • Yutaka Matsuo
  • Hideyuki Nakashima
Conference paper
Part of the Springer Series on Agent Based Social Systems book series (ABSS, volume 3)

Abstract

In this paper, we propose a novel approach to explain the emergence of different network structures through multi-agent network simulation. Each agent as node of network has rationality and new edge to be added are chosen based on mutual common consent of all agents. The agents’ rationality is to raise own position in network. That is, it is to increase its own centrality, and it votes so that its centrality is maximized. Depending on the types of centrality measures, different types of network structures are obtained. This model of growing network explains emergence of a network where many agents participate in creating it: It includes a social network where each autonomy tries to be more central, and traffic network where each region tries to be more accessible.

Keywords

Network Topology Degree Distribution Degree Centrality Betweenness Centrality Preferential Attachment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sen, P., Dasgupta, S., Chatterjee, A., Sreeram, P.A., Mukherjee, G., Manna, S.S.: Small-world properties of the indian railway network. Physical Review E (2003) 036106Google Scholar
  2. 2.
    Buckwalter, D.W.: Complex topology in the highway network of hungary, 1990 and 1998. Journal of Transport Geography (2001) 125–135Google Scholar
  3. 3.
    Gabora, S., Csabai, I.: The analogies of highway and computer network traffic.Physica A 307 (2002)516–526CrossRefGoogle Scholar
  4. 4.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45 (2003) 167–256MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science (1999) 509–512Google Scholar
  6. 6.
    de Solla Price, D.J.: Networks of scientific papers. Science 149 (1965) 510–515CrossRefGoogle Scholar
  7. 7.
    Freeman, L.C.: Centrality in social networks: Conceptual clarification. Social Networks 1 (1979) 215–239CrossRefGoogle Scholar
  8. 8.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30 (1998) 107–117CrossRefGoogle Scholar
  9. 9.
    Haveliwala, T.H.: Efficient computation of pagerank. Stanford Technical Report (1999)Google Scholar
  10. 10.
    Wikipedia: Borda count. http://en.wikipedia.org/wiki/Borda_count (2005)Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Kousuke Shinoda
    • 1
  • Yutaka Matsuo
    • 2
  • Hideyuki Nakashima
    • 3
  1. 1.National Defence AcademyKanagawaJapan
  2. 2.National Institute of Science and TechnologyTokyoJapan
  3. 3.Future University-HakodateHokkaidoJapan

Personalised recommendations