Given a network where edges represent entities and directed vertices represent relationships between entities, and each vertex has a strength between 0 (no relationship) and 1 (strongest).
I'm looking for a method to calculate the path strength between two entities.
For simple cases, I'm considering the following formulas:
- Path: The strength of the connection is the multiplication of all weights of the links along the path.
- Parallel direct links: The strength of the connection is 1-(1-w1)(1-w2)...(1-wn)
- Were these formulas suggested before?
How can this method be extended to more complex cases, such as the graphs given below: