Results 11 to 20 of about 56,162 (272)
Discussiones Mathematicae Graph Theory, 2016 If D = (V,A) is a digraph, its niche hypergraph NH(D) = (V, E) has the edge set ℇ = {e ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = N−D(v) ∨ e = N+D(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition ...
Garske Christian +2 more
doaj +3 more sources
Decomposing hypergraphs into k-colorable hypergraphs [PDF]
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the ...
Gholamreza Omidi , Khosro Tajbakhsh
doaj +2 more sources
Hypergraph Based Berge Hypergraphs [PDF]
Graphs and Combinatorics, 2021 Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A hypergraph $\mathcal{H}$ is {\it Berge-$\mathcal{F}$-free} if it does not contain a subhypergraph which is Berge copy of $\
Balko, Martin +4 more
openaire +3 more sources
Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes [PDF]
Nature Communications, 2022 Complex real-world networks with higher-order interactions can be described and analyzed using two types of representation, simplicial complexes and hypergraphs.
Yuanzhao Zhang, M. Lucas, F. Battiston
semanticscholar +1 more source
Community detection in large hypergraphs [PDF]
Science Advances, 2023 Hypergraphs, describing networks where interactions take place among any number of units, are a natural tool to model many real-world social and biological systems.
Nicolò Ruggeri +3 more
semanticscholar +1 more source
Hypergraph convolution and hypergraph attention [PDF]
Pattern Recognition, 2021 Recently, graph neural networks have attracted great attention and achieved prominent performance in various research fields. Most of those algorithms have assumed pairwise relationships of objects of interest. However, in many real applications, the relationships between objects are in higher-order, beyond a pairwise formulation.
Song Bai, Feihu Zhang, Philip H.S. Torr
openaire +3 more sources
Inference of hyperedges and overlapping communities in hypergraphs [PDF]
Nature Communications, 2022 Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks.
Martina Contisciani +2 more
semanticscholar +1 more source
The theory of percolation on hypergraphs [PDF]
Physical Review E, 2023 Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph robustness is a problem
Ginestra Bianconi, S. Dorogovtsev
semanticscholar +1 more source
Higher-order motif analysis in hypergraphs [PDF]
Communications Physics, 2021 A deluge of new data on real-world networks suggests that interactions among system units are not limited to pairs, but often involve a higher number of nodes.
Q. F. Lotito +3 more
semanticscholar +1 more source
I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs [PDF]
AAAI Conference on Artificial Intelligence, 2022 Although machine learning on hypergraphs has attracted considerable attention, most of the works have focused on (semi-)supervised learning, which may cause heavy labeling costs and poor generalization.
Dongjin Lee, Kijung Shin
semanticscholar +1 more source