Name
Abstract | ||
|---|---|---|
A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1103/PhysRevE.97.012307 | PHYSICAL REVIEW E |
Field | DocType | Volume |
Graph,Topology,Discrete mathematics,Centrality,Uncorrelated,Complex network,Connected component,Mathematics | Journal | 97 |
Issue | ISSN | Citations |
1 | 2470-0045 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ang-Kun Wu | 1 | 0 | 0.34 |
| Liang Tian | 2 | 0 | 0.34 |
| Yang-Yu Liu | 3 | 119 | 9.57 |