Results 71 to 80 of about 1,405,425 (255)
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
An Irrational Turán Density via Hypergraph Lagrangian Densities
Electronic Journal of Combinatorics, 2022 Baber and Talbot asked whether there is an irrational Turán density of a single hypergraph. In this paper, we show that the Lagrangian density of a 4-uniform matching of size 3 is an irrational number. Sidorenko showed that the Lagrangian density of an r-
Biao Wu
semanticscholar +1 more source
Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz +1 more
wiley +1 more source
Consistency of Spectral Hypergraph Partitioning under Planted Partition Model
, 2016 Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs ...
Dukkipati, Ambedkar +1 more
core +1 more source
Definition and Computation of Tensor‐Based Generalized Function Composition
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
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
On the Rectilinear Crossing Number of Complete Uniform Hypergraphs
, 2016 In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedges in the $d$-dimensional rectilinear drawing of a $d$-uniform hypergraph ...
Anshu, Anurag +3 more
core +1 more source
The Hardness of 3-Uniform Hypergraph Coloring
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002 We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors.
Irit Dinur +2 more
semanticscholar +1 more source
Randomized Hypergraph States and Their Entanglement Properties
Annalen der Physik, Volume 538, Issue 1, January 2026.Randomized hypergraph (RH) states are mixed states that extend the concept of randomized graph states to multi‐qubit hypergraphs subject to probabilistic gate imperfections. By modeling noisy multi‐qubit operations, this work reveals nonmonotonic behavior in bipartite and multipartite entanglement, derives analytical witnesses for specific hypergraph ...
Vinícius Salem +2 more
wiley +1 more source
Randi´c Matrix and Randi´c Energy of Uniform Hypergraphs [PDF]
Mathematics Interdisciplinary ResearchThe Randi´c matrix $R=[r_{ij}]$ of a graph $ G=(V,E) $ was defined as $r_{ij}=\frac{1}{\sqrt{d_id_j}}$ if vertices $v_i$ and $v_j$ are adjacent and $r_{ij}=0$ otherwise, where $d_i$ is the degree of the vertex $v_i\in V$.
Gholam Hassan Shirdel +2 more
doaj +1 more source