Modularity in planted partition model

Mikhail Koshelev ()
Additional contact information
Mikhail Koshelev: Moscow State University

Computational Management Science, 2023, vol. 20, issue 1, No 34, 15 pages

Abstract: Abstract We obtain tight bounds on the modularity of PPM graphs in the case of equally sized parts. Moreover, we provide a general method that can help in obtaining bounds for various other models.

Date: 2023
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10287-023-00466-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00466-y

Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2

DOI: 10.1007/s10287-023-00466-y

Access Statistics for this article

Computational Management Science is currently edited by Ruediger Schultz

More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().