相关论文: An algebraic approach to Polya processes

Consider a balanced non triangular two-color P\'olya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2<sigma <1. The composition vector of both discrete time…

Assuming that a threshold Ornstein-Uhlenbeck process is observed at discrete time instants, we propose generalized moment estimators to estimate the parameters. Our theoretical basis is the celebrated ergodic theorem. To use this theorem we…

This paper develops an analytic theory for the study of some Polya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al. (2006), which connects deterministic balanced urns to a differential system for the…

Although introduced in the case of Poisson random measures, the lent particle method applies as well in other situations. We study here the case of marked point processes. In this case the Malliavin calculus (here in the sense of Dirichlet…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

Beginning with work of Zeilberger on classical pattern counts, there are a variety of structural results for moments of permutation statistics applied to random permutations. Using tools from representation theory, Gaetz and Ryba…

Gaussian processes models are widely adopted for nonparameteric/semi-parametric modeling. Identifiability issues occur when the mean model contains polynomials with unknown coefficients. Though resulting prediction is unaffected, this leads…

Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…

We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…

In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…

In this paper, we answer a question posed by Kurt Johansson, to find a PDE for the joint distribution of the Airy Process. The latter is a continuous stationary process, describing the motion of the outermost particle of the Dyson Brownian…

We introduce a class of Markov processes, called $m$-polynomial, for which the calculation of (mixed) moments up to order $m$ only requires the computation of matrix exponentials. This class contains affine processes, processes with…

Given an eigenvalue $\lambda$ of the Laplace-Beltrami operator on $n-$spheres or $-$hemispheres, with multiplicity $m$ such that $\lambda=\lambda_{k}=\dots = \lambda_{k+m-1}$, we characterise the lowest and highest orders in the set…

The superposition of two independent point processes can be described by multiplication of their probability generating functionals (p.g.fl.s). The inverse operation, which can be viewed as a deconvolution, is defined by dividing the…

Path-dependent stochastic processes are often non-ergodic and observables can no longer be computed within the ensemble picture. The resulting mathematical difficulties pose severe limits to the analytical understanding of path-dependent…

We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…

A competition process is a continuous time Markov chain that can be interpreted as a system of interacting birth-and-death processes, the components of which evolve subject to a competitive interaction. This paper is devoted to the study of…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

In this paper we provide a complementary set of results to those we present in our companion work \cite{Stojnicl1HidParasymldp} regarding the behavior of the so-called partial $\ell_1$ (a variant of the standard $\ell_1$ heuristic often…

Using complex analysis techniques we obtain precise asymptotic approximations for the kernels corresponding to the symmetric $\alpha$-stable processes and their fractional derivatives. We apply our method to general L\'evy processes whose…