New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$

Published:2021-10 Issue:4 Volume:57 Page:380-401
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Derevyanko N. M.,Koshelev M. M.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

https://link.springer.com/content/pdf/10.1134/S0032946021040086.pdf

Reference22 articles.

1. Newman, M.E.J. and Girvan, M., Finding and Evaluating Community Structure in Networks, Phys. Rev. E, 2004, vol. 69, no. 2, pp. 026113 (15 pp.). https://doi.org/10.1103/PhysRevE.69.026113

2. Lancichinetti, A. and Fortunato, S., Limits of Modularity Maximization in Community Detection, Phys. Rev. E, 2011, vol. 84, no. 6, pp. 066122 (8 pp.). https://doi.org/10.1103/PhysRevE.84.066122

3. Miasnikof, P., Prokhorenkova, L., Shestopaloff, A.Y., and Raigorodskii, A., A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability, Learning and Intelligent Optimization (13th Int. Conf. LION’13, Chania, Crete, Greece, May 27–31, 2019, Revised Selected Papers), Matsatsinis, N.F., Marinakis, Y., and Pardalos, P.M., Eds., Lect. Notes Comput. Sci., vol. 11968, Cham: Springer, 2000, pp. 17–29. https://doi.org/10.1007/978-3-030-38629-0_2

4. Newman, M.E.J., Fast Algorithm for Detecting Community Structure in Networks, Phys. Rev. E, 2004, vol. 69, no. 6, pp. 066133 (5 pp.). https://doi.org/10.1103/PhysRevE.69.066133

5. Ostroumova Prokhorenkova, L., General Results on Preferential Attachment and Clustering Coefficient, Optim. Lett., 2017, vol. 11, no. 2, pp. 279–298. https://doi.org/10.1007/s11590-016-1030-8

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Modularity in planted partition model;Computational Management Science;2023-07-17

2. Spectrum of Johnson graphs;Discrete Mathematics;2023-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3