Cory Glover
@cory-glover.bsky.social
A network scientist with too many interests. Seeking Postdoc or Research Position.
PhD Candidate in Network Science • Mathematician • Physicist • Husband • Latter-Day Saint • Music Obsessive
https://coryglover.github.io
PhD Candidate in Network Science • Mathematician • Physicist • Husband • Latter-Day Saint • Music Obsessive
https://coryglover.github.io
And this approach works really well! Because these nodes are both weak and well-connected, they can prevent a cascade before it's too late and better than many existing algorithms!
7/7
7/7
July 16, 2025 at 8:35 PM
And this approach works really well! Because these nodes are both weak and well-connected, they can prevent a cascade before it's too late and better than many existing algorithms!
7/7
7/7
The critical set (green nodes) is the set of nodes they argue to protect. These nodes are both are fragile, implying they are not resilient to attacks. Secondly, these nodes have degree larger than the critical degree, implying they are well-connected enough to potentially start a cascade.
6/7
6/7
July 16, 2025 at 8:35 PM
The critical set (green nodes) is the set of nodes they argue to protect. These nodes are both are fragile, implying they are not resilient to attacks. Secondly, these nodes have degree larger than the critical degree, implying they are well-connected enough to potentially start a cascade.
6/7
6/7
By coloring the network, the network gets subdivided into distinct groups. The average degree of each group is calculated and the smallest average degree of all the groups is called the critical degree. The critical set is then the fragile nodes with degree greater than the critical degree.
5/7
5/7
July 16, 2025 at 8:35 PM
By coloring the network, the network gets subdivided into distinct groups. The average degree of each group is calculated and the smallest average degree of all the groups is called the critical degree. The critical set is then the fragile nodes with degree greater than the critical degree.
5/7
5/7
Using graph coloring, the authors successfully identify these fragile nodes. Graph coloring is a concept that stems from the 1800s. Graph coloring consists of assign each node a color such that each node does not share the same color as it's neighbor. (Image Wikipedia - Graph Coloring).
4/7
4/7
July 16, 2025 at 8:35 PM
Using graph coloring, the authors successfully identify these fragile nodes. Graph coloring is a concept that stems from the 1800s. Graph coloring consists of assign each node a color such that each node does not share the same color as it's neighbor. (Image Wikipedia - Graph Coloring).
4/7
4/7