Results 101 to 110 of about 58,352 (274)
On $\alpha$-spectral theory of a directed k-uniform hypergraph [PDF]
Computer Science Journal of Moldova, 2020 In this paper, we study a k-uniform directed hypergraph in general form and introduce its adjacency tensor, Laplacian tensor and signless Laplacian tensor. For the $k$-uniform directed hypergraph $\mathcal{H}$ and $0\leq \alpha
Gholam-Hasan Shirdel +2 more
doaj
Multi-grained hypergraph interest modeling for conversational recommendation
AI Open, 2023 Conversational recommender system (CRS) interacts with users through multi-turn dialogues in natural language, which aims to provide high-quality recommendations for user’s instant information need.
Chenzhan Shang +4 more
doaj +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
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem
Journal of Intelligent Systems, 2017 The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj +1 more source
A Refined Graph Container Lemma and Applications to the Hard‐Core Model on Bipartite Expanders
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard‐core model on bipartite expander graphs. Given a graph G$$ G $$ and λ>0$$ \lambda >0 $$, the hard‐core model on G$$ G $$ at activity λ$$ \lambda $$ is the probability distribution μG,λ$$ {\mu}_{G,\lambda } $$ on ...
Matthew Jenssen +2 more
wiley +1 more source
Beyond pairwise clustering [PDF]
, 2005 We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem.
Agarwal, Sameer +5 more
core +2 more sources
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 1, January 2026.Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +1 more source
Spectral Properties of Oriented Hypergraphs
, 2014 An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an
Reff, Nathan
core +1 more source