中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Controllability and maximum matchings of complex networks

文献类型:期刊论文

作者Zhao, JH; Zhou, HJ
刊名PHYSICAL REVIEW E
出版日期2019
卷号99期号:1页码:12317
关键词RANDOM GRAPHS DYNAMICS
ISSN号2470-0045
DOI10.1103/PhysRevE.99.012317
英文摘要Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on random bipartite graphs were calculated analytically with the cavity method at zero temperature limit. Here we present an alternative theory to estimate MM sizes based on the core percolation theory and the perfect matching of cores. Our theory is much more simplified and easily interpreted, and can estimate MM sizes on random graphs with or without symmetry between out- and in-degree distributions. Our result helps to illuminate the fundamental connection between the controllability problem and the underlying structure of complex systems.
学科主题Physics
语种英语
源URL[http://ir.itp.ac.cn/handle/311006/23507]  
专题理论物理研究所_理论物理所1978-2010年知识产出
作者单位1.[Zhao, Jin-Hua
2.Chinese Acad Sci, Inst Theoret Phys, CAS Key Lab Theoret Phys, Beijing 100190, Peoples R China
3.Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China
推荐引用方式
GB/T 7714
Zhao, JH,Zhou, HJ. Controllability and maximum matchings of complex networks[J]. PHYSICAL REVIEW E,2019,99(1):12317.
APA Zhao, JH,&Zhou, HJ.(2019).Controllability and maximum matchings of complex networks.PHYSICAL REVIEW E,99(1),12317.
MLA Zhao, JH,et al."Controllability and maximum matchings of complex networks".PHYSICAL REVIEW E 99.1(2019):12317.

入库方式: OAI收割

来源:理论物理研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。