DeepAI AI Chat
Log In Sign Up

Computing Cliques and Cavities in Networks

01/03/2021
by   Dinghua Shi, et al.
0

Complex networks have complete subgraphs such as nodes, edges, triangles, etc., referred to as cliques of different orders. Notably, cavities consisting of higher-order cliques have been found playing an important role in brain functions. Since searching for the maximum clique in a large network is an NP-complete problem, we propose using k-core decomposition to determine the computability of a given network subject to limited computing resources. For a computable network, we design a search algorithm for finding cliques of different orders, which also provides the Euler characteristic number. Then, we compute the Betti number by using the ranks of the boundary matrices of adjacent cliques. Furthermore, we design an optimized algorithm for finding cavities of different orders. Finally, we apply the algorithm to the neuronal network of C. elegans in one dataset, and find its all cliques and some cavities of different orders therein, providing a basis for further mathematical analysis and computation of the structure and function of the C. elegans neuronal network.

READ FULL TEXT
10/02/2021

Decomposing a graph into subgraphs with small components

The component size of a graph is the maximum number of edges in any conn...
07/09/2020

Dota Underlords game is NP-complete

In this paper, we demonstrate how the problem of the optimal team choice...
09/11/2022

Hard Optimization Problems have Soft Edges

Finding a Maximum Clique is a classic property test from graph theory; f...
02/01/2021

On the dichromatic number of surfaces

In this paper, we give bounds on the dichromatic number χ⃗(Σ) of a surfa...
11/13/2018

A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples

We enumerate all circulant good matrices with odd orders divisible by 3 ...
08/15/2019

Tracking Paths in Planar Graphs

We consider the NP-complete problem of tracking paths in a graph, first ...
01/10/2020

On the distribution of orders of Frobenius action on ℓ-torsion of abelian surfaces

The computation of the order of Frobenius action on the ℓ-torsion is a p...