Related papers: Hitting times for special patterns in the symmetri…

The TASEP (totally asymmetric simple exclusion process) is a basic model for an one-dimensional interacting particle system with non-reversible dynamics. Despite the simplicity of the model it shows a very rich and interesting behaviour. In…

Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time $T(\alpha)$ of a set of stationary measure at least $\alpha$ for $\alpha\in(0,1)$. We obtain tight inequalities among the…

The article considers symmetric general linear methods, a class of numerical time integration methods which, like symmetric Runge--Kutta methods, are applicable to general time--reversible differential equations, not just those derived from…

The equidistant subsequence pattern matching problem is considered. Given a pattern string $P$ and a text string $T$, we say that $P$ is an \emph{equidistant subsequence} of $T$ if $P$ is a subsequence of the text such that consecutive…

This paper presents an alternative approach for the computation of trajectory segments on slow manifolds of saddle type. This approach is based on iterative methods rather than collocation-type methods. Compared to collocation methods, that…

Let the costs $C(i,j)$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a non-negative random variable $C$ from a class of distributions that include the uniform $[0,1]$ distribution and the…

Existence and stability properties are studied for Hawkes process, i.e. point process $S$ that has long-memory and intensity $r(t)=\lambda \big(g_0(t)+ \sum_{\tau<t, \tau \in S} h(t-\tau) \big)$. The approach to Hawkes process presented in…

We present a solution for the stationary state of an asymmetric exclusion model with sequential update and open boundary conditions. We solve the model exactly for random hopping in both directions by applying a matrix-product formalism…

Computing $\log\det(A)$ for large symmetric positive definite matrices arises in Gaussian process inference and Bayesian model comparison. Standard methods combine matrix-vector products with polynomial approximations. We study a different…

In this paper, we study the following time-dependent stochastic differential equation (SDE) in ${\bf R}^d$: $$ d X_{t}= \sigma_t(X_{t-}) d Z_t + b_t(X_{t})d t, \quad X_{0}=x\in {\bf R}^d, $$ where $Z$ is a $d$-dimensioanl nondegenerate…

We introduce the headway exclusion process which is an exclusion process with $N$ particles on the one-dimensional discrete torus with $L$ sites with jump rates that depend only on the distance to the next particle in the direction of the…

Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…

Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results…

There exists a simple, didactically useful one-to-one relationship between stopping times and adapted c\`agl\`ad (LCRL) processes that are non-increasing and take the values 0 and 1 only. As a consequence, stopping times are always hitting…

A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…

Given an initial (resp., terminal) probability measure $\mu$ (resp., $\nu$) on $\mathbb{R}^d$, we characterize those optimal stopping times $\tau$ that maximize or minimize the functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$,…

We consider the process $\{x-N(t):t\geq 0\}$, where $x\in\mathbb{R}_+$ and $\{N(t):t\geq 0\}$ is a renewal process with light-tailed distributed holding times. We are interested in the joint distribution of $(\tau(x),A(x))$ where $\tau(x)$…

In this paper, we introduce a targeted exploration strategy for the non-asymptotic, finite-time case. The proposed strategy is applicable to uncertain linear time-invariant systems subject to sub-Gaussian disturbances. As the main result,…

This article is devoted to the construction of numerical methods which remain insensitive to the smallness of the semiclassical parameter for the linear Schr{\"o}dinger equation in the semiclassical limit. We specifically analyse the…

We consider exclusion processes on a rooted $d$-regular tree. We start from a Bernoulli product measure conditioned on having a particle at the root, which we call the tagged particle. For $d\geq 3$, we show that the tagged particle has…