Results 21 to 30 of about 83,569 (275)
Hyperbolic Graph Attention Network [PDF]
IEEE Transactions on Big Data, 2021 Graph neural network (GNN) has shown superior performance in dealing with graphs, which has attracted considerable research attention recently. However, most of the existing GNN models are primarily designed for graphs in Euclidean spaces. Recent research has proven that the graph data exhibits non-Euclidean latent anatomy.
Zhang, Yiding +4 more
openaire +2 more sources
High Dimensional Hyperbolic Geometry of Complex Networks
Mathematics, 2020 High dimensional embeddings of graph data into hyperbolic space have recently been shown to have great value in encoding hierarchical structures, especially in the area of natural language processing, named entity recognition, and machine generation of ...
Weihua Yang, David Rideout
doaj +1 more source
IEEE Access, 2023 As Massive Open Online Courses (MOOCs) expand and diversify, more and more researchers study recommender systems that take advantage of interaction data to keep students interested and boost their performance. In a typical roadmap, courses and videos are
Hao Luo +2 more
doaj +1 more source
Matching Biomedical Ontologies via a Hybrid Graph Attention Network
Frontiers in Genetics, 2022 Biomedical ontologies have been used extensively to formally define and organize biomedical terminologies, and these ontologies are typically manually created by biomedical experts. With more biomedical ontologies being built independently, matching them
Peng Wang, Peng Wang, Yunyan Hu
doaj +1 more source
Scientific Reports, 2021 The quest for high-performance of heat transfer components on the basis of accommodating shapes, smaller weights, lower costs and little volume has significantly diverted the industries for the enhancement of heat dissipation with variable thermal ...
Basma Souayeh, Kashif Ali Abro
doaj +1 more source
Hierarchically hyperbolic spaces I: curve complexes for cubical groups [PDF]
, 2016 In the context of CAT(0) cubical groups, we develop an analogue of the theory of curve complexes and subsurface projections. The role of the subsurfaces is played by a collection of convex subcomplexes called a \emph{factor system}, and the role of the ...
Agol +9 more
core +3 more sources
European Journal of Combinatorics, 2002 A connected graph is bridged if it contains no isometric cycles of length more than 3, and it is 1-hyperbolic if for any 4 vertices the largest sum of diagonal distances is at most 1 higher than the second largest. It is shown that a graph satisfies both properties if and only if it does not contain any of 6 specified graphs as an isometric subgraph.
Koolen, JH, Moulton, V
openaire +4 more sources
Gromov Hyperbolicity in Mycielskian Graphs [PDF]
Symmetry, 2017 Since the characterization of Gromov hyperbolic graphs seems a too ambitious task, there are many papers studying the hyperbolicity of several classes of graphs. In this paper, it is proven that every Mycielskian graph G M is hyperbolic and that δ ( G M ) is comparable to diam ( G M ) .
Ana Granados +3 more
openaire +2 more sources
Nearest-neighbor directed random hyperbolic graphs
Physical Review E, 2023 Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model, where nodes randomly distributed on a hyperbolic disk are connected to a fixed number m of their nearest spatial neighbours.
I. A. Kasyanov +3 more
openaire +3 more sources
Hyperbolic Graphs of Small Complexity [PDF]
Experimental Mathematics, 2010 In this paper we enumerate and classify the ``simplest'' pairs (M,G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the pairs we use a variation of Matveev's definition of complexity for 3-manifolds, and we consider only (0,1,2)-irreducible pairs, namely pairs (M,G) such that any 2-sphere in M ...
HEARD D +3 more
openaire +4 more sources