Results 11 to 20 of about 54,974 (279)

Betweenness Centrality as a Driver of Preferential Attachment in the Evolution of Research Collaboration Networks [PDF]

open access: yesJournal of Informetrics, 2012
We analyze whether preferential attachment in scientific coauthorship networks is different for authors with different forms of centrality. Using a complete database for the scientific specialty of research about "steel structures," we show that ...
Abbasi, Alireza   +2 more
core   +14 more sources

Eigenvector centrality mapping for analyzing connectivity patterns in fMRI data of the human brain. [PDF]

open access: yesPLoS ONE, 2010
Functional magnetic resonance data acquired in a task-absent condition ("resting state") require new data analysis techniques that do not depend on an activation model. In this work, we introduce an alternative assumption- and parameter-free method based
Gabriele Lohmann   +9 more
doaj   +3 more sources

Fully-dynamic Approximation of Betweenness Centrality [PDF]

open access: yes, 2015
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides
A. D’Andrea   +10 more
core   +3 more sources

A faster algorithm for betweenness centrality* [PDF]

open access: yesThe Journal of Mathematical Sociology, 2001
Motivated by the fast‐growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They require O(n + m) space and run in O(nm) and O(nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Ulrik Brandes
openaire   +4 more sources

Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths

open access: yesMathematics, 2022
Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng   +3 more
doaj   +1 more source

The effects of buildings' physical characteristics on urban network centrality

open access: yesAin Shams Engineering Journal, 2022
Urban centrality is critical for comprehending cities’ most significant locations. Conventionally, urbanists analyzed urban centrality by transforming urban spatial networks into graph objects, with nodes and edges reflecting network intersections and ...
Mustafa Aziz Amen
doaj   +1 more source

A measure of centrality in cyclic diffusion processes: Walk-betweenness.

open access: yesPLoS ONE, 2021
Unlike many traditional measures of centrality based on paths that do not allow any repeated nodes or lines, we propose a new measure of centrality based on walks, walk-betweenness, that allows any number of repeated nodes or lines.
Yoosik Youm, Byungkyu Lee, Junsol Kim
doaj   +1 more source

Perbandingan Algortime Dijkstra dan Node Combination Dalam Perhitungan Betweenness Centrality Pada Graf Jaringan Listrik Universitas Padjadjaran Jatinangor

open access: yesJurnal Matematika Integratif, 2022
Energi listrik sangat penting untuk memenuhi kebutuhan masyarakat secara umum dan terkhusus instansi pendidikan yang kini mengandalkan teknologi dalam proses pembelajaran.
Jeane R. M. D. P Chantique   +2 more
doaj   +1 more source

A new measure of centrality for brain networks. [PDF]

open access: yesPLoS ONE, 2010
Recent developments in network theory have allowed for the study of the structure and function of the human brain in terms of a network of interconnected components.
Karen E Joyce   +3 more
doaj   +1 more source

k-step betweenness centrality [PDF]

open access: yesComputational and Mathematical Organization Theory, 2019
The notions of betweenness centrality (BC) and group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between ...
Melda Kevser Akgün, Mustafa Kemal Tural
openaire   +2 more sources

Home - About - Disclaimer - Privacy