Neighborhood-based Hypergraph Core Decomposition

by   Naheed Anjum Arafat, et al.
National University of Singapore
Indian Institute of Technology Kanpur
Aalborg University

We propose neighborhood-based core decomposition: a novel way of decomposing hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative approaches to decomposing hypergraphs, e.g., reduction to clique or bipartite graphs, are not meaningful in certain applications, the later also results in inefficient decomposition; while existing degree-based hypergraph decomposition does not distinguish nodes with different neighborhood sizes. Our case studies show that the proposed decomposition is more effective than degree and clique graph-based decompositions in disease intervention and in extracting provably approximate and application-wise meaningful densest subhypergraphs. We propose three algorithms: Peel, its efficient variant E-Peel, and a novel local algorithm: Local-core with parallel implementation. Our most efficient parallel algorithm Local-core(P) decomposes hypergraph with 27M nodes and 17M hyperedges in-memory within 91 seconds by adopting various optimizations. Finally, we develop a new hypergraph-core model, the (neighborhood, degree)-core by considering both neighborhood and degree constraints, design its decomposition algorithm Local-core+Peel, and demonstrate its superiority in spreading diffusion.


Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs

A hypergraph H is said to be 1-Sperner if for every two hyperedges the s...

Core-periphery detection in hypergraphs

Core-periphery detection is a key task in exploratory network analysis w...

On the definition of Shape Parts: a Dominant Sets Approach

In the present paper a novel graph-based approach to the shape decomposi...

HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion

Many important real-world applications-such as social networks or distri...

Planted Hitting Set Recovery in Hypergraphs

In various application areas, networked data is collected by measuring i...

Core-periphery Models for Hypergraphs

We introduce a random hypergraph model for core-periphery structure. By ...

Theoretically and Practically Efficient Parallel Nucleus Decomposition

This paper studies the nucleus decomposition problem, which has been sho...

Please sign up or login with your details

Forgot password? Click here to reset