How Variability in Individual Patterns of Behavior Changes the Structural Properties of Networks
Dynamic processes in complex networks have received much attention. This attention reflects the fact that dynamic processes are the main source of changes in the structural properties of complex networks (e.g., clustering coefficient and average shortest-path length). In this paper, we develop an agent-based model to capture, compare, and explain the structural changes within a growing social network with respect to individuals’ social characteristics (e.g., their activities for expanding social relations beyond their social circles). According to our simulation results, the probability increases that the network’s average shortest-path length is between 3 and 4, if most of the dynamic processes are based on random link formations. That means, in Facebook, the existing average shortest path length of 4.7 can even shrink to smaller values. Another result is that, if the node increase is larger than the link increase when the network is formed, the probability increases that the average shortest-path length is between 4 and 8.
|Date of creation:||Jun 2014|
|Date of revision:||Jun 2014|
|Publication status:||Published in International Conference on Active Media Technology at Web Intelligence Congress (WIC 2014).|
|Contact details of provider:|| Postal: 599 Gwanak-Ro, Gwanak-Gu, Seoul 151-744|
Web page: http://temep.snu.ac.kr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Somayeh Koohborfardhaghighi & Jorn Altmann, 2014. "How Placing Limitations on the Size of Personal Networks Changes the Structural Properties of Complex Networks," TEMEP Discussion Papers 2014110, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Jan 2014.
- Jackson, Matthew O. & Wolinsky, Asher, 1996.
"A Strategic Model of Social and Economic Networks,"
Journal of Economic Theory,
Elsevier, vol. 71(1), pages 44-74, October.
- Matthew O. Jackson & Asher Wolinsky, 1994. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Andrea Galeotti & Sanjeev Goyal & Matthew O. Jackson & Fernando Vega-Redondo & Leeat Yariv, 2010. "Network Games," Review of Economic Studies, Oxford University Press, vol. 77(1), pages 218-244.
- Andrea Galeotti & Sanjeev Goyal & Matthew O. Jackson & Fernando Vega-Redondo & Leeat Yariv, 2008. "Network Games," Economics Working Papers ECO2008/07, European University Institute.
- Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
- Somayeh Koohborfardhaghighi & Jorn Altmann, 2014. "How Structural Changes in Complex Networks Impact Organizational Learning Performance," TEMEP Discussion Papers 2014111, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Mar 2014. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:2014114. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jorn Altmann)
If references are entirely missing, you can add them using this form.