{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:20Z","timestamp":1787337620524,"version":"build-2736575974"},"reference-count":55,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Appl. Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the quality of communication between nodes in the network. We study $25$ real-world networks and show that the proposed method correctly predicts $20\\%$ of triadic closures in these networks, in contrast to the $7.6\\%$ predicted by a random mechanism. We also show that the communication-driven method outperforms the random mechanism in explaining the clustering coefficient, average path length, and average communicability. The new method also displays some interesting features with regards to optimizing communication in networks.<\/jats:p>","DOI":"10.1137\/140996768","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T11:59:01Z","timestamp":1438862341000},"page":"1725-1744","source":"Crossref","is-referenced-by-count":13,"title":["Predicting Triadic Closure in Networks Using Communicability Distance Functions"],"prefix":"10.1137","volume":"75","author":[{"given":"Ernesto","family":"Estrada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesca","family":"Arrigo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,8,6]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022362401426"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.03.035"},{"key":"atypb4","unstructured":"F. Battiston, V. Nicosia, and V. Latora,\n                      Biased Random Walks on Multiplex Networks\n                      , preprint, arXiv:1505.01378, 2015."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.042806"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2014.07.001"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg340"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1038\/nature03239"},{"key":"atypb9","first-page":"19","author":"Carlson R. O.","year":"1965","journal-title":"OR"},{"key":"atypb10","unstructured":"J. S. Coleman, E. Katx, and H. Menzel,\n                      Medical Innovation. A Diffusion Study\n                      , Bobbs-Merrill Company, Indianapolis, IN, 1966."},{"key":"atypb11","unstructured":"E. Cozzo, M. Kivela\u0308, M. De Domenico, A. Sole\u0301, A. Arenas, S. Go\u0301mez, M. A. Porter, and Y. Moreno,\n                      Structure of Triadic Relations in Multiplex Networks\n                      , preprint, arXiv:1307.6780, 2013."},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2011.572452"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.042819"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.77.036111"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/090761070"},{"key":"atypb16","doi-asserted-by":"crossref","unstructured":"E. Estrada,\n                      The Structure of Complex Networks. Theory and Applications\n                      , Oxford University Press, Oxford, UK, 2011.","DOI":"10.1093\/acprof:oso\/9780199591756.001.0001"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.01.006"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.01.017"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.066122"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"G. H. Golub and G. Meurant,\n                      Matrices, Moments and Quadrature with Applications\n                      , Princeton University Press, Princeton, NJ, 2010.","DOI":"10.1515\/9781400833887"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"N. J. Higham,\n                      Functions of Matrices: Theory and Computation\n                      , SIAM, Philadelphia, 2008.","DOI":"10.1137\/1.9780898717778"},{"key":"atypb23","unstructured":"R. A. Horn and C. R. Johnson,\n                      Matrix Analysis\n                      , 2nd ed., Cambridge University Press, Cambridge, UK, 2013."},{"key":"atypb24","first-page":"499","author":"Huang H.","year":"2014","journal-title":"Switzerland"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.2307\/3546201"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/15\/6\/063008"},{"key":"atypb28","unstructured":"D. Knoke and R. S. Burt,\n                      Prominence\n                      , in Applied Network Analysis, Sage, Newbury Park, CA, 1983, pp. 195-222."},{"key":"atypb29","first-page":"183","volume":"16","author":"Krackhardt D.","year":"1999","journal-title":"Res. Sociol. Org."},{"key":"atypb30","first-page":"14","author":"Krackhardt D.","year":"2007","journal-title":"Berlin"},{"key":"atypb31","first-page":"462","author":"Leskovec J.","year":"2008","journal-title":"New York"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"T. Lou, J. Tiancheng, J. Hopcroft, Z. Fang, and X. Ding,\n                      Learning to predict reciprocity and triadic closure in social networks\n                      , ACM Trans. Knowledge Discovery from Data (TKDD), 7 (2013), 5.","DOI":"10.1145\/2499907.2499908"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.2307\/2785690"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.2307\/2937047"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1890\/0012-9658(1999)080[1044:EOSEOC]2.0.CO;2"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1046\/j.1365-2656.2000.00367.x"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1038\/nature750"},{"key":"atypb39","first-page":"25","volume":"47","author":"Michael J. H.","year":"1997","journal-title":"Forest Prod. J."},{"key":"atypb40","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem,\n                      Graph Spectra for Complex Networks\n                      , Cambridge University Press, Cambridge, UK, 2011.","DOI":"10.1017\/CBO9780511921681"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"atypb43","unstructured":"J. Moody,\n                      Data for this project were provided, in part, by NIH grants DA$12831$ and HD$41877$, and copies can be obtained from James Moody\n                      , \\burlmoody.77@sociology.osu.edu."},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"atypb45","unstructured":"M. E. J. Newman,\n                      Networks. An Introduction\n                      , Oxford University Press, Oxford, UK, 2010."},{"key":"atypb46","doi-asserted-by":"crossref","unstructured":"W. De Nooy, A. Mrvar, and V. Batagelj,\n                      Exploratory Social Network Analysis with Pajek\n                      , Cambridge University Press, Cambridge, UK, 2005.","DOI":"10.1017\/CBO9780511806452"},{"key":"atypb47","doi-asserted-by":"crossref","unstructured":"G. A. Polis and R. S. Donald,\n                      Food web complexity and community dynamics\n                      , Am. Nat. (1996), pp. 813-846.","DOI":"10.1086\/285880"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1136\/sti.78.suppl_1.i159"},{"key":"atypb49","unstructured":"Project Gutenberg,\n                      Roget's Thesaurus of English Words and Phrases\n                      , http:\/\/www.gutenberg.org\/etxt\/22, 2002."},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1038\/nature04209"},{"key":"atypb51","unstructured":"P. Sen and B. K. Chakrabarti,\n                      Sociophysics. An Introduction.\n                      , Oxford University Press, Oxford, UK, 2014."},{"key":"atypb52","unstructured":"G. Simmel,\n                      Conflict and the Web of Group Affiliations\n                      , Free Press, New York, 1922."},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"atypb54","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.1986.0056"},{"key":"atypb55","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.2307\/2785274"}],"container-title":["SIAM Journal on Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140996768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:21:01Z","timestamp":1787336461000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140996768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140996768"],"URL":"https:\/\/doi.org\/10.1137\/140996768","relation":{},"ISSN":["0036-1399","1095-712X"],"issn-type":[{"value":"0036-1399","type":"print"},{"value":"1095-712X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}