Welcome to the latest post of Graphs for Data Science. This week we consider how to attack a network, even when we don’t have complete information about all the nodes and edges.

Thanks to node correlations, we can (preferentially) reach network hubs by selecting a node a random and then reaching out to one of their neighbors. We demonstrate the effectiv…