Results 221 to 230 of about 198,105 (266)

Information theory for hypergraph similarity. [PDF]

Sci Adv
Felippe H, Kirkley A, Battiston F.
europepmc   +1 more source

TRACE-DDI: A Hybrid Framework of Transformer-GAT Context Encoder and Pathway-Anchored Knowledge Graphs for DDI Prediction. [PDF]

Comput Struct Biotechnol J
Kim J, Seo T, Jo K.
europepmc   +1 more source

Autoencoder Denoising for Network-Based Spatial Transcriptomics Data with Applications for Cell Signaling Estimation. [PDF]

Complex Netw Appl
Javaid A, Frost HR.
europepmc   +1 more source

Flexible neural representations of abstract structural knowledge in the human entorhinal cortex. [PDF]

Elife
Mark S, Schwartenbeck P, Hahamy A, Samborska V, Baram AB, Behrens TE.   +5 more
europepmc   +1 more source

Epidemic Mean-Field Thresholds of SIS Dynamics on Temporal Multiplex Networks with Activity-Driven Layers

Marjani M, Chatterjee S, Bhattacharyya S, Scoglio C.   +3 more
europepmc   +1 more source

Random Latin square graphs [PDF]

Random Structures and Algorithms, 2012
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their ...
Klas Markstrom
exaly   +2 more sources

Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs

Discrete Applied Mathematics, 2012
We prove that the treewidth of an Erdös-Rényi random graph $\rg{n, m}$ is, with high probability, greater than $βn$ for some constant $β> 0$ if the edge/vertex ratio $\frac{m}{n}$ is greater than 1.073. Our lower bound $\frac{m}{n} > 1.073$ improves the only previously-known lower bound.
Yong Gao
exaly   +4 more sources