{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/simplicial-closure-and-higher-order-link","title":"Simplicial Closure and higher-order link prediction","arxiv_id":"1802.06916","date":"2018-02-20","proceeding":null,"authors":["Austin R. Benson","Rediet Abebe","Michael T. Schaub","Ali Jadbabaie","Jon Kleinberg"],"abstract":"Networks provide a powerful formalism for modeling complex systems by using a\nmodel of pairwise interactions. But much of the structure within these systems\ninvolves interactions that take place among more than two nodes at once; for\nexample, communication within a group rather than person-to person,\ncollaboration among a team rather than a pair of coauthors, or biological\ninteraction between a set of molecules rather than just two. Such higher-order\ninteractions are ubiquitous, but their empirical study has received limited\nattention, and little is known about possible organizational principles of such\nstructures. Here we study the temporal evolution of 19 datasets with explicit\naccounting for higher-order interactions. We show that there is a rich variety\nof structure in our datasets but datasets from the same system types have\nconsistent patterns of higher-order structure. Furthermore, we find that tie\nstrength and edge density are competing positive indicators of higher-order\norganization, and these trends are consistent across interactions involving\ndiffering numbers of nodes. To systematically further the study of theories for\nsuch higher-order structures, we propose higher-order link prediction as a\nbenchmark problem to assess models and algorithms that predict higher-order\nstructure. We find a fundamental differences from traditional pairwise link\nprediction, with a greater role for local rather than long-range information in\npredicting the appearance of new interactions.","url_abs":"http://arxiv.org/abs/1802.06916v2","url_pdf":"http://arxiv.org/pdf/1802.06916v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"simplicial-closure-and-higher-order-link","repo_url":"https://github.com/arbenson/ScHoLP-Tutorial","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"simplicial-closure-and-higher-order-link","repo_url":"https://github.com/ZerixU/CSNS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1802.06916","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}