Results 31 to 40 of about 47,538 (182)
Generative hypergraph clustering: From blockmodels to modularity [PDF]
Science Advances, 2021 Novel clustering techniques enable the detection of modules in large datasets with multiway interactions. Hypergraphs are a natural modeling paradigm for networked systems with multiway interactions.
Philip S. Chodrow +2 more
semanticscholar +1 more source
Random Structures & Algorithms, 2012 AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Allen, Peter +3 more
openaire +3 more sources
A Survey on Hypergraph Mining: Patterns, Tools, and Generators [PDF]
ACM Computing SurveysHypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world.
Geon Lee +3 more
semanticscholar +1 more source
Decomposing hypergraphs into k-colorable hypergraphs
Transactions on Combinatorics, 2014 For a given hypergraph $H$ with chromatic number $chi(H)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${E_1,E_2,ldots,E_l}$ for $E(H)$, such that the hypergraph induced by $E_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(H) rceil$.
Omidi, Gholamreza, Tajbakhsh, Khosro
openaire +2 more sources
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory, Series B, 2023 22 pages.
Ding, Laihao +4 more
openaire +3 more sources
Topology and its Applications, 2011 We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in this family of polytopes are, on the one end, simplices, and, on the other end, permutohedra.
Došen, Kosta, Petrić, Zoran
openaire +3 more sources
Quasi‐random hypergraphs [PDF]
Random Structures & Algorithms, 1989 AbstractWe introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random.
Chung, F. R. K., Graham, R. L.
openaire +3 more sources
Self-Supervised Hypergraph Representation Learning for Sociological Analysis [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2022 Modern sociology has profoundly uncovered many convincing social criteria for behavioral analysis. Unfortunately, many of them are too subjective to be measured and very challenging to be presented in online social networks (OSNs) for the large data ...
Xiangguo Sun +6 more
semanticscholar +1 more source
Optimal Query Complexity for Reconstructing Hypergraphs [PDF]
, 2010 In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let $G$ be a weighted hidden hypergraph of constant rank with n vertices and $m$ hyperedges. For any $m$
Bshouty, Nader H., Mazzawi, Hanna
core +6 more sources
Session-based Recommendation with Hypergraph Attention Networks [PDF]
SDM, 2021 Session-based recommender systems aim to improve recommendations in short-term sessions that can be found across many platforms. A critical challenge is to accurately model user intent with only limited evidence in these short sessions. For example, is a
Jianling Wang +3 more
semanticscholar +1 more source