Types of models used in the study of Percolation, and Percolation theory
Remove nodes (each with a given probability; or a fixed fraction. These are the same in the limit of infinte ). Can have
Remove edges
Prunning process for obtaining K-core of a network: one removes all nodes with fewer than K neighbours, and repeats this process
Percolation processes that show a discontinuous, or at least very steep phase transition.
http://research.microsoft.com/en-us/um/people/holroyd/boot/
An "infection" process in which nodes become infected if sufficiently many of their neighbors are infected. Related to the Centola-Many threshold model for social contagions.
One construes "connectivity" as implying that a sufficiently short path still exists after some network components have been removed. To appreciate this idea, imagine trying to navigate a city in which some streets are blocked.
Percolation of K-cliques (completely connected subgraphs of K nodes) has been used to study the algorithmic detection of dense sets of nodes known as "communities" (see Uncovering the overlapping community structure of complex networks in nature and society pdf).
A type of process that is non-self-averaging, in the sense that the relative variance of the size of the largest component doesn't vanish in the thermodynamic limit.
Percolation on a directed Network.