Dear all, I am trying to calculate the betweenness centrality with valued ties, but I do not figure it out. Here are the dataset and codes. This is an example dataset with only four nodes/individuals. When collecting the network data, I asked the participants to answer the question about friendsh…

The betweenness centrality of a vertex is, roughly speaking, the number of shortest paths that pass through that vertex. In your graph, all shortest paths consist of a single edge. None of the shortest paths pass through any intermediate vertices. Therefore, all betweenness values are zero. [ima…

Thanks for your prompt reply. And thanks for pointing out my example might be an extreme case that no one is occupying a “broker” position. However, when I try with degree centrality, the results come out are still equal for each vertex, which is not consistent with the reality in the network. Here …

Edge weights have two different interpretations. They can be interpreted as the strength of a tie (e.g. friendship, volume of trade, communication frequency), or as a cost that needs to be paid somehow (e.g. travel time, friction, distance). Centrality measures based on shortest paths are only mean…

Thanks for your explanation, now I have better understood the interpretation of different centrality measures. And for the degree centrality with valued ties, I tried with you suggestion. Here are the codes and results: > strength(graph, mode="in") 1001 1002 1003 1004 3 3 3 3 It seem…

[image] lingchuding: the package still ignores the weight in each tie You need to indicate which edge attribute you want to use as the weight, see igraph R manual pages .

It is still reporting errors: strength(graph, mode = ‘in’, weights = ‘Friend’) Error in strength(graph, mode = “in”, weights = “Friend”) : At structural_properties.c:6014 : Invalid weight vector length, Invalid value

The graph doesn’t seem to have the edge attribute “Friend”. You can check the attributes by calling edge_attr .

I checked and it seems that the edge attributes have been included in. Would you please have me take a look at the data in the attachment and the codes as follows: Example.csv (177 Bytes) library(igraph) #read the edgelist format dataset into R Mydata <- read.table("Example.csv", header=TRUE, se…

Thanks for the clear explanation. When handling graphs where weights indicate strength of tie, would it make sense to define an edge attribute, cost, that is the inverse of weight (1/weight), to use when calculating betweenness or closeness centrality?

Help seeking on calculating betweenness centrality with valued ties

Usage

szhorvat 8 June 2020 06:38 10

Please place all code into code blocks when posting. You can use the formatting toolbar, or write Markdown, like this: How to use this forum?

Topic		Replies	Views
betweeness calculation with directed and weighted graph Uncategorized	4	297	18 October 2023
Weighted edges in centr_degree? Usage R	2	883	27 May 2023
Centrality measures in an undirected and weighted network Usage R	0	71	12 August 2024
Issue verifying betweenness centrality for a directed graph in R Usage R	4	102	30 April 2026
Weighted Edge Betweenness Usage R	2	721	2 May 2021

Help seeking on calculating betweenness centrality with valued ties

Related topics