اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Weighted and Normalized Gould-Fernandez Brokerage Measure
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Gould and Fernandez (1989) developed a local brokerage measure that defines brokering roles based on the group membership of the nodes from the incoming and outgoing edges. This paper extends on this brokerage measure to account for weighted edges and introduces the Weighted-Normalized Gould-Fernandez measure (WNGF). The measure is applied to the EUREGIO inter-regional trade dataset that is a complete, weighted, and directed graph, when transformed. The results gained from the WNGF measure are compared to those from two dichotomized networks: a threshold network and a multiscale backbone network. The results show that edge-weights carry important information regarding the network structure and that retaining edge-weight information ensures the heterogeneity and the nuanced understanding of the brokerage roles.
قيم البحث
اقرأ أيضاً
Purpose: The purpose of this paper is to explore possible factors impacting team performance in healthcare, by focusing on information exchange within and across hospitals boundaries. Design/methodology/approach: Through a web-survey and group interv
iews, the authors collected data on the communication networks of 31 members of four interdisciplinary healthcare teams involved in a system redesign initiative within a large US childrens hospital. The authors mapped their internal and external social networks based on management advice, technical support and knowledge dissemination within and across departments, studying interaction patterns that involved more than 700 actors. The authors then compared team performance and social network metrics such as degree, closeness and betweenness centrality, and computed cross ties and constraint levels for each team. Findings: The results indicate that highly effective teams were more inwardly focused and less connected to outside members. Moreover, highly recognized teams communicated frequently but, overall, less intensely than the others. Originality/value: Mapping knowledge flows and balancing internal focus and outward connectivity of interdisciplinary teams may help healthcare decision makers in their attempt to achieve high value for patients, families and employees.
With its origin in sociology, Social Network Analysis (SNA), quickly emerged and spread to other areas of research, including anthropology, biology, information science, organizational studies, political science, and computer science. Being its objec
tive the investigation of social structures through the use of networks and graph theory, Social Network Analysis is, nowadays, an important research area in several domains. Social Network Analysis cope with different problems namely network metrics, models, visualization and information spreading, each one with several approaches, methods and algorithms. One of the critical areas of Social Network Analysis involves the calculation of different centrality measures (i.e.: the most important vertices within a graph). Today, the challenge is how to do this fast and efficiently, as many increasingly larger datasets are available. Recently, the need to apply such centrality algorithms to non static networks (i.e.: networks that evolve over time) is also a new challenge. Incremental and dynam
Based on an expert systems approach, the issue of community detection can be conceptualized as a clustering model for networks. Building upon this further, community structure can be measured through a clustering coefficient, which is generated from
the number of existing triangles around the nodes over the number of triangles that can be hypothetically constructed. This paper provides a new definition of the clustering coefficient for weighted networks under a generalized definition of triangles. Specifically, a novel concept of triangles is introduced, based on the assumption that, should the aggregate weight of two arcs be strong enough, a link between the uncommon nodes can be induced. Beyond the intuitive meaning of such generalized triangles in the social context, we also explore the usefulness of them for gaining insights into the topological structure of the underlying network. Empirical experiments on the standard networks of 500 commercial US airports and on the nervous system of the Caenorhabditis elegans support the theoretical framework and allow a comparison between our proposal and the standard definition of clustering coefficient.
Network dismantling aims to scratch the network into unconnected fragments by removing an optimal set of nodes and has been widely adopted in many real-world applications such as epidemic control and rumor containment. However, conventional methods o
ften disassemble the system from the perspective of classic networks, which have only pairwise interactions, and often ignored the more ubiquitous and nature group-wise interactions modeled by hypernetwork. Moreover, a simple network cant describe the collective behavior of multiple objects, it is necessary to solve related problems through hypernetwork dismantling. In this work, we designed a higher order collective influence measure to identify key node sets in hypernetwork. It comprehensively consider the environment in which the target node is located and its own characteristics to determine the importance of the node, so as to dismantle the hypernetwork by removing these selected nodes. Finally, we used the method to carry out a series of real-world hypernetwork dismantling tasks. Experimental results on five real-world hypernetworks demonstrate the effectiveness of our proposed measure.
The information theoretic quantity known as mutual information finds wide use in classification and community detection analyses to compare two classifications of the same set of objects into groups. In the context of classification algorithms, for i
nstance, it is often used to compare discovered classes to known ground truth and hence to quantify algorithm performance. Here we argue that the standard mutual information, as commonly defined, omits a crucial term which can become large under real-world conditions, producing results that can be substantially in error. We demonstrate how to correct this error and define a mutual information that works in all cases. We discuss practical implementation of the new measure and give some example applications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
