Results 121 to 130 of about 40,185 (227)
AHD-SLE: Anomalous Hyperedge Detection on Hypergraph Symmetric Line Expansion
Graph anomaly detection aims to identify unusual patterns or structures in graph-structured data. Most existing research focuses on anomalous nodes in ordinary graphs with pairwise relationships.
Yingle Li +4 more
doaj +1 more source
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +1 more source
Non-Abelian Topological Approach to Non-Locality of a Hypergraph State
We present a theoretical study of new families of stochastic complex information modules encoded in the hypergraph states which are defined by the fractional entropic descriptor.
Vesna Berec
doaj +1 more source
AbstractUn hypergraphe arboré est l'hypergraphe d'une familie de sous-arbres d'un arbre. Un hypergraphe est arboré si, et seulement si, il a la propriété de Helly et sa représentation triangulée; cette derniére propriété est ensuite remplacée par une condition sur les cycles de l'hypergraphe.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. E. Zverovich, R. I. Tyshkevich
openaire +2 more sources
Here we introduce simple structures for the analysis of complex hypergraphs, hypergraph animals. These structures are designed to describe the local node neighbourhoods of nodes in hypergraphs. We establish their relationships to lattice animals and network motifs, and we develop their combinatorial properties for sparse and uncorrelated hypergraphs ...
openaire +3 more sources
The Chromatic Number of Kneser Hypergraphs [PDF]
N. Alon, Péter Frankl, L. Lovasz
openalex +1 more source
A matroid on hypergraphs, with applications in scene analysis and geometry [PDF]
Walter Whiteley
openalex +1 more source
Community detection in hypergraphs via mutual information maximization
The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and ...
Jürgen Kritschgau +9 more
doaj +1 more source

