Results 51 to 60 of about 56,309 (276)
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023 Let $\mathcal{H}=(X,\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\in\mathcal{E}$, the subgraph of $Q$ on the elements in $E$ is connected. We consider hypergraphs defined on a host graph. Given a graph $G=(V,E)$, with $c:V\to\{\R,\B\}$ and a collection of connected subgraphs $\mathcal{H}$ of $G$, a primal support ...
Raman, Rajiv, Singh, Karamjeet
openaire +2 more sources
Hypernetwork science via high-order hypergraph walks
EPJ Data Science, 2020 We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width.
Sinan G. Aksoy +4 more
doaj +1 more source
Physical Review E, 2023 Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources
Hypergraph Transformer: Weakly-Supervised Multi-hop Reasoning for Knowledge-based Visual Question Answering [PDF]
Annual Meeting of the Association for Computational Linguistics, 2022 Knowledge-based visual question answering (QA) aims to answer a question which requires visually-grounded external knowledge beyond image content itself. Answering complex questions that require multi-hop reasoning under weak supervision is considered as
Y. Heo +3 more
semanticscholar +1 more source
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +2 more sources
Inventiones mathematicae, 2015 We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member of $C$, and no member of $C$ is large; the collection, which is in various respects optimal, reveals an underlying ...
Saxton, David, Thomason, Andrew
openaire +3 more sources
Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2018 A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if (nk)$\
Wojda Adam Paweł
doaj +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Cross-modal remote sensing (RS) image retrieval aims to retrieve RS images using other modalities (e.g., text) and vice versa. The relationship between objects in the RS image is complex, i.e., the distribution of multiple types of objects is uneven ...
Fanglong Yao +6 more
doaj +1 more source
Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphs [PDF]
arXiv.org, 2022 As a powerful tool for modeling complex relationships, hypergraphs are gaining popularity from the graph learning community. However, commonly used frameworks in deep hypergraph learning focus on hypergraphs with edge-independent vertex weights (EIVWs ...
Jiying Zhang +6 more
semanticscholar +1 more source
Magic of quantum hypergraph states [PDF]
QuantumMagic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing.
Junjie Chen, Yuxuan Yan, You Zhou
doaj +1 more source