Engineering Commons^™

The Resilience Of K-Cores In Graphs, Ricky Laishram

Dissertations - ALL

A k-core of a graph is defined as the maximal subgraph such that all the nodes in the subgraph has at least k neighbors within the subgraph. k-core have been used in a number of applications ranging from anomaly detection and finding influential spreaders in social networks, to studying the robustness of financial and ecological networks.

In our work, we study the effect of missing data (edges or nodes) to the k-core of a graph. In particular, we study three different type of changes. The first type of change is the core structural change, in which the rank order of …