A cognitive-inspired algorithm for growing networks

We present models for generating different classes of networks by adopting simple local strategies and an original model of the evolutionary dynamics and growth of on-line social networks. The model emulates people’s strategies for acquiring information in social networks, emphasising the local subjective view of an individual and what kind of information the individual can acquire when arriving in a new social context. We assume that the strategy proceeds through two phases: (a) a discovery phase, in which the individual becomes aware of the surrounding world and (b) an elaboration phase, in which the individual elaborates locally the information trough a cognitive-inspired algorithm. Model generated networks reproduce the main features of both theoretical and real-world networks, such as high clustering coefficient, low characteristic path length, strong division in communities, and variability of degree distributions.

[1]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Gerd Gigerenzer,et al.  Heuristic decision making. , 2011, Annual review of psychology.

[3]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[9]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[10]  S. Strogatz Exploring complex networks , 2001, Nature.

[11]  Franco Bagnoli,et al.  Hierarchical community structure in complex (social) networks , 2014, ArXiv.

[12]  K. Forster,et al.  REPETITION PRIMING AND FREQUENCY ATTENUATION IN LEXICAL ACCESS , 1984 .

[13]  S. Wasserman,et al.  Social Network Analysis: Computer Programs , 1994 .

[14]  Hilary Risser Social Networks Analysis , 2013 .

[15]  Béla Bollobás,et al.  Random Graphs , 1985 .

[16]  Pietro Liò,et al.  Information dynamics algorithm for detecting communities in networks , 2011, ArXiv.

[17]  D. Koenig Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[18]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[19]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[20]  Franco Bagnoli,et al.  Community-detection cellular automata with local and long-range connectivity , 2012, ACRI.

[21]  V. Latora,et al.  Impact of network structure on a model of diffusion and competitive interaction , 2011 .

[22]  Daniel L. Schacter,et al.  Priming effects in word-fragment completion are independent of recognition memory. , 1982 .