Related papers: Sequential Sampling for CGMY Processes via Decompo…
This paper introduces the Non-homogeneous Generalized Skellam process (NGSP) and its fractional version NGFSP by time changing it with an independent inverse stable subordinator. We study distributional properties for NGSP and NGFSP…
The analysis of the time-frequency content of a signal is a classical problem in signal processing, with a broad number of applications in real life. Many different approaches have been developed over the decades, which provide alternative…
With the growing demand for non-Euclidean data analysis, graph signal processing (GSP) has gained significant attention for its capability to handle complex time-varying data. This paper introduces a novel sampling method based on the joint…
Consider $K$ processes, each generating a sequence of identical and independent random variables. The probability measures of these processes have random parameters that must be estimated. Specifically, they share a parameter $\theta$…
In this paper, we study the fractional Poisson process (FPP) time-changed by an independent L\'evy subordinator and the inverse of the L\'evy subordinator, which we call TCFPP-I and TCFPP-II, respectively. Various distributional properties…
In this article, the problem of semi-parametric inference on the parameters of a multidimensional L\'{e}vy process $L_t$ with independent components based on the low-frequency observations of the corresponding time-changed L\'{e}vy process…
Branching processes are a class of continuous-time Markov chains (CTMCs) with ubiquitous applications. A general difficulty in statistical inference under partially observed CTMC models arises in computing transition probabilities when the…
Parameter estimation for discretely observed Markov processes is a challenging problem. However, simulation of Markov processes is straightforward using the Gillespie algorithm. We exploit this ease of simulation to develop an effective…
Graph Convolutional Networks (GCNs) have achieved impressive empirical advancement across a wide variety of semi-supervised node classification tasks. Despite their great success, training GCNs on large graphs suffers from computational and…
Complex multivariate time series arise in many fields, ranging from computer vision to robotics or medicine. Often we are interested in the independent underlying factors that give rise to the high-dimensional data we are observing. While…
We introduce a non-homogeneous version of the generalized counting process (GCP), namely, the non-homogeneous generalized counting process (NGCP). We time-change the NGCP by an independent inverse stable subordinator to obtain its…
We provide asymptotic results and develop high frequency statistical procedures for time-changed L\'evy processes sampled at random instants. The sampling times are given by first hitting times of symmetric barriers whose distance with…
In order to learn distributed port-Hamiltonian systems (dPHS) using Gaussian processes (GPs), the partitioned finite element method (PFEM) is combined with the Gp-dPHS method. By following a late lumping approach, the discretization of the…
We introduce stochastic variational inference for Gaussian process models. This enables the application of Gaussian process (GP) models to data sets containing millions of data points. We show how GPs can be vari- ationally decomposed to…
Motivated by a large ground-level ozone dataset, we propose a new computationally efficient additive approximate Gaussian process. The proposed method incorporates a computational-complexity-reduction method and a separable covariance…
In this study, we have developed a parallel version of the random time simulation algorithm. Firstly, we gave a rigorous basis of the random time description of the stochastic process of chemical reaction network time evolution. And then we…
In a variety of different settings cumulative sum (CUSUM) procedures have been applied for the sequential detection of structural breaks in the parameters of stochastic models. Yet their performance depends strongly on the time of change…
Imposing some flexible sampling scheme we provide some discretization of continuous time discrete scale invariant (DSI) processes which is a subsidiary discrete time DSI process. Then by introducing some simple random measure we provide a…
In this publication, we combine two Bayesian non-parametric models: the Gaussian Process (GP) and the Dirichlet Process (DP). Our innovation in the GP model is to introduce a variation on the GP prior which enables us to model structured…
We develop a methodology to learn finitely generated random iterated function systems from time-series of partial observations using delay embeddings. We obtain a minimal model representation for the observed dynamics, using a hidden…