A scalable, synergy-first backbone decomposition of higher-order structures in complex systems

Thomas F. Varley
{"title":"A scalable, synergy-first backbone decomposition of higher-order structures in complex systems","authors":"Thomas F. Varley","doi":"arxiv-2402.08135","DOIUrl":null,"url":null,"abstract":"Since its introduction in 2011, the partial information decomposition (PID)\nhas triggered an explosion of interest in the field of multivariate information\ntheory and the study of emergent, higher-order (\"synergistic\") interactions in\ncomplex systems. Despite its power, however, the PID has a number of\nlimitations that restrict its general applicability: it scales poorly with\nsystem size and the standard approach to decomposition hinges on a definition\nof \"redundancy\", leaving synergy only vaguely defined as \"that information not\nredundant.\" Other heuristic measures, such as the O-information, have been\nintroduced, although these measures typically only provided a summary statistic\nof redundancy/synergy dominance, rather than direct insight into the synergy\nitself. To address this issue, we present an alternative decomposition that is\nsynergy-first, scales much more gracefully than the PID, and has a\nstraightforward interpretation. Our approach defines synergy as that\ninformation in a set that would be lost following the minimally invasive\nperturbation on any single element. By generalizing this idea to sets of\nelements, we construct a totally ordered \"backbone\" of partial synergy atoms\nthat sweeps systems scales. Our approach starts with entropy, but can be\ngeneralized to the Kullback-Leibler divergence, and by extension, to the total\ncorrelation and the single-target mutual information. Finally, we show that\nthis approach can be used to decompose higher-order interactions beyond just\ninformation theory: we demonstrate this by showing how synergistic combinations\nof pairwise edges in a complex network supports signal communicability and\nglobal integration. We conclude by discussing how this perspective on\nsynergistic structure (information-based or otherwise) can deepen our\nunderstanding of part-whole relationships in complex systems.","PeriodicalId":501323,"journal":{"name":"arXiv - STAT - Other Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Other Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.08135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Since its introduction in 2011, the partial information decomposition (PID) has triggered an explosion of interest in the field of multivariate information theory and the study of emergent, higher-order ("synergistic") interactions in complex systems. Despite its power, however, the PID has a number of limitations that restrict its general applicability: it scales poorly with system size and the standard approach to decomposition hinges on a definition of "redundancy", leaving synergy only vaguely defined as "that information not redundant." Other heuristic measures, such as the O-information, have been introduced, although these measures typically only provided a summary statistic of redundancy/synergy dominance, rather than direct insight into the synergy itself. To address this issue, we present an alternative decomposition that is synergy-first, scales much more gracefully than the PID, and has a straightforward interpretation. Our approach defines synergy as that information in a set that would be lost following the minimally invasive perturbation on any single element. By generalizing this idea to sets of elements, we construct a totally ordered "backbone" of partial synergy atoms that sweeps systems scales. Our approach starts with entropy, but can be generalized to the Kullback-Leibler divergence, and by extension, to the total correlation and the single-target mutual information. Finally, we show that this approach can be used to decompose higher-order interactions beyond just information theory: we demonstrate this by showing how synergistic combinations of pairwise edges in a complex network supports signal communicability and global integration. We conclude by discussing how this perspective on synergistic structure (information-based or otherwise) can deepen our understanding of part-whole relationships in complex systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对复杂系统中的高阶结构进行可扩展、协同效应优先的骨干分解
部分信息分解(PID)自 2011 年问世以来,在多元信息理论领域以及对复杂系统中出现的高阶("协同")相互作用的研究中引发了极大的兴趣。然而,尽管 PID 功能强大,但它也有许多局限性,限制了它的普遍适用性:随着系统规模的扩大,它的扩展性很差,而且标准的分解方法依赖于 "冗余 "的定义,协同作用只能模糊地定义为 "不冗余的信息"。其他启发式测量方法,如 O-信息,也已被引入,不过这些方法通常只能提供冗余/协同优势的汇总统计,而不能直接洞察协同本身。为了解决这个问题,我们提出了另一种分解方法,它以协同作用为先,比 PID 更容易扩展,并且具有直接的解释。我们的方法将协同作用定义为集合中的信息,这些信息在对任何单一元素进行最小侵入性扰动后都会丢失。通过将这一概念推广到元素集合,我们构建了一个完全有序的部分协同原子 "骨干",它可以横扫系统尺度。我们的方法从熵开始,但可以推广到库尔贝克-莱伯勒发散,进而推广到总相关性和单目标互信息。最后,我们展示了这种方法可用于分解信息论之外的高阶交互作用:我们通过展示复杂网络中成对边缘的协同组合如何支持信号可传播性和全球整合来证明这一点。最后,我们将讨论这种关于协同结构(基于信息或其他)的观点如何加深我们对复杂系统中部分-整体关系的理解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Censored Data Forecasting: Applying Tobit Exponential Smoothing with Time Aggregation How to survive the Squid Games using probability theory Cross-sectional personal network analysis of adult smoking in rural areas Modeling information spread across networks with communities using a multitype branching process framework Asymptotic confidence intervals for the difference and the ratio of the weighted kappa coefficients of two diagnostic tests subject to a paired design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1