Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs are not well developed yet. In this paper, we propose a hypergraph modularity function that generalizes its well established and widely used graph counterpart measure of how clustered a network is. In order to define it properly, we generalize the Chung-Lu model for graphs to hypergraphs. We then provide the theoretical foundations to search for an optimal solution with respect to our hypergraph modularity function. A simple heuristic algorithm is described and applied to a few illustrative examples. We show that using a strict version of our proposed modularity function often leads to a solution where a smaller number of hyperedges get cut as compared to optimizing modularity of 2-section graph of a hypergraph.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC6834335 | PMC |
| http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0224307 | PLOS |
Publication Analysis
Top Keywords
Similar Publications
Adaptive Neural Message Passing for Inductive Learning on Hypergraphs.
IEEE Trans Pattern Anal Mach Intell
July 2024
Graphs are the most ubiquitous data structures for representing relational datasets and performing inferences in them. They model, however, only pairwise relations between nodes and are not designed for encoding the higher-order relations. This drawback is mitigated by hypergraphs, in which an edge can connect an arbitrary number of nodes.
View Article and Find Full Text PDFIdentifying Diagnostic Biomarkers for Autism Spectrum Disorder From Higher-order Interactions Using the PED Algorithm.
Neuroinformatics
July 2024
School of Science, Jiangnan University, Wuxi, Jiangsu, China.
In the field of neuroimaging, more studies of abnormalities in brain regions of the autism spectrum disorder (ASD) usually focused on two brain regions connected, and less on abnormalities of higher-order interactions of brain regions. To explore the complex relationships of brain regions, we used the partial entropy decomposition (PED) algorithm to capture higher-order interactions by computing the higher-order dependencies of all three brain regions (triads). We proposed a method for examining the effect of individual brain regions on triads based on the PED and surrogate tests.
View Article and Find Full Text PDFMeasuring dynamical systems on directed hypergraphs.
Phys Rev E
September 2022
Institut de Recherche pour le Développement (IRD) and Centre Population et Développement (CEPED), University of Paris, Boulevard Saint-Germain 75006 Paris, France.
Networks and graphs provide a simple but effective model to a vast set of systems in which building blocks interact throughout pairwise interactions. Unfortunately, such models fail to describe all those systems in which building blocks interact at a higher order. Higher-order graphs provide us the right tools for the task, but introduce a higher computing complexity due to the interaction order.
View Article and Find Full Text PDFHypergraph clustering based on modularity feature projection for high-order relationship community detection of microorganisms.
Methods
July 2022
School of Computer, Central China Normal University, Wuhan, China; Hubei Key Laboratory of Artificial Intelligence and Smart Learning, Central China Normal University, Wuhan, China. Electronic address:
Microbial community is an important part of organisms or ecosystems to maintain health and stability. Analyzing the interaction of microorganisms in the ecosystem and mining the co-occurrence module of the microbial community can deepen the understanding of microbial community function. This could also improve the ability to manipulate the microbial community, thus provide new means for ecological restoration, disease treatment and drug development.
View Article and Find Full Text PDFOn the Fourier transform of a quantitative trait: Implications for compressive sensing.
J Theor Biol
May 2022
Fourier Genetics, Austin, TX, USA.
This paper explores the genotype-phenotype relationship. It outlines conditions under which the dependence of a quantitative trait on the genome might be predictable, based on measurement of a limited subset of genotypes. It uses the theory of real-valued Boolean functions in a systematic way to translate trait data into the Fourier domain.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!