Results 91 to 100 of about 56,309 (276)
Hypergraph $p$-Laplacian: A Differential Geometry View
The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph ...
Mandic, Danilo P+2 more
core +1 more source
The effect of heterogeneity on hypergraph contagion models [PDF]
The dynamics of network social contagion processes such as opinion formation and epidemic spreading are often mediated by interactions between multiple nodes.
Nicholas W. Landry, J. Restrepo
semanticscholar +1 more source
RepliChrom is an interpretable machine learning model that predicts enhancer‐promoter interactions using DNA replication timing across multiple cell types. By integrating replication timing with chromatin interaction data from multiple experimental platforms, it accurately distinguishes true interactions and reveals promoter‐region signals as key ...
Fuying Dao+7 more
wiley +1 more source
A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\Omega(n^{r-r/\Delta})$ many edges.
Olaf Parczyk+2 more
openaire +3 more sources
Multiview Hypergraph Fusion Network for Change Detection in High-Resolution Remote Sensing Images
Currently, convolutional neural networks and transformers have been the dominant paradigms for change detection (CD) thanks to their powerful local and global feature extraction capabilities. However, with the improvement of resolution, spatial, spectral,
Xue Zhao+5 more
doaj +1 more source
ABSTRACT An inversion of a tournament T $T$ is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) ${\text{inv}}_{k}(T)$ be the minimum length of a sequence of inversions using sets of size at most k $k$ that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
On Quasi Cycles in Hypergraph Databases
The notion of hypergraph cyclicity is important in numerous fields of application of hypergraph theory in computer science and relational database theory. The database scheme and query can be represented as a hypergraph.
Fayed F. M. Ghaleb+4 more
doaj +1 more source
Multipartite entanglement detection for hypergraph states
We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states ...
Bruß, Dagmar+4 more
core +1 more source
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
Real‐time Nonlinear Model Predictive Control of a Robotic Arm Using Spatial Operator Algebra Theory
ABSTRACT Nonlinear model predictive control (NMPC) has inherent challenges, such as high computational burden, nonconvex optimization, and the necessity of powerful and fast processors with large memory for real‐time robotics. In this study, a new NMPC strategy is proposed using Spatial Operator Algebra (SOA) theory to address these challenges, and ...
Tuğçe Yaren, Selçuk Kizir
wiley +1 more source