Results 1 to 10 of about 55,464 (281)
Scalable Online Betweenness Centrality in Evolving Graphs
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.
Bonchi, Francesco +2 more
core +3 more sources
Transport Processes on Homogeneous Planar Graphs with Scale-Free Loops
We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons.
Argolo de Menezes +15 more
core +1 more source
Betweenness Centrality: Extremal Values and Structural Properties [PDF]
In this paper we investigate the structural properties of betweenness cen-trality and determine some cases in which betweenness reaches its extremal values. Special attention is paid to Star(G), the set of vertices adjacent to all other vertices in a graph and we prove several results about the betweenness of the elements of this set.
GRASSI, ROSANNA +3 more
openaire +3 more sources
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
We consider the all pairs all shortest paths (APASP) problem, which maintains the shortest path dag rooted at every vertex in a directed graph G=(V,E) with positive edge weights.
C Demetrescu +7 more
core +1 more source
Centrality scaling in large networks
Betweenness centrality lies at the core of both transport and structural vulnerability properties of complex networks, however, it is computationally costly, and its measurement for networks with millions of nodes is near impossible.
M. Seshadri +6 more
core +1 more source
Treatment Enhances Betweenness Centrality of Fronto-Parietal Network in Parkinson's Patients. [PDF]
Liu Q +6 more
europepmc +1 more source
Effective co-betweenness centrality computation [PDF]
Betweenness centrality of vertices is essential in the analysis of social and information networks, and co-betweenness centrality is one of two natural ways to extend it to sets of vertices. Existing algorithms for co-betweenness centrality computation suffer from at least one of the following problems: i) their applicability is limited to special ...
openaire +1 more source
Social networks are a mathematical representation of interactions among individuals which are prevalent across various animal species. Studies of human populations have shown the breadth of what can spread throughout a social network: obesity, smoking ...
Rebecca Rooke +6 more
doaj +1 more source
Bird meta-community functional networks between urban parks and conservation areas
The adaptation of biological communities to urban environments is essential in ecological research. While current studies predominantly focus on alpha or beta diversity, community network perspective remain limited.
Xianli Che +7 more
doaj +1 more source
Rank correlation between centrality metrics in complex networks: an empirical study
Centrality is widely used to measure which nodes are important in a network. In recent decades, numerous metrics have been proposed with varying computation complexity.
Shao Chengcheng +4 more
doaj +1 more source

