Results 51 to 60 of about 83,569 (275)
Hyperbolic relatively hyperbolic graphs and disk graphs
We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disk graph and the electrified disk graph of a handlebody H of genus g \geq 2 are hyperbolic,
openaire +3 more sources
Hyperbolic Spatial Temporal Graph Convolutional Networks
Abstract Spatial-temporal graph convolutional networks (ST-GCNs) have been successfully applied for dynamic graphs representation learning, such as modeling skeleton-based human actions. However, ST-GCNs embed these non-Euclidean graph structures into Euclidean space, which is not the natural space to represent such structures as embedding them in this
Zhao Guoying +2 more
openaire +2 more sources
Gromov hyperbolic cubic graphs
Abstract If X is a geodesic metric space and x 1; x 2; x 3 ∈ X, a geodesic triangle T = {x 1; x 2; x 3} is the union of the three geodesics [x 1 x
Pestana Domingo +3 more
openaire +2 more sources
Generalized chordality, vertex separators and hyperbolicity on graphs
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides.
Martínez-Pérez, Álvaro
core +1 more source
Embedding right-angled Artin groups into graph braid groups
We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$.
A. Abrams +10 more
core +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like $k\log k$ for the graph of separating curves on a surface of Euler characteristic $-k$.
JONAH GASTER +2 more
doaj +1 more source
Complexity volumes of splittable groups
Using graph of groups decompositions of finitely generated groups, we define Euler characteristic type invariants which are non-zero in many interesting classes of finitely presented, hyperbolic, limit and CSA groups, including elementarily free groups ...
Sykiotis, Mihalis
core +1 more source
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
A Combination Theorem for Metric Bundles
We define metric bundles/metric graph bundles which provide a purely topological/coarse-geometric generalization of the notion of trees of metric spaces a la Bestvina-Feighn in the special case that the inclusions of the edge spaces into the vertex ...
A. Pal +24 more
core +1 more source

