logo
ResearchBunny Logo
Computing cliques and cavities in networks

Mathematics

Computing cliques and cavities in networks

D. Shi, Z. Chen, et al.

This innovative research conducted by Dinghua Shi and colleagues explores advanced methods for computing cliques and cavities in complex networks. Leveraging k-core decomposition, the authors propose efficient algorithms for identifying maximum cliques and investigating their structures, revealing fascinating insights into networks like *C. elegans* neuronal structure.

00:00
00:00
Playback language: English
Abstract
This paper presents methods for computing cliques and cavities in complex networks. The authors address the NP-completeness of finding maximum cliques by using k-core decomposition to assess network computability. For computable networks, they propose a search method and algorithm for identifying cliques of various orders and calculating the Euler characteristic number. Betti numbers are computed using boundary matrices of adjacent cliques. An optimized algorithm is designed for finding cavities, and the approach is applied to the *C. elegans* neuronal network, revealing its cliques and cavities.
Publisher
COMMUNICATIONS PHYSICS
Published On
Nov 25, 2021
Authors
Dinghua Shi, Zhifeng Chen, Xiang Sun, Qinghua Chen, Chuang Ma, Yang Lou, Guanrong Chen
Tags
cliques
cavities
complex networks
k-core decomposition
algorithms
Listen, Learn & Level Up
Over 10,000 hours of research content in 25+ fields, available in 12+ languages.
No more digging through PDFs, just hit play and absorb the world's latest research in your language, on your time.
listen to research audio papers with researchbunny