Related papers: Graphs, defined by Weyl distance or incidence, tha…
The problem of interpreting a set of ${\cal W}$-algebra constraints constructed in terms of an arbitrarily twisted scalar field as the recursion relations of a topological theory is addressed. In this picture, the conventional models of…
The notions of length of a vector field and cosine of the angle between two vector fields over a differentiable manifold with contravariant and covariant affine connections and metrics are introduced and considered. The change of the length…
In this paper, we explore a taxonomy of connectivity for space-like structures. It is inspired by isolating posets of connected pieces of a space and examining its embedding in the ambient space. The taxonomy includes in its scope all…
Congruences, or $2$-parameter families of lines in $3$-space are of interest in many situations, in particular in geometric optics. In this paper we consider elements of their geometry which are invariant under affine changes of…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Given a vector bundle $E$ of rank $r$ and degree $d$ on a curve $C$ of genus $g$, one can associate to $E$ in a natural way several other vector bundles. For example, one can take wedge powers of $E$. If $E$ is generated by global sections,…
In this note we present some abstract ideas how one can construct spaces from building blocks according to a graph. The coupling is expressed via boundary pairs, and can be applied to very different spaces such as discrete graphs, quantum…
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…
If we are given a connected finite graph $G$ and a subset of its vertices $V_{0}$, we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_{0}$. Some properties and examples of…
We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.
We show that grafting any fixed hyperbolic surface defines a homeomorphism from the space of measured laminations to Teichmuller space, complementing a result of Scannell-Wolf on grafting by a fixed lamination. This result is used to study…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity $\pi(G)$ and the remoteness $\rho(G)$ of $G$ are the minimum and the maximum of the…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
The Wiener index of a vertex coloring of a graph is defined to be the sum of all pairwise geodesic distances between vertices of the same color. We provide characterizations of vertex colorings of paths and cycles whose Wiener index is as…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…
A graphical model is a statistical model that is associated to a graph whose nodes correspond to variables of interest. The edges of the graph reflect allowed conditional dependencies among the variables. Graphical models admit…
We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.
A global vector field $v$ on a "spacetime" differentiable manifold $\mathrm{V}$, of dimension $N+1$, defines a congruence of world lines: the maximal integral curves of $v$, or orbits. The associated global space $\mathrm{N}\_v$ is the set…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…