ﻻ يوجد ملخص باللغة العربية
The concept of community detection has long been used as a key device for handling the mesoscale structures in networks. Suitably conducted community detection reveals various embedded informative substructures of network topology. However, regarding the practical usage of community detection, it has always been a tricky problem to assign a reasonable community resolution for networks of interest. Because of the absence of the unanimously accepted criterion, most of the previous studies utilized rather ad hoc heuristics to decide the community resolution. In this work, we harness the concept of consistency in community structures of networks to provide the overall community resolution landscape of networks, which we eventually take to quantify the reliability of detected communities for a given resolution parameter. More precisely, we exploit the ambiguity in the results of stochastic detection algorithms and suggest a method that denotes the relative validity of community structures in regard to their stability of global and local inconsistency measures using multiple detection processes. Applying our framework to synthetic and real networks, we confirm that it effectively displays insightful fundamental aspects of community structures.
Social impacts and degrees of organization inherent to opinion formation for interacting agents on networks present interesting questions of general interest from physics to sociology. We present a quantitative analysis of a case implying an evolving
We study the directed and weighted network in which the wards of London are vertices and two vertices are connected whenever there is at least one person commuting to work from a ward to another. Remarkably the in-strength and in-degree distribution
In this paper we present an empirical study of the worldwide maritime transportation network (WMN) in which the nodes are ports and links are container liners connecting the ports. Using the different representation of network topology namely the spa
The one-mode projecting is extensively used to compress the bipartite networks. Since the one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original informatio
Community definitions usually focus on edges, inside and between the communities. However, the high density of edges within a community determines correlations between nodes going beyond nearest-neighbours, and which are indicated by the presence of