Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition

08/13/2021
by   Yang Guo, et al.
0

Mining dense subgraphs where vertices connect closely with each other is a common task when analyzing graphs. A very popular notion in subgraph analysis is core decomposition. Recently, Esfahani et al. presented a probabilistic core decomposition algorithm based on graph peeling and Central Limit Theorem (CLT) that is capable of handling very large graphs. Their proposed peeling algorithm (PA) starts from the lowest degree vertices and recursively deletes these vertices, assigning core numbers, and updating the degree of neighbour vertices until it reached the maximum core. However, in many applications, particularly in biology, more valuable information can be obtained from dense sub-communities and we are not interested in small cores where vertices do not interact much with others. To make the previous PA focus more on dense subgraphs, we propose a multi-stage graph peeling algorithm (M-PA) that has a two-stage data screening procedure added before the previous PA. After removing vertices from the graph based on the user-defined thresholds, we can reduce the graph complexity largely and without affecting the vertices in subgraphs that we are interested in. We show that M-PA is more efficient than the previous PA and with the properly set filtering threshold, can produce very similar if not identical dense subgraphs to the previous PA (in terms of graph density and clustering coefficient).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 7

11/11/2019

Towards Gallai's path decomposition conjecture

A path decomposition of a graph G is a collection of edge-disjoint paths...
09/16/2020

A New Perspective of Graph Data and A Generic and Efficient Method for Large Scale Graph Data Traversal

The BFS algorithm is a basic graph data processing algorithm and many ot...
04/06/2019

Density-friendly Graph Decomposition

Decomposing a graph into a hierarchical structure via k-core analysis is...
01/05/2022

Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

Multiple methods of finding the vertices belonging to a planted dense su...
10/24/2018

Communities as Well Separated Subgraphs With Cohesive Cores: Identification of Core-Periphery Structures in Link Communities

Communities in networks are commonly considered as highly cohesive subgr...
09/27/2017

Diversified Coherent Core Search on Multi-Layer Graphs

Mining dense subgraphs on multi-layer graphs is an interesting problem, ...
01/08/2019

K-Core Minimization: A Game Theoretic Approach

K-cores are maximal induced subgraphs where all vertices have degree at ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.