Related papers: An Exact Formulation of the Time-Ordered Exponenti…
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter $\alpha>1$, and the goal is to design an $\alpha$-approximation algorithm with the…
In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…
In this paper, we provide faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape…
The time-ordered exponential of a time-dependent matrix $\mathsf{A}(t)$ is defined as the function of $\mathsf{A}(t)$ that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in…
We study the hop-constrained s-t path enumeration (HcPE) problem, which takes a graph $G$, two distinct vertices $s,t$ and a hop constraint $k$ as input, and outputs all paths from $s$ to $t$ whose length is at most $k$. The…
A general approach is presented that offers exact analytical solutions for the time-evolution of quantum spin systems during parametric waveforms of arbitrary functions of time. The proposed method utilises the \emph{path-sum} method that…
The time-evolving matrix product operator (TEMPO) method is a powerful tool for simulating open system quantum dynamics. Typically, it is used in problems with diagonal system-bath coupling, where analytical expressions for discretized…
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman problem (TSP) is developed. We then define the so-called…
In this paper, we study the variable-order (VO) time-fractional diffusion equations. For a VO function $\alpha(t)\in(0,1)$, we develop an exponential-sum-approximation (ESA) technique to approach the VO Caputo fractional derivative. The ESA…
Suitable discretizations through tensor product formulas of popular multidimensional operators (diffusion or diffusion--advection, for instance) lead to matrices with $d$-dimensional Kronecker sum structure. For evolutionary Partial…
We give algorithms with running time $2^{O({\sqrt{k}\log{k}})} \cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices,…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
Considered a pair of random lifetimes whose dependence is described by a Time Transformed Exponential model, we provide analytical expressions for the distribution of their sum. These expressions are obtained by using a representation of…
The tracer equations are part of the primitive equations used in ocean modeling and describe the transport of tracers, such as temperature, salinity or chemicals, in the ocean. Depending on the number of tracers considered, several…
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that…
Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but edge sets changing over time. Taking into…
This note provides a factorization of a L\'evy pocess over a phase-type horizon $\tau$ given the phase at the supremum, thereby extending the Wiener-Hopf factorization for $\tau$ exponential. One of the factors is defined using time…
This paper addresses differential inference in time-varying parametric probabilistic models, like graphical models with changing structures. Instead of estimating a high-dimensional model at each time point and estimating changes later, we…
In this paper, we present a complete proof of the construction of graphs with bounded valency such that the simple random walk has a return probability at time $n$ at the origin of order $exp(-n^{\alpha}),$ for fixed $\alpha \in [0,1[$ and…
Time-Dependent Constrained Path Optimization (TD-CPO) takes the following input: (i) time-dependent (TD) road network, (ii) source ($s$), (iii) destination ($d$), (iv) departure time ($t$) and, (v) budget ($\mathcal{B}$). In TD graph, each…