Related papers: Directional Geometry and Anisotropy in the Partiti…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Statistical relationships in observed data can arise for several different reasons: the observed variables may be causally related, they may share a latent common cause, or there may be selection bias. Each of these scenarios can be…
We try to convince the reader that the categorical version of differential geometry, called Synthetic Differential Geometry (SDG), offers valuable tools which can be applied to work with some unsolved problems of general relativity. We do…
A separation of a graph $G$ is a partition $(A_1, A_2, C)$ of $V(G)$ such that $A_1$ is anticomplete to $A_2$. A classic result from Robertson and Seymour's Graph Minors Project states that there is a correspondence between tree…
Directed acyclic graphs (DAGs) encode a lot of information about a particular distribution in their structure. However, compute required to infer these structures is typically super-exponential in the number of variables, as inference…
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries. We give a spectral algorithm called di-sim that builds on a dual measure of…
We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…
We continue the study of the geometry of infinite geodesics in first passage percolation (FPP) on Gromov-hyperbolic groups G, initiated by Benjamini-Tessera and developed further by the authors. It was shown earlier by the authors that,…
We provide a theory of manifold-valued rough paths of bounded 3 > p-variation, which we do not assume to be geometric. Rough paths are defined in charts, and coordinate-free (but connection-dependent) definitions of the rough integral of…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
Graph Edit Distance (GED) is a fundamental, albeit NP-hard, metric for structural graph similarity. Recent neural graph matching architectures approximate GED by first encoding graphs with a Graph Neural Network (GNN) and then applying…
We interpret a construction of geometric realisation by [Besser], [Grayson], and [Drinfeld] of a simplicial set as constructing a space of maps from the interval to a simplicial set, in a certain formal sense, reminiscent of the Skorokhod…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
Geometric graphs are a special kind of graph with geometric features, which are vital to model many scientific problems. Unlike generic graphs, geometric graphs often exhibit physical symmetries of translations, rotations, and reflections,…
The development and time evolution of a transport barrier in a magnetically confined plasma with non-monotonic, nonlinear dependence of the anomalous flux on mean gradients is analyzed. Upon consideration of both the spatial inhomogeneity…
We develop the method of anholonomic frames with associated nonlinear connection (in brief, N--connection) structure and show explicitly how geometries with local anisotropy (various type of Finsler--Lagrange--Cartan--Hamilton geometry) can…
In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations,…
When all non-edge distances of a graph realized in $\mathbb{R}^{d}$ as a {\em bar-and-joint framework} are generically {\em implied} by the bar (edge) lengths, the graph is said to be {\em rigid} in $\mathbb{R}^{d}$. For $d=3$,…
We propose an alternative proof concerning necessary and sufficient conditions to split the problem of searching for d-separators and building the skeleton of a DAG into small problems for every node of a separation tree T. The proof is…
A periodic graph in dimension $d$ is a directed graph with a free action of $\Z^d$ with only finitely many orbits. It can conveniently be represented in terms of an associated finite graph with weights in $\Z^d$, corresponding to a…