Percolation and Blind Spots in Complex Networks

Question 1

What is Percolation?

Answer 1

Describes the behavior of networks when nodes or links are added.

Question 2

What is occupation probability?

Answer 2

Locations at which there is an assigned probability p that a node or link will be added there. I.e. at location 7, there’s a 37% chance a node will be added there.

Question 3

What happens when the occupation probability increases and surpasses the critical value?

Answer 3

A giant component arises

Question 4

How do random networks benefit from percolation?

Answer 4

If the average degree of a network was four, it would require 75% node failures to take down the entire network. This means it requires a large amount of failures to disintegrate a network.

Question 5

How does percolation affect scale-free networks?

Answer 5

A giant component will exist even if the critical point is 0.

Question 6

Why is the probability for a multi-node blind spot smaller than a single-node blind spot?

Answer 6

Because a multi-node region covers a larger perimeter and has more neighboring nodes - this is harder to isolate than a single node