Talk:Triadic closure

15-396 Science of the Web: afernand —Preceding unsigned comment added by Odysseyguy (talk • contribs) 12:35, 12 November 2008 (UTC) I am the first person to add to the talk page. I think this article should mention the following:

1. Anatol Rapoport's contribution to social networks using triadic closure during the 1950s

2. Modeling static graphs as continuous time Markov chains where triadic closure is one of many assumptions for transitions

3. Proving that if strong triadic closure holds, then any local bridge must be a weak tie

4. Proving that triadic closure generates graphs with high clustering coefficients

5. Note the difference between random graphs and generating graphs using triadic closure

I am currently working on these topics so I would appreciate it if you could contribute more ideas.

OdysseyGuy is 24.131.17.45 —Preceding unsigned comment added by Odysseyguy (talk • contribs) 12:34, 12 November 2008 (UTC) 24.131.17.45 (talk) 21:06, 11 November 2008 (UTC)

External links modified (January 2018)
Hello fellow Wikipedians,

I have just modified one external link on Triadic closure. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20080216103216/http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf to http://www.stanford.edu/dept/soc/people/mgranovetter/documents/granstrengthweakties.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 04:11, 26 January 2018 (UTC)