Results 41 to 50 of about 56,162 (272)
Signaling pathways function as the information-passing mechanisms of cells. A number of databases with extensive manual curation represent the current knowledge base for signaling pathways. These databases motivate the development of computational approaches for prediction and analysis.
Anna, Ritz +4 more
openaire +2 more sources
Sparse random hypergraphs: Non-backtracking spectra and community detection [PDF]
We consider the community detection problem in a sparse q-uniform hypergraph G, assuming that G is generated according to the Hypergraph Stochastic Block Model (HSBM). We prove that a spectral method based on the non-backtracking operator for hypergraphs
Ludovic Stephan, Yizhe Zhu
semanticscholar +1 more source
Coupled dynamics on hypergraphs: Master stability of steady states and synchronization. [PDF]
In the study of dynamical systems on networks or graphs, a key theme is how the network topology influences stability for steady states or synchronized states.
R. Mulas, C. Kuehn, J. Jost
semanticscholar +1 more source
A class of models for random hypergraphs [PDF]
Despite the recently exhibited importance of higher-order interactions for various processes, few flexible (null) models are available. In particular, most studies on hypergraphs focus on a small set of theoretical models.
M. Barthelemy
semanticscholar +1 more source
Nonintersecting Ryser Hypergraphs [PDF]
8 pages, some corrections in the proof of Lemma 3.6, added more explanation in the appendix, and other minor ...
Bishnoi A., Pepe V.
openaire +2 more sources
Higher-Order Components Dictate Higher-Order Contagion Dynamics in Hypergraphs. [PDF]
The presence of the giant component is a necessary condition for the emergence of collective behavior in complex networked systems. Unlike networks, hypergraphs have an important native feature that components of hypergraphs might be of higher order ...
Jung-Ho Kim, K. Goh
semanticscholar +1 more source
The notion of pattern hypergraph provides a unified view of several previously studied coloring concepts. A pattern hypergraph $H$ is a hypergraph where each edge is assigned a type $\Pi_i$ that determines which of possible colorings of the edge are proper. A vertex coloring of $H$ is proper if it is proper for every edge.
Dvořák, Zdeněk +3 more
openaire +2 more sources
How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Prediction [PDF]
Hypergraphs provide a natural way of representing group relations, whose complexity motivates an extensive array of prior work to adopt some form of abstraction and simplification of higher-order interactions.
Se-eun Yoon +3 more
semanticscholar +1 more source
Core-periphery detection in hypergraphs [PDF]
Core-periphery detection is a key task in exploratory network analysis where one aims to find a core, a set of nodes well-connected internally and with the periphery, and a periphery, a set of nodes connected only (or mostly) with the core.
Francesco Tudisco, D. Higham
semanticscholar +1 more source
Oriented hypergraphs: Balanceability
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic
Lucas J. Rusnak +4 more
openaire +2 more sources

