Find Bridging Edges in Networks

controlling the network

number of nodes

10

number of edges

10

generate new network

Click to reveal bridges (red) and local bridges (green).

A bridge in a network is an edge whose removal increases the number of connected components. A local bridge in this Demonstration is defined as an edge whose removal increases by two or more the shortest path distances between nearby nodes. You can vary the number of nodes and edges, creating a new random network.

Details

M. S. Granovetter, "The Strength of Weak Ties," The American Journal of Sociology, 78(6), 1973 pp. 1360–1380.

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, New York: Cambridge University Press, 1994.

External Links

Graph Bridge (Wolfram MathWorld)

Network (Wolfram MathWorld)

Permanent Citation

Phillip Bonacich

"Find Bridging Edges in Networks"
http://demonstrations.wolfram.com/FindBridgingEdgesInNetworks/
Wolfram Demonstrations Project
Published: March 7, 2011