Related papers: An algebraic approach to Polya processes
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
We introduce a class of stochastic processes based on symmetric $\alpha$-stable processes. These are obtained by taking Markov processes and replacing the time parameter with the modulus of a symmetric $\alpha$-stable process. We call them…
It is well known that phase function methods allow for the numerical solution of a large class of oscillatory second order linear ordinary differential equations in time independent of frequency. Unfortunately, these methods break down in…
Despite the relevance of the binomial distribution for probability theory and applied statistical inference, its higher-order moments are poorly understood. The existing formulas are either not general enough, or not structured and…
Motivated by the notion of isotropic $\alpha$-stable L\'evy processes confined, by reflections, to a bounded open Lipschitz set $D\subset \mathbb{R}^d$, we study some related analytical objects. Thus, we construct the corresponding…
A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed…
We describe a procedure to introduce general dependence structures on a set of Dirichlet processes. Dependence can be in one direction to define a time series or in two directions to define spatial dependencies. More directions can also be…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
In this paper we study a generalized class of Maxwell-Boltzmann equations which in addition to the usual collision term contains a linear deformation term described by a matrix A. This class of equations arises, for instance, from the…
We present a technique for reducing the order of polynomial-like iterative equations; in particular, we answer a question asked by Wenmeng Zhang and Weinian Zhang. Our method involves the asymptotic behaviour of the sequence of consecutive…
Using P\'{o}lya's urn model with negative replacement we introduce a new Bernstein-type operator and we show that the new operator improves upon the known estimates for the classical Bernstein operator. We also provide numerical evidence…
We introduce two non-homogeneous processes: a fractional non-homogeneous Poisson process of order $k$ and and a fractional non-homogeneous P\'olya-Aeppli process of order $k$. We characterize these processes by deriving their non-local…
We show that as $n$ changes, the characteristic polynomial of the $n\times n$ random matrix with i.i.d. complex Gaussian entries can be described recursively through a process analogous to P\'olya's urn scheme. As a result, we get a random…
We consider particle systems (also known as point processes) on the line and in the plane, and are particularly interested in "hole" events, when there are no particles in a large disk (or some other domain). We survey the extensive work on…
Stein operators allow to characterise probability distributions via differential operators. Based on these characterisations, we develop a new method of point estimation for marginal parameters of strictly stationary and ergodic processes,…
Modeling binary and categorical data is one of the most commonly encountered tasks of applied statisticians and econometricians. While Bayesian methods in this context have been available for decades now, they often require a high level of…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We consider natural algebraic differential operations acting on geometric quantities over smooth manifolds. We introduce a method of study and classification of such operations, called IT-reduction. It reduces the study of natural…
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…