Related papers: An Exact Continuous Conductance Formulation of the…
Hamiltonian Monodromy is the simplest topological obstruction to the existence of global action-angle coordinates in a completely integrable system. We show that this property can be studied in a neighborhood of a focus-focus singularity by…
Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…
This note presents an analytic construction of the optimal unit-norm direction hat(x) = x/|x| that maximizes or minimizes the objective linear expression, B . hat(x), subject to a system of linear constraints of the form [A] . x = 0, where…
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely:…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a…
A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-adjacencies. For a fixed graph $H$, a full $H$-colouring is a full-homomorphism of $G$ to $H$. A minimal $H$-obstruction is a graph that…
A supergrid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional supergrid. The supergrid graphs contain grid graphs and triangular grid graphs as subgraphs. The Hamiltonian cycle problem for grid and…
We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/8 contains a Hamilton cycle. This is best possible and solves a problem of Thomassen from 1979.
We define a numerical scheme that allows to approximate a given Hamiltonian by an effective one, by requiring several constraints determined by exact properties of generic ''short range'' Hamiltonians. In this way the standard lattice fixed…
The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…
A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph $G_n$, which will be called the prime difference graph of order $n$, with…
This paper consists of two parts. First, the (undirected) Hamiltonian path problem is reduced to a signal filtering problem - number of Hamiltonian paths becomes amplitude at zero frequency for (a combination of) sinusoidal signal f(t) that…
We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another.…
We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph $G(n,W)$ is asymptotically almost surely Hamiltonian. The characterization involves three conditions. Two of them constitute the…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…
In this paper, we study evolutive Hamilton Jacobi equations with Hamiltonians that are discontinuous in time, posed on a simple network consisting of two edges on the real line connected at a single junction. We introduce a notion of…
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set…
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…