Related papers: An Exact Continuous Conductance Formulation of the…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with linear degrees and a $d$-dimensional random geometric graph $G^d(n,r)$, for any $d\geq1$. We obtain an asymptotically optimal bound on the…
Recently a path integral formalism has been proposed by the author which gives the time evolution of moments of slow variables in a Hamiltonian statistical system. This closure relies on evaluating the informational discrepancy of a time…
Any graph can be represented pictorially as a figure. Moreover, it can be represented as two or more figures that can be have different properties to each other. For the purpose of HCP, we represent a graph by two such figures. In each of…
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this…
This paper investigates the central role played by the Hamiltonian in continuous-time nonlinear optimal control problems. We show that the strict convexity of the Hamiltonian in the control variable is a sufficient condition for the…
In this work we establish the equivalence of algorithmic regularization and explicit convex penalization for generic convex losses. We introduce a geometric condition for the optimization path of a convex function, and show that if such a…
We investigate the asymptotic behavior of solutions of Hamilton-Jacobi equations with large drift term in an open subset of two-dimensional Euclidean space. When the drift is given by $\varepsilon^{-1} (H_{x_2}, -H_{x_1})$ of a Hamiltonian…
In this article we develop a general theory of exact parametric penalty functions for constrained optimization problems. The main advantage of the method of parametric penalty functions is the fact that a parametric penalty function can be…
The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be…
This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…
The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…
The $n$-vehicle exploration problem (NVEP) is a nonlinear unconstrained optimization problem. Given a fleet of $n$ vehicles with mid-trip refueling technique, the NVEP tries to find a sequence of $n$ vehicles to make one of the vehicles…
Let $\P$ be any collection of paths of a graph $G=(V,E)$. For $S\subseteq V$, define $I(S)=S\cup\{v\mid v \ \mbox{lies in a path of} \ \P \ \mbox{with endpoints in} \ S\}$. Let $\C$ be the collection of fixed points of the function $I$,…
We study the interplay between the regularity of paths and Hamiltonians in the theory of pathwise Hamilton-Jacobi equations with the use of interpolation methods. The regularity of the paths is measured with respect to Sobolev, Besov,…
Given a coercive Hamiltonian which is quasi-convex with respect to the gradient variable and periodic with respect to time and space at least "far away from the origin", we consider the solution of the Cauchy problem of the corresponding…
Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
Methods to determine the existence of Hamiltonian Cycles in graphs have been extensively studied. However, little research has been done following cases when no Hamiltonian Cycle exists. Let a vertex be "unbounded" if it is visited more…
Time Optimal Path Parametrization is the problem of minimizing the time interval during which an actuation constrained agent can traverse a given path. Recently, an efficient linear-time algorithm for solving this problem was proposed.…