You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
import pathpy as pp
import numpy as np
nwk = pp.algorithms.random_graphs.erdoes_renyi_gnm(10,20)
for edge in nwk_w1.edges:
nwk.edges[edge]["weight"] = np.random.random()
pp.algorithms.random_walk.generate_walk(nwk)
The problem is that the probabilities are not weighted, because weights are not normalized.
The thing is that in an udirected network they cannot be normalized, for example, take graph
A-B-C
because A and C have only one link, weights have to be 1 on both AB and BC edges. But then weights around B are not normalized.
The text was updated successfully, but these errors were encountered:
line 5 in my example code should be for edge in nwk.edges:
The workaround that I tried is to create a directed network, and then normalize for each node its outgoing edges.
This also fails because of numeric issues: weights sum to 1.00000000000002 or 0.99999999998.
Example
The problem is that the probabilities are not weighted, because weights are not normalized.
The thing is that in an udirected network they cannot be normalized, for example, take graph
A-B-C
because A and C have only one link, weights have to be 1 on both AB and BC edges. But then weights around B are not normalized.
The text was updated successfully, but these errors were encountered: