ترغب بنشر مسار تعليمي؟ اضغط هنا

Consistency landscape of network communities

116   0   0.0 ( 0 )
 نشر من قبل Sang Hoon Lee
 تاريخ النشر 2021
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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 small size network, i.e. that inherent to the ongoing debate between modern creationists (most are Intelligent Design (ID) proponents (IDP)) and Darwins theory of Evolution Defenders (DED)). This study is carried out by analyzing the structural properties of the citation network unfolded in the recent decades by publishing works belonging to members of the two communities. With the aim of capturing the dynamical aspects of the interaction between the IDP and DED groups, we focus on $two$ key quantities, namely, the {it degree of activity} of each group and the corresponding {it degree of impact} on the intellectual community at large. A representative measure of the former is provided by the {it rate of production of publications} (RPP), whilst the latter can be assimilated to the{it rate of increase in citations} (RIC). These quantities are determined, respectively, by the slope of the time series obtained for the number of publications accumulated per year and by the slope of a similar time series obtained for the corresponding citations. The results indicate that in this case, the dynamics can be seen as geared by triggered or damped competition. The network is a specific example of marked heterogeneity in exchange of information activity in and between the communities, particularly demonstrated through the nodes having a high connectivity degree, i.e. opinion leaders.
236 - A.P. Masucci , G.J. Rodgers 2007
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 tail is a power law with exponent around -2, while the out-strength and out-degree distribution tail is exponential. We propose a simple square lattice model to explain the observed empirical behaviour.
559 - Yihong Hu , Daoli Zhu 2008
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 ce $L$ and $P$, we study the statistical properties of WMN including degree distribution, degree correlations, weight distribution, strength distribution, average shortest path length, line length distribution and centrality measures. We find that WMN is a small-world network with power law behavior. Important nodes are identified based on different centrality measures. Through analyzing weighted cluster coefficient and weighted average nearest neighbors degree, we reveal the hierarchy structure and rich-club phenomenon in the network.
121 - Tao Zhou , Jie Ren , Matus Medo 2007
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 n. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method, which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method in compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do personal recommendation?
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 motifs. We show how motifs can be used to define general classes of nodes, including communities, by extending the mathematical expression of Newman-Girvan modularity. We construct then a general framework and apply it to some synthetic and real networks.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا