Link-centric preferential attachment

In mathematical modeling of social networks, link-centric preferential attachment[1][2] is a node's propensity to re-establish links to nodes it has previously been in contact with in time-varying networks.[3] This preferential attachment model relies on nodes keeping memory of previous neighbors up to the current time.[1][4]

Background

In real social networks individuals exhibit a tendency to re-connect with past contacts (ex. family, friends, co-workers, etc.) rather than strangers. In 1970, Mark Granovetter examined this behaviour in the social networks of a group of workers and identified tie strength, a characteristic of social ties describing the frequency of contact between two individuals. From this comes the idea of strong and weak ties,[5] where an individual's strong ties are those she has come into frequent contact with. Link-centric preferential attachment aims to explain the mechanism behind strong and weak ties as a stochastic reinforcement process for old ties in agent-based modeling where nodes have long-term memory.

Examples

In a simple model for this mechanism, a node's propensity to establish a new link can be characterized solely by , the number of contacts it has had in the past. The probability for a node with n social ties to establish a new social tie could then be simply given by[4]

where c is an offset constant. The probability for a node to re-connect with old ties is then

Figure 1. shows an example of this process: in the first step nodes A and C connect to node B, giving B a total of two social ties. With c = 1, in the next step B has a probability P(2) = 1/(2 + 1) = 1/3 to create a new tie with D, whereas the probability to reconnect with A or C is twice that at 2/3.

More complex models may take into account other variables, such as frequency of contact, contact and intercontact duration, as well as short term memory effects.[1]

Effects on the spreading of contagions / weakness of strong ties

Understanding the evolution of a network's structure and how it can influence dynamical processes has become an important part of modeling the spreading of contagions.[6][7] In models of social and biological contagion spreading on time-varying networks link-centric preferential attachment can alter the spread of the contagion to the entire population. Compared to the classic rumour spreading process where nodes are memory-less, link-centric preferential attachment can cause not only a slower spread of the contagion but also one less diffuse. In these models an infected node's chances of connecting to new contacts diminishes as their size of their social circle grows leading to a limiting effect on the growth of n. The result is strong ties with a node's early contacts and consequently the weakening of the diffusion of the contagion.[1][4]

gollark: I tried with a prompt:> My opinion on apioforms is ~~not real~~<|endoftext|>I think bees have been mostly created.<|endoftext|>Who doesn't save their money? Just buy bees?<|endoftext|>The apioformic database is actually NOT to be tolerated.<|endoftext|>I'll make macron and macron on bees.<|endoftext|>I think this is a separate token for some reason. I'll have to make macron and macron on osmarks.tk.<|endoftext|>I can't really, I don't really like this.<|endoftext|>I'll make macron and then make macron and macron.<|endoftext|>Anyway, I think I should probably make an apioformic database somehow.<|endoftext|>Nim is for wimps.<|endoftext|>I can't tell, however LyricLy is on my phone.<|endoftext|>I don't like this thus no.<|endoftext|><@!2930660666066606666606688> are inescapable cryoapiaristic beeoids.<
gollark: Anyway, I don't have the compute available to do this sort of thing *regularly*.
gollark: That's probably too slow.
gollark: (newlines are because I am copypasting it out of a terminal)
gollark: Further output:> that would be a bit cheaty, but I suppose it could be done.<|endoftext|>I don't know exactly what it was going to involve, but I'm pretty sure it'd be a bit cheaty anyway.<|endoftext|>And there's probably a guide to do that, but I don't know exactly what I'm doing about that is doing it.<|endoftext|>I can't actually read the summary, though.<|endoftext|>No, it's on the roadmap though.<|endoftext|>The next update:> your code is binding and has some bits which aren't signed into my account.<|endoftext|>Not really. It's not going to be hard to make a userscript for it.<|endoftext|>You could also do that.<|endoftext|>It's not a forum thing here.<|endoftext|>The guide's up to the ones below the GDPR, which is neat.<|endoftext|>I'm working on a link-type guide to the actual forum, or something.<|endoftext|>They can't really do much testing, though, though, so you could

See also

References
  1. Vestergaard, Christian L.; Genois, Mathieu; Barrat, Alain (October 9, 2014). "How memory generates hetergeneous dynamics in temporal networks". Physical Review E. 90 (4): 042805. arXiv:1409.1805. Bibcode:2014PhRvE..90d2805V. doi:10.1103/PhysRevE.90.042805. PMID 25375547.
  2. Barabasi, Albert-Laszlo; Albert, Reka (October 15, 1999). "Emergence of Scaling in Random Networks". Science. 286 (5439): 509–512. arXiv:cond-mat/9910332. Bibcode:1999Sci...286..509B. doi:10.1126/science.286.5439.509. PMID 10521342.
  3. Perra, Nicola; Goncalves, Bruno; Pastor-Satorras, Romualdo; Vespignani, Alessandro (June 25, 2012). "Activity driven modeling of time-varying networks". Scientific Reports. 2: 469. arXiv:1203.5351. Bibcode:2012NatSR...2E.469P. doi:10.1038/srep00469. PMC 3384079. PMID 22741058.
  4. Karsai, Marton (February 10, 2014). "Time-varying networks and the weakness of strong ties". Scientific Reports. 4: 4001. arXiv:1303.5966. Bibcode:2014NatSR...4E4001K. doi:10.1038/srep04001. PMC 3918922. PMID 24510159. Retrieved 11 November 2014.
  5. Granovetter, Mark (1973). "The strength of weak ties". American Journal of Sociology. 78 (6): 1360–1380. doi:10.1086/225469.
  6. Newman, M. E. J. (July 26, 2002). "Spread of epidemic disease on networks". Physical Review E. 66 (16128): 016128. arXiv:cond-mat/0205009. Bibcode:2002PhRvE..66a6128N. doi:10.1103/PhysRevE.66.016128.
  7. Kamp, Christel; Moslonka-Lefebvre, Mathieu; Alizon, Samuel (December 13, 2013). "Epidemic Spread on Weighted Networks". PLOS Computational Biology. 9 (1371): e1003352. Bibcode:2013PLSCB...9E3352K. doi:10.1371/journal.pcbi.1003352.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.