Results 121 to 130 of about 56,011 (266)
q-Rung Orthopair Fuzzy Hypergraphs with Applications
Mathematics, 2019 The concept of q-rung orthopair fuzzy sets generalizes the notions of intuitionistic fuzzy sets and Pythagorean fuzzy sets to describe complicated uncertain information more effectively.
Anam Luqman +2 more
doaj +1 more source
Journal of Physics: Complexity, 2023 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
Colorful Subhypergraphs in Kneser Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2014 Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of
openaire +3 more sources
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini +2 more
wiley +1 more source
Eigenvalues of Non-Regular Linear-Quasirandom Hypergraphs [PDF]
, 2014 Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for the so-called ...
Lenz, John, Mubayi, Dhruv
core
Quantum‐Enhanced Simulated Annealing Using Rydberg Atoms
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.This study experimentally demonstrates that a Rydberg hybrid quantum‐classical algorithm, termed as quantum‐enhanced simulated annealing (QESA), provides a computational time advantage over a classical standalone simulated annealing (SA). This scatter plot represents the comparison of QESA versus SA for the 924 graphs with the sizes N=60$N=60$, 80 and ...
Seokho Jeong, Juyoung Park, Jaewook Ahn
wiley +1 more source
Decomposing 1-Sperner hypergraphs
, 2018 A hypergraph is Sperner if no hyperedge contains another one. A Sperner hypergraph is equilizable (resp., threshold) if the characteristic vectors of its hyperedges are the (minimal) binary solutions to a linear equation (resp., inequality) with positive
Boros, Endre +2 more
core
Equitable orientations of sparse uniform hypergraphs [PDF]
, 2016 Caro, West, and Yuster studied how $r$-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped.
Cohen, Nathann, Lochet, William
core +3 more sources
A Prior Causality‐Guided Multi‐View Diffusion Network for Brain Disorder Classification
CAAI Transactions on Intelligence Technology, Volume 10, Issue 6, Page 1731-1744, December 2025.ABSTRACT Functional brain networks have been used to diagnose brain disorders such as autism spectrum disorder (ASD) and attention‐deficit/hyperactivity disorder (ADHD). However, existing methods not only fail to fully consider various levels of interaction information between brain regions, but also limit the transmission of information among ...
Xubin Wu +4 more
wiley +1 more source
The complexity of recognizing $ABAB$-free hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi +3 more
doaj +1 more source