Results 101 to 110 of about 25,758 (195)
Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions
EntropyQuantum contextuality plays a significant role in supporting quantum computation and quantum information theory. The key tools for this are the Kochen–Specker and non-Kochen–Specker contextual sets.
Mladen Pavičić
doaj +1 more source
A Hypergraph Data Model for Expert-Finding in Multimedia Social Networks
Information, 2019 Online Social Networks (OSNs) have found widespread applications in every area of our life. A large number of people have signed up to OSN for different purposes, including to meet old friends, to choose a given company, to identify expert users about a ...
Flora Amato +2 more
doaj +1 more source
Hypergraph-Mlp: Learning on Hypergraphs Without Message Passing
ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)Hypergraphs are vital in modelling data with higher-order relations containing more than two entities, gaining prominence in machine learning and signal processing. Many hypergraph neural networks leverage message passing over hypergraph structures to enhance node representation learning, yielding impressive performances in tasks like hypergraph node ...
Tang, B, Chen, S, Dong, X
openaire +3 more sources
HyperGodot: Interactive hypergraph visualization tool
SoftwareXHypergraphs provide a robust framework for modeling complex, multi-actor interactions that traditional graphs struggle to represent. In many real-world applications, interactions involve more than just pairs of entities, which makes hypergraphs an ...
Attila Ficsor +3 more
doaj +1 more source
A Note on a Broken-Cycle Theorem for Hypergraphs
Discussiones Mathematicae Graph Theory, 2014 Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets.
Trinks Martin
doaj +1 more source
Hypergraphes de Petersen! Hypergraphes de Moore?
Discrete Mathematics, 1993 RésuméOn étudie ici des sous structures des plan projectifs finis Pg(2,n) oú n est impair. Dans ceux-ci les (n + 1)-arcs induisent une décomposition canonique.Soit E l'ensemble des points, D celui des droites, appelons X l'ensemble des points d'un (n+1)-arc.
openaire +1 more source
Connected components in networks with higher-order interactions
Journal of Physics: ComplexityWe address the problem of defining connected components in hypergraphs, which are models for systems with higher-order interactions. For graphs with dyadic interactions, connected components are defined in terms of paths connecting nodes along the graph.
Gyeong-Gyun Ha +2 more
doaj +1 more source
Entropy-based models to randomise real-world hypergraphs
Communications PhysicsNetwork theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems.
Fabio Saracco +3 more
doaj +1 more source
Extending Graph-Based LP Techniques for Enhanced Insights Into Complex Hypergraph Networks
IEEE AccessMany real-world problems can be modelled in the form of complex networks. Social networks such as research collaboration networks and facebook, biological neural networks such as human brains, biomedical networks such as drug-target interactions and ...
Y. V. Nandini +4 more
doaj +1 more source
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources