调控布尔网络中的最大协调原则

IF 1.1 3区 计算机科学 Q1 BUSINESS, FINANCE
Alexis Poindron
{"title":"调控布尔网络中的最大协调原则","authors":"Alexis Poindron","doi":"10.1016/j.jcss.2024.103518","DOIUrl":null,"url":null,"abstract":"<div><p>We introduce a coordination index in regulatory Boolean networks and we expose the maximal coordination principle (MCP), according to which a cohesive society reaches the dynamics characterized by the highest coordination index. Based on simple theoretical examples, we show that the MCP can be used to infer the influence graph from opinion dynamics/gene expressions. We provide some algorithms to apply the MCP and we compare the coordination index with existing statistical indexes (likelihood, entropy). The advantage of the coordination approach is its simplicity; in particular, we do not need to impose restrictions on the aggregation functions.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"142 ","pages":"Article 103518"},"PeriodicalIF":1.1000,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The maximal coordination principle in regulatory Boolean networks\",\"authors\":\"Alexis Poindron\",\"doi\":\"10.1016/j.jcss.2024.103518\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We introduce a coordination index in regulatory Boolean networks and we expose the maximal coordination principle (MCP), according to which a cohesive society reaches the dynamics characterized by the highest coordination index. Based on simple theoretical examples, we show that the MCP can be used to infer the influence graph from opinion dynamics/gene expressions. We provide some algorithms to apply the MCP and we compare the coordination index with existing statistical indexes (likelihood, entropy). The advantage of the coordination approach is its simplicity; in particular, we do not need to impose restrictions on the aggregation functions.</p></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"142 \",\"pages\":\"Article 103518\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2024-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000138\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024000138","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0

摘要

我们在调控布尔网络中引入了协调指数,并揭示了最大协调原则(MCP),根据该原则,一个有凝聚力的社会可以达到以最高协调指数为特征的动态。基于简单的理论示例,我们表明 MCP 可用于从舆论动态/基因表达推断影响图。我们提供了一些应用 MCP 的算法,并将协调指数与现有的统计指数(似然比、熵)进行了比较。协调方法的优势在于其简单性,尤其是我们无需对聚合函数施加限制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The maximal coordination principle in regulatory Boolean networks

We introduce a coordination index in regulatory Boolean networks and we expose the maximal coordination principle (MCP), according to which a cohesive society reaches the dynamics characterized by the highest coordination index. Based on simple theoretical examples, we show that the MCP can be used to infer the influence graph from opinion dynamics/gene expressions. We provide some algorithms to apply the MCP and we compare the coordination index with existing statistical indexes (likelihood, entropy). The advantage of the coordination approach is its simplicity; in particular, we do not need to impose restrictions on the aggregation functions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computer and System Sciences
Journal of Computer and System Sciences 工程技术-计算机:理论方法
CiteScore
3.70
自引率
0.00%
发文量
58
审稿时长
68 days
期刊介绍: The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信