Results 71 to 80 of about 47,538 (182)
Hypergraph Structure Learning for Hypergraph Neural Networks
International Joint Conference on Artificial Intelligence, 2022 Hypergraphs are natural and expressive modeling tools to encode high-order relationships among entities. Several variations of Hypergraph Neural Networks (HGNNs) are proposed to learn the node representations and complex relationships in the hypergraphs.
D. Cai +5 more
semanticscholar +1 more source
International Mathematics Research NoticesAbstract 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
Contributions to Discrete Mathematics, 2023 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
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data‐ and Cognitive Scientists
WIREs Cognitive Science, Volume 17, Issue 2, March/April 2026.Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Edith Haim, Massimo Stella
wiley +1 more source
Zarankiewicz bounds from distal regularity lemma
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
Multipartite Entanglement and Hypergraph states of three qubits
, 2013 Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into six classes ...
Bao, Yan-ru +3 more
core +1 more source
Demonstration of hypergraph-state quantum information processing
Nature CommunicationsUsual multiqubit entangled states can be described using the graph formalism, where each edge connects only two qubits. Here, instead, the authors use a reprogrammable silicon photonics chip to showcase preparation, verification and processing of ...
Jieshan Huang +9 more
semanticscholar +1 more source
The Electronic Journal of Linear Algebra, 2020 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
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Heilbronn's triangle problem is a classical question in discrete geometry. It asks to determine the smallest number Δ=Δ(N)$\Delta = \Delta (N)$ for which every collection in N$N$ points in the unit square spans a triangle with area at most Δ$\Delta$.
Dmitrii Zakharov
wiley +1 more source
The Turán problem for hypergraphs of fixed size [PDF]
, 2005 We obtain a general bound on the Turán density of a hypergraph in terms of the number of edges that it contains. If F is an r-uniform hypergraph with f edges we show that [pi](F) =3 and f->[infinity]
Keevash, Peter
core