Related papers: Directional Geometry and Anisotropy in the Partiti…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
For a geodesic ball with non-negative Ricci curvature and almost maximal volume, without using compactness argument, we construct an $\epsilon$-splitting map on a concentric geodesic ball with uniformly small radius. There are two new…
Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…
A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly…
For the complex of curves of a closed orientable surface of genus $g$, $\mathcal{C}(S_{g>1})$, the notion of efficient geodesic in was introduced in arXiv:1408.4133. There it was established that there always exists (finitely many)…
For a class $\mathcal C$ of graphs, we define $\mathcal C$-edge-brittleness of a graph $G$ as the minimum $\ell$ such that the vertex set of $G$ can be partitioned into sets inducing a subgraph in $\mathcal C$ and there are $\ell$ edges…
This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…
We experimentally investigate quasi-two-dimensional (Q2D) forced shallow flows in the presence of solid boundaries and analyze the deviation from the Kolmogorov-Kraichnan (KK) theory. Complex motion is generated using a thin electrolyte…
The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\}, \] under the Carath\'eodory metric, is a complex Finsler space of cohomogeneity $1$ in which the geodesics, both real and complex, enjoy a rich geometry. As a…
Directed graphs naturally model systems with asymmetric, ordered relationships, essential to applications in biology, transportation, social networks, and visual understanding. Generating such graphs enables tasks such as simulation, data…
Graph Neural Networks (GNNs) have shown remarkable success in learning from graph-structured data. However, their application to directed graphs (digraphs) presents unique challenges, primarily due to the inherent asymmetry in node…
The standard approach to representation learning on attributed graphs -- i.e., simultaneously reconstructing node attributes and graph structure -- is geometrically flawed, as it merges two potentially incompatible metric spaces. This…
This paper studies graphical analogs of symmetric products and unordered configuration spaces in topology. We do so from the perspective of the discrete homotopy theory introduced by Barcelo et al. Our first result is a combinatorial…
Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity…
If the vertices composing a network interact at distinct time points, the temporal ordering of these interactions and the network's graph structure are sufficient to convey the routes by which information can flow in the network. Two…
A new path equation in absolute parallelism (AP) geometry is derived. The equation is a generalization of three path equations derived in a previous work. It can be considered as a geodesic equation modified by a torsion term, whose…
G-structures and Cartan geometries are two major approaches to the description of geometric structures (in the sense of differential geometry) on manifolds of some fixed dimension $n$. We show that both descriptions naturally extend to the…
Boundaries in gauge theory and gravity give rise to symmetries and charges at both finite and asymptotic distance. Due to their structural similarities, it is often held that soft modes are some kind of asymptotic limit of edge modes. Here,…
There has been renewed interest in the path-integral computation of the partition function of AdS3 gravity, both in the metric and Chern-Simons formulations. The one-loop partition function around Euclidean AdS3 turns out to be given by the…
We consider the graph $G_n$ with vertex set $V(G_n) = \{ 1, 2, \ldots, n\}$ and $\{i,j\} \in E(G_n)$ if and only if $0<|i-j| \leq 2$. We call $G_n$ the straight linear 2-tree on $n$ vertices. Using $\Delta$--Y transformations and identities…