Results 41 to 50 of about 1,548 (146)
Hypergraph partitioning using tensor eigenvalue decomposition.
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
Abstract For $\ell \geq 3$ , an $\ell$
Lior Gishboliner, Ethan Honest
openaire +2 more sources
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general ...
Breuer, Felix +2 more
openaire +4 more sources
Saliency Detection Method Using Hypergraphs on Adaptive Multiscales
Saliency detection plays an important role in the fields of image processing and computer vision. We present an improved saliency detection method by means of hypergraphs on adaptive multi-scales (HAM).
Feilin Han, Aili Han, Jing Hao
doaj +1 more source
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik +3 more
openaire +3 more sources
Hyper-Null Models and Their Applications
Null models are crucial tools for investigating network topological structures. However, research on null models for higher-order networks is still relatively scarce.
Yujie Zeng +3 more
doaj +1 more source
Abstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire +2 more sources
This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Javaid, Imran +3 more
openaire +3 more sources
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size.
Tanu Raghav +2 more
doaj +1 more source
In this paper, energies associated with hypergraphs are studied. More precisely, results are obtained for the incidence and the singless Laplacian energies of uniform hypergraphs. In particular, bounds for the incidence energy are obtained as functions of well known parameters, such as maximum degree, Zagreb index and spectral radius.
Kauê Cardoso, Vilmar Trevisan
openaire +4 more sources

