# Ask for help: Network-X edge_betweeness_centrality function does not take weight into account

30 views

### Emma Van Hoogmoed

Nov 26, 2022, 2:44:20 PM11/26/22
to networkx-discuss

I am trying to randomize the link weights of a network x graph to change the betweenness centrality of that network. I have verified that the weights do change but it does not change the output of the edge_betweeness_centrality function. I suspect it has something to do with adding objects to the nodes and edges as I was able to get it working as long as I didn't have these. However, I need the objects for other parts of my code so deleting them isn't an option.

I have tried load_centrality and betweenness_centrality and both give me the same issue. I have also verified my inputs are integers or floats. I understand the functions interpret the values as distances so I have tried both the normal weight and the reciprocal of the weight. I've been stuck on this issue for weeks and would appreciate any help or ideas. Thank you.

The following is my code.

import networkx as nx
import numpy as np
from itertools import combinations, groupby
import random

self.rate = rate
self.distance = distance
self.network = network
self.buffer = []

class Node:
def __init__(self,node_id,network):
self.node_id = node_id
self.len = 0
self.queue = []
self.network = network
self.packet_delay = []
self.packets = []

def gnp_random_connected_graph(n, p):
graph_seed = np.random.default_rng(2021)

network = nx.Graph()

node_dict = {}
for node in range(n):
new_node = Node(node, network)
node_dict[node] = new_node

edges = list(combinations(range(n), 2))
for id, node_edges in groupby(edges, key=lambda x: x):
rate = random.randint(8000000,40000000) #bps
distance = random.randint(10,185) #meters
node_edges = list(node_edges)
random_edge = tuple(graph_seed.choice(node_edges))

for e in node_edges:
if graph_seed.random() < p:

nodes = list(network.nodes)

return network

def randomize_weights(network):

for edge in network.edges():
rand_num = random.randint(10,100)
network[edge][edge]['weight'] = rand_num
network[edge][edge]['rp'] = 1/rand_num

return network

org_net = gnp_random_connected_graph(10,.1)
#print("edges weight",nx.get_edge_attributes(org_net,'weight'))
bc_dict = nx.edge_betweenness_centrality(org_net, weight='rp')
print("OLD",bc_dict)
new_net = randomize_weights(org_net.copy())
#print("edges weight",nx.get_edge_attributes(new_net,'weight'))
new_bc_dict = nx.edge_betweenness_centrality(new_net, weight='rp')
print("NEW", new_bc_dict)

### Dan Schult

Nov 27, 2022, 4:54:47 AM11/27/22
betweenness centrality for each node depends on the number of shortest paths that pass through each node.
So, even if the weights change, if the shortest paths don't change, the BC values will stay the same.
Your network has very few shortest paths. Most node pairs don't even have a shortest path between them.
Those that do have only one possible path and so the weights won't matter.

You might try using more nodes (gnp graphs form a large connected component in the limit of large n).
Also, you can use code more like:

```python
G = nx.gnp_random_graph(100, 0.2)
biggest_component = next(nx.connected_components(G))
G = G.subgraph(biggest_component).copy()

nx.set_edge_attributes(G, {e: seed.integers(10, 185) for e in G.edges}, "distance")
nx.set_edge_attributes(G, {(u, v): 1 / dd["distance"] for u, v, dd in G.edges.data()}, "rp")

BC = nx.edge_betweenness_centrality(G, weight="distance")
```

### Emma Van Hoogmoed

Nov 27, 2022, 5:39:03 PM11/27/22
Thank you! That does seem to be working now. Just wondering about using the subgraph and connected_components. Is that just making a copy of the graph or is that excluding data from the graph?

--
You received this message because you are subscribed to the Google Groups "networkx-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to networkx-discu...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/networkx-discuss/CA%2BXMcTOKAMAUtQ3_wFh58-zmtnukJhPoHPwsfiSi1XJ7qsEJiw%40mail.gmail.com.

### Emma Van Hoogmoed

Nov 27, 2022, 6:02:19 PM11/27/22
I take that back. I need to have a graph where all nodes are connected by at least one edge. The nx.gnp_random_graph does not do that. Which is why I needed to use the function I created. Unfortunately, the solution you provided doesn't work with my function.

### Dan Schult

Nov 27, 2022, 6:13:12 PM11/27/22
The point of the subgraph with the connected components is to retain only the largest connected component of the graph.

### Emma Van Hoogmoed

Nov 27, 2022, 6:39:58 PM11/27/22
{"ft_lang_label":"__label__en","ft_lang_prob":0.9412353,"math_prob":0.9065076,"size":1755,"snap":"2023-14-2023-23","text_gpt3_token_len":432,"char_repetition_ratio":0.11593375,"word_repetition_ratio":0.27888447,"special_character_ratio":0.2039886,"punctuation_ratio":0.116564415,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9896263,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-30T00:21:41Z\",\"WARC-Record-ID\":\"<urn:uuid:323d960b-1f60-4bb1-b809-9bf3e8c1afd4>\",\"Content-Length\":\"845914\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:391dfd82-94e7-45d5-b415-592e8517fab3>\",\"WARC-Concurrent-To\":\"<urn:uuid:dbdd2e36-dc30-413c-a27f-5ecde91eb577>\",\"WARC-IP-Address\":\"172.253.115.138\",\"WARC-Target-URI\":\"https://groups.google.com/g/networkx-discuss/c/-xLBfmpPkRg\",\"WARC-Payload-Digest\":\"sha1:2BHSVSMRLMRMH6ZJYBDZ75MVLFXPC2RB\",\"WARC-Block-Digest\":\"sha1:XNG2ZKTV5HL4GEMBRMETBNSJRD7TCPFO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296949035.66_warc_CC-MAIN-20230329213541-20230330003541-00635.warc.gz\"}"}