Nodal domain partition and community structure in networks

来源 :第六届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户:lang19870311
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
It is difficult to detect and evaluate the number of communities in complex networks, especially when the situation involves an ambiguous boundary between the inner-and inter-community densities.In this paper, Discrete Nodal Domain Theory is used to provide a criterion to determine how many communities a network has and how to partition these communities by means of the topological structure and geometric characterization.By capturing the signs of the Laplacian eigenvectors, we separate the network into several reasonable clusters.The method leads to a fast and effective algorithm with application to a variety of real networks data sets.
其他文献
We prove a conjecture of D.Armstrong on the average maximal length of kalternating subsequence of permutations.The k =1 case is a well-known result of Richard S
会议
Let F ={Do, D1,… ,Dl-1} be a (v,K, λ) difference family (DF) over an abelian group G.If F forms a partition of G, then it is called partitioned and denoted by
会议
请下载后查看,本文暂不支持在线获取查看简介。 Please download to view, this article does not support online access to view profile.
國務院的通知和農業部、對外貿易部、紡織工業部、林業部、第二商業部關于全國桑柞蠶生產会議的報告,不另轉發。請各地以农業部門为主,積極协同有關部門参照执行 The State
A graph G is called pancyclic if it contains cycles of length 1, for each 3 ≤ l ≤ n.In 1989, Zhu, Li and Deng introduced the definition of implicit degrees of
会议
本文对双向双车道上慢行车行驶对交通的影响进行了分析研究。通过分析双向双车道上超车过程,提出了最小安全超车时距概念,讨论了最大超车车辆数,导出了计算延误和平均车速下
本刊讯 (记者 武增新)日前,广东省印发《健康广东行动(2019—2030年)》,其中特别提出“塑造健康湾区”“构筑健康领域高层次交流合作平台”.目前,粤港澳医药卫生合作的重要平
期刊
本刊讯 (记者 樊俊)今年的“五一”假期期间,身处基层的扶贫干部坚守岗位一线,各地企业发力产业扶贫,带动贫困户致富,脱贫攻坚成果可期.rn5月3日,晴空万里,在刚刚退出贫困县
期刊
超大规模集成电路物理设计主要分为电路划分,版图规划,布局和布线等阶段,其中每个阶段的数学模型都是NP困难的组合优化问题.随着超大集成电路制造工艺的迅速发展,现在已能生
会议
We survey some of our results in spectral graph theory, including some aspects on adjacency, Laplacian, signless Laplacian and distance spectra.
会议