Related papers: Chaos representations for Marked Point Processes
We aim to link random fields and marked point processes and therefore introduce a new class of stochastic processes which are defined on a random set in R^d. Unlike for random fields, the mark covariance function of a marked random set is…
We introduce and study a multiparameter Poisson process (MPP). In a particular case, it is observed that the MPP has a unique representation. Its subordination with the multivariate subordinator and inverse subordinator are studied in…
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…
The paper is devoted to the integral functionals $\int_0^\infty f(X_t)\,{\mathrm{d}t}$ of Markov processes in $\X$ in the case $d\ge 3$. It is established that such functionals can be presented as the integrals $\int_{\X} f(y) \G(x,…
We propose a multiplicative semiparametric model for the intensity function of replicated point processes. Two examples of applications are given: a temporal one, about the dynamics of Internet auctions, and a spatial one, about the spatial…
The process tensor provides a general representation of a quantum system evolving under repeated interventions and is fundamental for numerical simulations of local many-body dynamics. In this work, we introduce the projected process…
A point process on a space is a random bag of elements of that space. In this paper we explore programming with point processes in a monadic style. To this end we identify point processes on a space X with probability measures of bags of…
The machine learning community has recently put effort into quantized or low-precision arithmetics to scale large models. This paper proposes performing probabilistic inference in the quantized, discrete parameter space created by these…
Given $n>0$, let $S\subset [0,1]^2$ be a set of $n$ points, chosen uniformly at random. Let $R\cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is included in $R$ uniformly at random with probability $1/2$.…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
Filtering and smoothing with a generalised representation of uncertainty is considered. Here, uncertainty is represented using a class of outer measures. It is shown how this representation of uncertainty can be propagated using…
A characterization of mixed Poisson processes in terms of disintegrations is proven. As a consequence some further characterizations of such processes via claim interarrival processes, martingales and claim measures are obtained. Some…
Predictive constructions are a powerful way of characterizing the probability law of stochastic processes with certain forms of invariance, such as exchangeability or Markov exchangeability. When de Finetti-like representation theorems are…
We consider exchangeable Markov multi-state survival processes -- temporal processes taking values over a state-space$\mathcal{S}$ with at least one absorbing failure state $\flat \in \mathcal{S}$ that satisfy natural invariance properties…
In this paper, we consider a type of time-changed Markov process, where the time-change is an inverse killed subordinator. This can be seen as an extension of Chen (Chen, Z., Time fractional equations and probabilistic representation, Chaos…
Compound random measures (CoRM's) are a flexible and tractable framework for vectors of completely random measure. In this paper, we provide conditions to guarantee the existence of a CoRM. Furthermore, we prove some interesting properties…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
In this paper we consider the problem of computing the stationary distribution of nearly completely decomposable Markov processes, a well-established area in the classical theory of Markov processes with broad applications in the design,…
We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of…