随机网络上社区检测函数的集中性和稳定性
The Concentration and Stability of the Community Detecting Functions on Random Networks
摘要:
本文提出了一种一般形式的社区检测函数,用于寻找随机网络的社区或最优划分,并利用有界差分鞅方法研究了函数值的集中性和稳定性。我们推导出LDP不等式的一般情况下和几个特定的社区检测功能:模块化,图二分割和q-Potts社区结构。我们还讨论了不同类型的随机网络:稀疏和非稀疏网络和一些例子,如ER和CL网络上的社区检测功能的浓度和稳定性。
英文摘要:
We propose a general form of community detecting functions for finding the communities or the optimal partition of a random network, and examine the concentration and stability of the function values using the bounded difference martingale method. We derive LDP inequalities for both the general case and several specific community detecting functions: modularity, graph bipartitioning and q-Potts community structure. We also discuss the concentration and stability of community detecting functions on different types of random networks: the sparse and non-sparse networks and some examples such as ER and CL networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。