Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Generalized Wasserstein barycenters on Riemannian manifolds are absolutely continuous when all input measures are absolutely continuous, for strictly convex cost profiles h with singularity at zero, via a geometric approximation approach.
Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.
citing papers explorer
-
Relative accessibility for graphs
Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.
-
Absolute continuity of generalized Wasserstein barycenters of finitely many measures
Generalized Wasserstein barycenters on Riemannian manifolds are absolutely continuous when all input measures are absolutely continuous, for strictly convex cost profiles h with singularity at zero, via a geometric approximation approach.
-
Almost planar finitely presented groups
Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.