Related papers: Solving linear-rate ODE hierarchies (like master e…
We give new constructions of two classes of algebraic code families which are efficiently list decodable with small output list size from a fraction $1-R-\epsilon$ of adversarial errors where $R$ is the rate of the code, for any desired…
This paper is part of a series of papers in which the asymptotic theory and appropriate symbolic computer code are developed to compute the asymptotic expansion of the solution of an n-th order ordinary differential equation. The paper…
Spatiotemporal forecasting in physical systems, such as large-scale traffic networks, requires modeling a dual dynamic: continuous macroscopic rhythms and discrete, unpredictable microscopic shocks. While Neural Ordinary Differential…
We define various higher-order Markov properties for stochastic processes $(X(t))_{t\in \mathbb{T}}$, indexed by an interval $\mathbb{T} \subseteq \mathbb{R}$ and taking values in a real and separable Hilbert space $U$. We furthermore…
A recently-introduced class of probabilistic (uncertainty-aware) solvers for ordinary differential equations (ODEs) applies Gaussian (Kalman) filtering to initial value problems. These methods model the true solution $x$ and its first $q$…
A Taylor method for solving an ordinary differential equation initial-value problem $\dot x = f(t,x)$, $x(t_0) = x_0$, computes the Taylor series (TS) of the solution at the current point, truncated to some order, and then advances to the…
Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…
We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on $H$-minor free graphs. In particular, we obtain the following results (where $k$ is the solution-size parameter). 1.…
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the…
In this paper we consider (upward skip-free) discrete-time and discrete-space Markov additive chains (MACs) and develop the theory for the so-called $\tilde{W}$ and $\tilde{Z}$ scale matrices. which are shown to play a vital role in the…
A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding…
Linear rate equations are used to describe the cascading decay of an initial heavy cluster into fragments. This representation is based upon a triangular matrix of transition rates. We expand the state vector of mass multiplicities, which…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
The paper concerns the $d$-dimensional stochastic approximation recursion, $$ \theta_{n+1}= \theta_n + \alpha_{n + 1} f(\theta_n, \Phi_{n+1}) $$ where $ \{ \Phi_n \}$ is a stochastic process on a general state space, satisfying a…
We study branching processes of independently splitting particles in the continuous time setting. If time is calibrated such that particles live on average one unit of time, the corresponding transition rates are fully determined by the…
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n vertices and k crossings, where k is smaller than n by an…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…
This article treats both discrete time and continuous time stopping problems for general Markov processes on the real line with general linear costs. Using an auxiliary function of maximum representation type, conditions are given to…
Inspired by biological dynamics, we consider a growth Markov process taking values on the space of rooted binary trees, similar to the Aldous-Shields model. Fix $n\ge 1$ and $\beta>0$. We start at time 0 with the tree composed of a root…