Boundary sensitivity to community detection.

<p>It is important during analyses to ensure that the network partitions being examined are representative of the ensemble of solutions generated by <i>Infomap</i> over random seeds [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.ref051" target="_blank">51</a>]. [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.ref017" target="_blank">17</a>] propose assessing the persistence at which <i>Infomap</i> draws boundaries between communities. A bin is said to be a boundary bin if it is directly adjacent to at least one bin belonging to a different community than its own. The boundary persistence of a bin is then the fraction of solutions in the ensemble in which it is labelled as a boundary (Reijnders et al., 2021). We find that boundaries are quite persistent for all model cases (<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.s004" target="_blank">S4 Fig</a>). This is particularly true for the SH case, but even boundaries in the FD and PD cases are persistent within a tight range of bins—much more precise than used for interpretation of network partitions. We see that boundaries are often shifted by just one bin, which can dramatically reduce boundary persistence; however, when taken in context of a tight band of semi-persistent boundary bins, this indicates the general topology of the network partition is persistent in the solution ensemble. These boundary persistence plots give us confidence that an arbitrarily-selected partition from among those that best optimize the map equation is representative of the solution ensemble for the purposes of our analyses. We note that, in the SH case, we have instances of communities that contain no boundary bins, and are also discontiguous. Clearly, boundary persistence cannot indicate the existence of degenerate solutions in the form of spatially-isolated fragments of the community grouping separately from each other; given that communities are well-mixed, this is generally not of concern. Future work may consider more sophisticated measures of partition similarity.</p> <p>(PDF)</p>

Publication Details

Journal
Figshare
Published
2024-11-13
DOI
https://doi.org/10.1371/journal.pone.0308787.s006
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Boundary sensitivity to community detection.

Figshare
Complex Network Analysis Techniques
article

Boundary sensitivity to community detection.

article en

Abstract

<p>It is important during analyses to ensure that the network partitions being examined are representative of the ensemble of solutions generated by <i>Infomap</i> over random seeds [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.ref051" target="_blank">51</a>]. [<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.ref017" target="_blank">17</a>] propose assessing the persistence at which <i>Infomap</i> draws boundaries between communities. A bin is said to be a boundary bin if it is directly adjacent to at least one bin belonging to a different community than its own. The boundary persistence of a bin is then the fraction of solutions in the ensemble in which it is labelled as a boundary (Reijnders et al., 2021). We find that boundaries are quite persistent for all model cases (<a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0308787#pone.0308787.s004" target="_blank">S4 Fig</a>). This is particularly true for the SH case, but even boundaries in the FD and PD cases are persistent within a tight range of bins—much more precise than used for interpretation of network partitions. We see that boundaries are often shifted by just one bin, which can dramatically reduce boundary persistence; however, when taken in context of a tight band of semi-persistent boundary bins, this indicates the general topology of the network partition is persistent in the solution ensemble. These boundary persistence plots give us confidence that an arbitrarily-selected partition from among those that best optimize the map equation is representative of the solution ensemble for the purposes of our analyses. We note that, in the SH case, we have instances of communities that contain no boundary bins, and are also discontiguous. Clearly, boundary persistence cannot indicate the existence of degenerate solutions in the form of spatially-isolated fragments of the community grouping separately from each other; given that communities are well-mixed, this is generally not of concern. Future work may consider more sophisticated measures of partition similarity.</p> <p>(PDF)</p>

Figshare
Openalex Percentile: Top 66%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.