Proximity in the Brain

Zalán Heszberger, A. Gulyás, András Majdán, András Bíró, László Balázs, Szabolcs Mezei, J. Bíró
{"title":"Proximity in the Brain","authors":"Zalán Heszberger, A. Gulyás, András Majdán, András Bíró, László Balázs, Szabolcs Mezei, J. Bíró","doi":"10.1109/CSCI51800.2020.00256","DOIUrl":null,"url":null,"abstract":"The structural navigability of complex networks is an important question in the function-structure perspective of complex network analysis. This may provide hints on the underlying mechanisms that have been forming the structure of networks for a desirable level of navigation. It has been already discovered that greedy navigational cores as minimalistic networks with 100% greedy navigability considerably present in many real networks, including the structural networks of the human brain. Because the greedy navigational core is not unique, the connection between the level of its presence in a network and the structural navigability of that network is far from clear. In this paper, we deal with a special subset of the greedy navigational core, the so-called greedy proximity links (GPL), whose presence is necessary for 100% greedy navigability of a network. We show that the greedy proximity links are highly present in the brain networks, and the presence is consistent throughout the the individual subjects.","PeriodicalId":336929,"journal":{"name":"2020 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Computational Science and Computational Intelligence (CSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCI51800.2020.00256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The structural navigability of complex networks is an important question in the function-structure perspective of complex network analysis. This may provide hints on the underlying mechanisms that have been forming the structure of networks for a desirable level of navigation. It has been already discovered that greedy navigational cores as minimalistic networks with 100% greedy navigability considerably present in many real networks, including the structural networks of the human brain. Because the greedy navigational core is not unique, the connection between the level of its presence in a network and the structural navigability of that network is far from clear. In this paper, we deal with a special subset of the greedy navigational core, the so-called greedy proximity links (GPL), whose presence is necessary for 100% greedy navigability of a network. We show that the greedy proximity links are highly present in the brain networks, and the presence is consistent throughout the the individual subjects.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大脑中的接近性
复杂网络的结构可通航性是复杂网络功能-结构分析中的一个重要问题。这可能会为我们提供一些线索,让我们了解形成网络结构的潜在机制,从而达到理想的导航水平。人们已经发现,贪婪导航核心作为具有100%贪婪可通航性的极简网络,在许多真实网络中相当普遍,包括人类大脑的结构网络。因为贪婪的导航核心并不是唯一的,所以它在网络中的存在程度与该网络的结构可通航性之间的联系远不清楚。在本文中,我们处理贪婪导航核心的一个特殊子集,即所谓的贪婪邻近链路(GPL),它的存在对于网络的100%贪婪导航性是必要的。我们发现贪婪邻近链接在大脑网络中高度存在,并且在个体受试者中存在一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
First Success of Cancer Gene Data Analysis of 169 Microarrays for Medical Diagnosis Artificial Intelligence in Computerized Adaptive Testing Evidence for Monitoring the User and Computing the User’s trust Transfer of Hierarchical Reinforcement Learning Structures for Robotic Manipulation Tasks An open-source application built with R programming language for clinical laboratories to innovate process of excellence and overcome the uncertain outlook during the global healthcare crisis
×
引用
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