Related papers: Monotone Simultaneous Embeddings of Paths in R^d
Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or implicitly, on a similarity measure among nodes, they require…
A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
The (parallel) linear transports along paths in vector bundles are axiomatically described. Their general form and certain properties are found. It is shown that these transports are locally (i.e. along every fixed path) always Euclidean…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…
We consider the geometry of random interlacements on the $d$-dimensional lattice. We use ideas from stochastic dimension theory developed in \cite{benjamini2004geometry} to prove the following: Given that two vertices $x,y$ belong to the…
Let $(X,T)$ be a dynamical system where $X$ is a compact metric space and $T:X\rightarrow X$ is continuous and invertible. Assume the Lebesgue covering dimension of $X$ is $d$. We show that for a generic continuous map…
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5})…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
Every ordinary Riordan array contains two naturally embedded Riordan arrays. We explore this phenomenon, and we compare it to the situation for certain moment matrices of families of orthogonal polynomials.
The lack of generalization in learning-based autonomous driving applications is shown by the narrow range of road scenarios that vehicles can currently cover. A generalizable approach should capture many distinct road structures and…
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…
We show that there are $O(n \cdot 4^{n/11})$ planar graphs on $n$ vertices which do not admit a simultaneous straight-line embedding on any $n$-point set in the plane. In particular, this improves the best known bound $O(n!)$ significantly.
The paper considers the behaviour of the number of paths of length $N$ on graphs with two heavy roots. Such vertices can be entropic traps. Numerical analysis is carried out for graphs with different degrees of root vertices. In the…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by…
Addressing a question posed by Erd\H{o}s and Hajnal, Chen and Ma proved that, for all $n \ge 600$, the complete bipartite graph $K_{n,n+1}$ is the unique graph on $2n+1$ vertices with at least $n^2+n$ edges that contains no two vertices of…
In the vector-field guided path-following problem, a sufficiently smooth vector field is designed such that its integral curves converge to and move along a one-dimensional geometric desired path. The existence of singular points where the…
For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is…