Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

ESTIMATING MODULARITY BOUNDS FOR HOMOPHILIC SCALE-FREE NETWORKS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 1 (2025) · pp. 0829–0840

DOI
10.30598/barekengvol20iss1pp0829-0840
ISSN
2615-3017, 1978-7227
Published
2025-11-24
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The problem of estimating the modularity boundaries for networks that are both homophilic and scale-free is considered. The key property of homophilic networks is the tendency of nodes to link with similar nodes, i.e., belonging to the same community. Thus, homophily is a natural mechanism for community formation, i.e., network structuring. One of the measures of network structuring is modularity. In homophilic networks, not only can the distribution of node degrees be scale-free, but also the distribution of community sizes. In this case, communities can differ significantly in size, which leads to narrowing the achievable modularity boundaries. Estimates of the modularity boundaries of networks of the considered class are obtained. Mathematically strict estimates contain non-elementary functions, which complicates the practical application of such estimates. Approximate estimates with high (0.005) accuracy for the most characteristic values of network parameters are obtained.

Collaboration network of the authors

5 authors · 10 co-authorship links · 7 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Kharkiv National University of Radio Electronics
  • Simon Kuznets Kharkiv National University of Economics
  • University of Tartu
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 15 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">ESTIMATING MODULARITY BOUNDS FOR HOMOPHILIC SCALE-FREE NETWORKS</dc:title>
	<dc:creator>Shergin, Vadim</dc:creator>
	<dc:creator>Udovenko, Serhii</dc:creator>
	<dc:creator>Miroshnychenko, Tetiana</dc:creator>
	<dc:creator>Chala, Larysa</dc:creator>
	<dc:creator>Dorokhov, Oleksandr</dc:creator>
	<dc:description xml:lang="en-US">The problem of estimating the modularity boundaries for networks that are both homophilic and scale-free is considered. The key property of homophilic networks is the tendency of nodes to link with similar nodes, i.e., belonging to the same community. Thus, homophily is a natural mechanism for community formation, i.e., network structuring. One of the measures of network structuring is modularity. In homophilic networks, not only can the distribution of node degrees be scale-free, but also the distribution of community sizes. In this case, communities can differ significantly in size, which leads to narrowing the achievable modularity boundaries. Estimates of the modularity boundaries of networks of the considered class are obtained. Mathematically strict estimates contain non-elementary functions, which complicates the practical application of such estimates. Approximate estimates with high (0.005) accuracy for the most characteristic values of network parameters are obtained.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-11-24</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/19648</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss1pp0829-0840</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 1 (2026): BAREKENG: Journal of Mathematics and Its Application; 0829-0840</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss1year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/19648/11767</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Vadim Shergin, Serhii Udovenko, Tetiana Miroshnychenko, Larysa Chala, Oleksandr Dorokhov</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>