• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

具有幂律度分布的图的零强制数

Zero forcing number of graphs with a power law degree distribution.

作者信息

Vazquez Alexei

机构信息

Cancer Research UK Beatson Institute, Glasgow, United Kingdom and Institute for Cancer Sciences, University of Glasgow, G611BD Glasgow, United Kingdom.

出版信息

Phys Rev E. 2021 Feb;103(2-1):022301. doi: 10.1103/PhysRevE.103.022301.

DOI:10.1103/PhysRevE.103.022301
PMID:33736105
Abstract

The zero forcing number is the minimum number of black vertices that can turn a white graph black following a single neighbor color forcing rule. The zero forcing number provides topological information about linear algebra on graphs, with applications to the controllability of quantum dynamical systems. Here, I investigate the zero forcing number of undirected graphs with a power law degree distribution p_{k}∼k^{-γ} by means of numerical simulations. For graphs generated by the preferential attachment model, with a diameter scaling logarithmically with the graph size, the zero forcing number approaches the graph size when γ→2. In contrast, for graphs generated by the deactivation model, with a diameter scaling linearly with the graph size, the zero forcing number is smaller than the graph size independently of γ. Therefore the scaling of the graph diameter with the graph size is another factor determining the controllability of dynamical systems. These results have implications for the controllability of quantum dynamics on energy landscapes, often characterized by a complex network of couplings between energy basins.

摘要

零强制数是指按照单一邻域颜色强制规则能将白色图变为黑色的黑色顶点的最小数量。零强制数提供了关于图上线性代数的拓扑信息,并应用于量子动力系统的可控性。在此,我通过数值模拟研究具有幂律度分布(p_{k}∼k^{-γ})的无向图的零强制数。对于由偏好依附模型生成的图,其直径随图大小呈对数缩放,当(γ→2)时,零强制数趋近于图大小。相反,对于由失活模型生成的图,其直径随图大小呈线性缩放,零强制数小于图大小,且与(γ)无关。因此,图直径随图大小的缩放是决定动力系统可控性的另一个因素。这些结果对能量景观上量子动力学的可控性具有启示意义,能量景观通常由能量盆地之间复杂的耦合网络所表征。

相似文献

1
Zero forcing number of graphs with a power law degree distribution.具有幂律度分布的图的零强制数
Phys Rev E. 2021 Feb;103(2-1):022301. doi: 10.1103/PhysRevE.103.022301.
2
Accuracy and scaling phenomena in Internet mapping.互联网地图中的准确性与尺度现象。
Phys Rev Lett. 2005 Jan 14;94(1):018701. doi: 10.1103/PhysRevLett.94.018701. Epub 2005 Jan 6.
3
Nonuniform random graphs on the plane: A scaling study.平面上的非均匀随机图:一项标度研究。
Phys Rev E. 2022 Mar;105(3-1):034304. doi: 10.1103/PhysRevE.105.034304.
4
Logic circuits from zero forcing.来自零强制的逻辑电路。
Nat Comput. 2015;14(3):485-490. doi: 10.1007/s11047-014-9438-5.
5
Some asymptotic properties of duplication graphs.复制图的一些渐近性质。
Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Dec;68(6 Pt 2):066119. doi: 10.1103/PhysRevE.68.066119. Epub 2003 Dec 30.
6
An ensemble of random graphs with identical degree distribution.具有相同度分布的随机图集合。
Chaos. 2020 Jan;30(1):013136. doi: 10.1063/1.5105354.
7
Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO) tetrahedra.链状、带状和管状硅酸盐的键拓扑结构。第一部分。(TO)四面体无限一维排列的图论生成。
Acta Crystallogr A Found Adv. 2022 May 1;78(Pt 3):212-233. doi: 10.1107/S2053273322001747. Epub 2022 Apr 4.
8
Robustness of random graphs based on graph spectra.基于图谱的随机图的稳健性。
Chaos. 2012 Dec;22(4):043101. doi: 10.1063/1.4754875.
9
On the centrality of vertices of molecular graphs.关于分子图顶点的中心性。
J Comput Chem. 2013 Nov 5;34(29):2514-23. doi: 10.1002/jcc.23413. Epub 2013 Aug 19.
10
Neighbor network in a polydisperse hard-disk fluid: degree distribution and assortativity.多分散硬球流体中的邻域网络:度分布与 assortativity
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Nov;76(5 Pt 2):056108. doi: 10.1103/PhysRevE.76.056108. Epub 2007 Nov 13.