English
Related papers

Related papers: A measure of betweenness centrality based on rando…

200 papers

Centrality, in some sense, captures the extent to which a vertex controls the flow of information in a network. Here, we propose Local Detour Centrality as a novel centrality-based betweenness measure that captures the extent to which a…

Social and Information Networks · Computer Science 2022-08-08 Haim Cohen , Yinon Nachshon , Paz M. Naim , Jürgen Jost , Emil Saucan , Anat Maril

Typing Yesterday into the search-bar of your browser provides a long list of websites with, in top places, a link to a video by The Beatles. The order your browser shows its search results is a notable example of the use of network…

Applications · Statistics 2018-10-17 Carla Sciarra , Guido Chiarotti , Francesco Laio , Luca Ridolfi

Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…

Numerical Analysis · Computer Science 2018-08-10 Daniel Boley , Alejandro Buendia , Golshan Golnari

We propose a betweenness centrality measure and algorithms for stochastic networks, where edges can fail and weights vary across realizations, making the most central node random. Our approach models the sequence of reported central nodes…

Social and Information Networks · Computer Science 2026-05-19 Wencheng Bao , Eleftheria Kontou , Chrysafis Vogiatzis

Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This measure is notoriously expensive to compute, and the best…

Data Structures and Algorithms · Computer Science 2015-04-29 Nicolas Kourtellis , Gianmarco De Francisci Morales , Francesco Bonchi

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

Social and Information Networks · Computer Science 2016-11-17 Alexander P. Kartun-Giles , Orestis Georgiou , Carl P. Dettmann

In the study of small and large networks it is customary to perform a simple random walk, where the random walker jumps from one node to one of its neighbours with uniform probability. The properties of this random walk are intimately…

Data Analysis, Statistics and Probability · Physics 2013-09-18 Jean-Charles Delvenne , Anne-Sophie Libert

In this paper, we empirically investigate correlations among four centrality measures, originated from the social science, of various complex networks. For each network, we compute the centrality measures, from which the partial correlation…

Physics and Society · Physics 2007-05-23 Chang-Yong Lee

Recent research on finding important intermediate nodes in a network suspected to contain criminal activity is highly dependent on network centrality values. Betweenness centrality, for example, is widely used to rank the nodes that act as…

Social and Information Networks · Computer Science 2016-01-06 Pritheega Magalingam , Stephen Davis , Asha Rao

Measures of complex network analysis, such as vertex centrality, have the potential to unveil existing network patterns and behaviors. They contribute to the understanding of networks and their components by analyzing their structural…

Social and Information Networks · Computer Science 2018-11-06 Felipe Grando , Diego Noble , Luis C. Lamb

We show that prominent centrality measures in network analysis are all based on additively separable and linear treatments of statistics that capture a node's position in the network. This enables us to provide a taxonomy of centrality…

Physics and Society · Physics 2021-01-25 Francis Bloch , Matthew O. Jackson , Pietro Tebaldi

A central task in network analysis is to identify important nodes in a graph. Betweenness centrality (BC) is a popular centrality measure that captures the significance of nodes based on the number of shortest paths each node intersects…

Social and Information Networks · Computer Science 2024-08-05 Charalampos E. Tsourakakis

Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many different centrality measures exist, most of them apply to…

Computers and Society · Computer Science 2010-06-04 Kristina Lerman , Rumi Ghosh , Jeon Hyung Kang

Real-world complex systems exhibit multiple levels of relationships. In many cases they require to be modeled as interconnected multilayer networks, characterizing interactions of several types simultaneously. It is of crucial importance in…

Physics and Society · Physics 2024-12-06 Albert Solé-Ribalta , Manlio De Domenico , Sergio Gómez , Alex Arenas

Measuring the importance of nodes in a network with a centrality measure is a core task in any network application. There are many measures available and it is speculated that many encode similar information. We give an explicit non-linear…

Physics and Society · Physics 2022-07-05 Tim S. Evans , Bingsheng Chen

In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that vertices with large betweenness define what we call characteristic betweenness paths in both modeled…

Physics and Society · Physics 2019-02-26 Henrique Ferraz de Arruda , Cesar Henrique Comin , Luciano da Fontoura Costa

Estimating influential nodes in large scale networks including but not limited to social networks, biological networks, communication networks, emerging smart grids etc. is a topic of fundamental interest. To understand influences of nodes…

Social and Information Networks · Computer Science 2014-06-13 Sima Das

Centrality measures, erstwhile popular amongst the sociologists and psychologists, have seen broad and increasing applications across several disciplines of late. Amongst a plethora of application specific definitions available in the…

Social and Information Networks · Computer Science 2017-03-23 Rishi Ranjan Singh , Shubham Chaudhary , Manas Agarwal

Identifying the central people in information flow networks is essential to understanding how people communicate and coordinate as well as who controls the information flows in the network. However, the appropriate usage of centrality…

Social and Information Networks · Computer Science 2018-12-17 Chintan Amrit , Joanne ter Maat

Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, ranging from routing to service placement. However, as…

Social and Information Networks · Computer Science 2020-01-23 Pierluigi Crescenzi , Pierre Fraigniaud , Ami Paz