返回
A simulated annealing algorithm for randomizing weighted networks
DOI:10.1038/s43588-024-00735-z.png)
摘要
En 中文
Scientific discovery in connectomics relies on network null models. The prominence of network features is conventionally evaluated against null distributions estimated using randomized networks. Modern imaging technologies provide an increasingly rich array of biologically meaningful edge weights. Despite the prevalence of weighted graph analysis in connectomics, randomization models that only preserve binary node degree remain most widely used. Here we propose a simulated annealing procedure for generating randomized networks that preserve weighted degree (strength) sequences. We show that the procedure outperforms other rewiring algorithms and generalizes to multiple network formats, including directed and signed networks, as well as diverse real-world networks. Throughout, we use morphospace representation to assess the sampling behavior of the algorithm and the variability of the resulting ensemble. Finally, we show that accurate strength preservation yields different inferences about brain network organization. Collectively, this work provides a simple but powerful method to analyze richly detailed next-generation connectomics datasets.
Keyword:
RICH-CLUB ORGANIZATION
HUMAN CONNECTOME
SMALL-WORLD
AXON DIAMETER
WIRING COST
CONNECTIVITY
ARCHITECTURE
OPTIMIZATION
SPECIFICITY
PROJECTIONS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
Randomized placebo- and active-controlled study of desvenlafaxine for menopausal vasomotor symptoms
Climacteric
IF0
High-Throughput Mapping of Single-Neuron Projections by Sequencing of Barcoded RNA通过条形码RNA的测序对单神经元投影进行高通量映射
NEURON
IF15

