Related papers: An Exact Formulation of the Time-Ordered Exponenti…
A normal ordered exponential parametrization is used to obtain equations for thermal one-and two-particle reduced density matrices, as well as free energies, partition functions and entropy for both Fermionic (electronic) and Bosonic…
We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\subseteq\mathbb{R}^d$, we compute a $(1+\varepsilon)$-factor approximation to $\mathop…
Let $P$ be an irreducible and reversible transition matrix on a finite state space $V$ with invariant distribution $\pi$. We let $k$ chains start by choosing independent locations distributed according to $\pi$ and then they evolve…
We construct a new topology on the space of stopped paths and introduce a calculus for causal functionals on generic domains of this space. We propose a generic approach to pathwise integration without any assumption on the variation index…
This thesis develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time finance, does not rely on stochastic integrals or other probabilistic…
We present a general method to obtain a closed, finite formula for the exponential map from the Lie algebra to the Lie group, for the defining representation of the orthogonal groups. Our method is based on the Hamilton-Cayley theorem and…
We show that the emergence of time evolution in an otherwise timeless nonrelativistic closed quantum system -- viewed as a poor man's model of generally covariant quantum theory -- can be understood from the perspective of the path integral…
This paper will analyze several quadratic-time solvable problems, and will classify them into two classes: problems that are solvable in truly subquadratic time (that is, in time $O(n^{2-\epsilon})$ for some $\epsilon>0$) and problems that…
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…
We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked "in" and "out" vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with…
We present an explicit formula for the characteristic polynomial of the transition matrix of the discrete-time quantum walk on a graph via the second weighted zeta function. As applications, we obtain new proofs for the results on spectra…
There are numerous examples of the so-called ``square root phenomenon'' in the field of parameterized algorithms: many of the most fundamental graph problems, parameterized by some natural parameter $k$, become significantly simpler when…
(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to approximately reverse the application of a transduction,…
An analytical formula for the occurence probability of Markovian stochastic paths with repeatedly visited and/or equal departure rates is derived. This formula is essential for an efficient investigation of the trajectories belonging to…
We consider expressions of the form of an exponential of the sum of two non-commuting operators of a single variable inside a path integration. We show that it is possible to shift one of the non-commuting operators from the exponential to…
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix; namely the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk;…
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best…
Given $\beta>0$ and $\delta>0$, the function $t^{-\beta}$ may be approximated for $t$ in a compact interval $[\delta,T]$ by a sum of terms of the form $we^{-at}$, with parameters $w>0$ and $a>0$. One such an approximation, studied by…
Starting from the canonical formalism of relativistic (timeless) quantum mechanics, the formulation of timeless path integral is rigorously derived. The transition amplitude is reformulated as the sum, or functional integral, over all…
This paper proposes a simple yet highly accurate prediction-correction algorithm, SHARP, for unconstrained time-varying optimization problems. Its prediction is based on an extrapolation derived from the Lagrange interpolation of past…