arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0910.3556cond-mat.dis-nn
收藏

具有拓扑约束的随机图的谱密度

Spectral density of random graphs with topological constraints

Tim Rogers, Conrad Pérez Vicente, Koujin Takeda, Isaac Pérez Castillo

摘要:

利用复制图法分析了具有拓扑约束的随机图的谱密度。我们认为图集成具有广义度度相关性,以及那些与社区结构。在每一种情况下,一个精确的解决方案被发现的谱密度的形式的一致性方程取决于统计特性的图形合奏的问题。我们强调这些拓扑约束的影响,由此产生的谱密度。

英文摘要:

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case an exact solution is found for the spectral density in the form of consistency equations depending on the statistical properties of the graph ensemble in question. We highlight the effect of these topological constraints on the resulting spectral density.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑