Controllability and maximum matchings of complex networks

doi:10.1103/PhysRevE.99.012317

CORC > 理论物理研究所 > 中国科学院理论物理研究所 > 理论物理所科研产出 > 理论物理所1978-2010年知识产出

	Controllability and maximum matchings of complex networks
	Zhao, Jin-Hua ; Zhou, Hai-Jun
刊名	PHYSICAL REVIEW E
	2019
卷号	99 期号:1 页码:12317
关键词	RANDOM GRAPHS DYNAMICS
ISSN号	1539-3755
DOI	10.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/27195]
专题	理论物理研究所_理论物理所1978-2010年知识产出
作者单位	1.Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China 2.[Zhao, Jin-Hua 3.Chinese Acad Sci, Inst Theoret Phys, CAS Key Lab Theoret Phys, Beijing 100190, Peoples R China
推荐引用方式 GB/T 7714	Zhao, Jin-Hua,Zhou, Hai-Jun. Controllability and maximum matchings of complex networks[J]. PHYSICAL REVIEW E,2019,99(1):12317.
APA	Zhao, Jin-Hua,&Zhou, Hai-Jun.(2019).Controllability and maximum matchings of complex networks.PHYSICAL REVIEW E,99(1),12317.
MLA	Zhao, Jin-Hua,et al."Controllability and maximum matchings of complex networks".PHYSICAL REVIEW E 99.1(2019):12317.