Related papers: Likelihood theory for the Graph Ornstein-Uhlenbeck…
This paper proposes a novel exact maximum likelihood (ML) estimation method for general Gaussian processes, where all parameters are estimated jointly. The exact ML estimator (MLE) is consistent and asymptotically normally distributed. We…
We address the issue of recovering the structure of large sparse directed acyclic graphs from noisy observations of the system. We propose a novel procedure based on a specific formulation of the l1-norm regularized maximum likelihood,…
In this work, we consider, in a general setting, multiparameter multidimensional Markov processes that are time-changed by an independent additive subordinator. By extending Phillips theorem, we show that the resulting process is a Feller…
Ornstein-Uhlenbeck process of bounded variation is introduced as a solution of an analogue of the Langevin equation with an integrated telegraph process replacing a Brownian motion. There is an interval $I$ such that the process starting…
We consider the Ornstein-Uhlenbeck (OU) process, a stochastic process widely used in finance, physics, and biology. Parameter estimation of the OU process is a challenging problem. Thus, we review traditional tracking methods and compare…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
We propose a parsimonious stochastic model for characterising the distributional and temporal properties of rainfall. The model is based on an integrated Ornstein-Uhlenbeck process driven by the Hougaard L\'evy process. We derive properties…
Many real-world systems, such as moving planets, can be considered as multi-agent dynamic systems, where objects interact with each other and co-evolve along with the time. Such dynamics is usually difficult to capture, and understanding…
Fractional Ornstein-Uhlenbeck process of the second kind $(\text{fOU}_{2})$ is solution of the Langevin equation $\mathrm{d}X_t = -\theta X_t\,\mathrm{d}t+\mathrm{d}Y_t^{(1)}, \ \theta >0$ with Gaussian driving noise $ Y_t^{(1)} := \int^t_0…
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…
The Ornstein-Uhlenbeck process can be seen as a paradigm of a finite-variance and statistically stationary rough random walk. Furthermore, it is defined as the unique solution of a Markovian stochastic dynamics and shares the same local…
Probabilistic graphical models (PGMs) provide a compact and flexible framework to model very complex real-life phenomena. They combine the probability theory which deals with uncertainty and logical structure represented by a graph which…
Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous,…
Formation mechanisms are fundamental to the study of complex networks, but learning them from observations is challenging. In real-world domains, one often has access only to the final constructed graph, instead of the full construction…
We develop efficient methods for simulating processes of Ornstein-Uhlenbeck type related to the class of $p$-tempered $\alpha$-stable ($\ts$) distributions. Our results hold for both the univariate and multivariate cases and we consider…
Distributional properties -including Laplace transforms- of integrals of Markov processes received a lot of attention in the literature. In this paper, we complete existing results in several ways. First, we provide the analytical solution…
We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…
We are interested in the law of the first passage time of an Ornstein-Uhlenbeck process to time-varying thresholds. We show that this problem is connected to the laws of the first passage time of the process to members of a two-parameter…
Moving average processes driven by exponential-tailed L\'evy noise are important extensions of their Gaussian counterparts in order to capture deviations from Gaussianity, more flexible dependence structures, and sample paths with jumps.…
The Ornstein-Uhlenbeck (OU) process plays a major role in the analysis of the evolution of phenotypic traits along phylogenies. The standard OU process includes drift and stabilizing selection and assumes that species evolve independently.…