Search results for " Centrality"
showing 7 items of 37 documents
An Analysis of the Internal Organization of Facebook Groups
2019
With the rapid development and growth of online social networks (OSNs), researchers have been pushed forward to improve the knowledge of these complex networks by analyzing several aspects, such as the types of social media, the structural properties of the network, or the interaction patterns among users. In particular, a relevant effort has been devoted to the study and identification of cohesive groups of users in OSNs (also referred as communities) because they are the basic building block of each OSN. While several research works on groups in OSNs have mainly focused on identifying the types of groups and the contents created by their members, the analysis of internal organizations of …
Network Centralities and Node Ranking
2017
An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.
Correlation Analysis of Node and Edge Centrality Measures in Artificial Complex Networks
2021
The role of an actor in a social network is identified through a set of measures called centrality. Degree centrality, betweenness centrality, closeness centrality, and clustering coefficient are the most frequently used metrics to compute the node centrality. Their computational complexity in some cases makes unfeasible, when not practically impossible, their computations. For this reason, we focused on two alternative measures, WERW-Kpath and Game of Thieves, which are at the same time highly descriptive and computationally affordable. Our experiments show that a strong correlation exists between WERW-Kpath and Game of Thieves and the classical centrality measures. This may suggest the po…
Game of Thieves and WERW-Kpath: Two Novel Measures of Node and Edge Centrality for Mafia Networks
2021
Real-world complex systems can be modeled as homogeneous or heterogeneous graphs composed by nodes connected by edges. The importance of nodes and edges is formally described by a set of measures called centralities which are typically studied for graphs of small size. The proliferation of digital collection of data has led to huge graphs with billions of nodes and edges. For this reason, we focus on two new algorithms, Game of Thieves and WERW-Kpath which are computationally-light alternatives to the canonical centrality measures such as degree, node and edge betweenness, closeness and clustering. We explore the correlation among these measures using the Spearman’s correlation coefficient …
Publication Network Analysis of an Academic Family in Information Systems
2011
The study of scientific collaboration through network analysis can give interesting conclusions about the publication habits of a scientific community. Co-authorship networks represent scientific collaboration as a graph: nodes correspond to authors, edges between nodes mark joint publications (Newman 2001a,b). Scientific publishing is decentralized. Choices of co-authors and research topics are seldomly globally coordinated. Still, the structure of co-authorship networks is far from random. Co-authorship networks are governed by principles that are similar in other complex networks such as social networks (Wasserman and Faust 1994), networks of citations between scientific papers (Egghe an…
Flow dominance and factorization of transverse momentum correlations in Pb-Pb collisions at the LHC
2017
Physical review letters 118(16), 162302 (2017). doi:10.1103/PhysRevLett.118.162302
Formaciones sociales y opresión en Marx
2018
The text explains the difference between Marx?s concept of «oppression» and others as «coercion» by Durkheim or «domination» by Weber. The article then establishes, in a methodical way, the centrality of a passage from Capital, in which three different theories on «oppression» appear. It?s explained that two of them are rather a philosophical antinomy. The other, relative to the heteronomy of social time, can be completed by defining the heteronomy of social space, which gives it analytical virtuality. Some examples are given.