Search
Search Results
-
Sampling hypergraphs via joint unbiased random walk
Hypergraphs are instrumental in modeling complex relational systems that encompass a wide spectrum of high-order interactions among components. One...
-
Reciprocity in directed hypergraphs: measures, findings, and generators
Group interactions are prevalent in a variety of areas. Many of them, including email exchanges, chemical reactions, and bitcoin transactions, are...
-
Improving the core resilience of real-world hypergraphs
Interactions that involve a group of people or objects are omnipresent in practice. Some examples include the list of recipients of an email, the...
-
Random walk with restart on hypergraphs: fast computation and an application to anomaly detection
Random walk with restart (RWR) is a widely-used measure of node similarity in graphs, and it has proved useful for ranking, community detection, link...
-
Hyper-distance oracles in hypergraphs
We study point-to-point distance estimation in hypergraphs, where the query is parameterized by a positive integer s , which defines the required...
-
Hypergraphs for Frailty Analysis Research Paper
Frailty and multimorbidity becomes more prevalent as the population continues to age. We employ directed hypergraphs to represent the complex...
-
Hypergraphs in Logic Programming
Heterogeneous data is a significant topic in today’s context, necessitating the development of AI tools. Logic programming is a powerful approach for...
-
Dynamic relation learning for link prediction in knowledge hypergraphs
Link prediction for knowledge graphs (KGs), which aims to predict missing facts, has been broadly studied in binary relational KGs. However, real...
-
Topological Analysis of Temporal Hypergraphs
In this work we study the topological properties of temporal hypergraphs. Hypergraphs provide a higher dimensional generalization of a graph that is...
-
Growth patterns and models of real-world hypergraphs
What kind of macroscopic structural and dynamical patterns can we observe in real-world hypergraphs? What can be underlying local dynamics on...
-
Exact and sampling methods for mining higher-order motifs in large hypergraphs
Network motifs are recurrent, small-scale patterns of interactions observed frequently in a system. They shed light on the interplay between the...
-
Bloomier Filters on 3-Hypergraphs
A Bloom filter, originally proposed by Bloom in 1970, is a probabilistic data structure used to determine membership in a set with enduring false...
-
Detecting Critical Nodes in Hypergraphs via Hypergraph Convolutional Network
In many real-world networks, such as co-authorship, etc., relationships are complex and go beyond pairwise associations. Hypergraphs provide a...
-
Convergence properties of optimal transport-based temporal hypergraphs
We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We...
-
Toward maintenance of hypercores in large-scale dynamic hypergraphs
In this paper, we study hypercore maintenance in large-scale dynamic hypergraphs. A hypergraph, whose hyperedges may contain a set of vertices rather...
-
Distributed Coloring of Hypergraphs
For any integer \(r \ge 2\) , a linear r-uniform hypergraph is a...
-
Attributed Stream Hypergraphs: temporal modeling of node-attributed high-order interactions
Recent advances in network science have resulted in two distinct research directions aimed at augmenting and enhancing representations for complex...
-
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
We prove a new property of dual hypergraphs and derive from it Nash-solvability of the corresponding (tight) game forms. This result is known since...
-
Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs
Given a hypergraph H(V, E), a set of vertices \(S\subseteq V\)...
-
Extremal regular graphs and hypergraphs related to fractional repetition codes
Fractional repetition codes (FRCs) are a special family of storage codes with the repair-by-transfer property in distributed storage systems....
