The continuous-time triangular Pólya process

We study poissonized triangular (reducible) urns on two colors, which we take to be white and blue. We analyze the number of white and blue balls after a certain period of time has elapsed. We show that for balanced processes in this class, a different scaling is needed for each color to produce nontrivial limits, contrary to the distributions in the usual irreducible urns which only require the same scaling for both colors. The limit distributions (of the scaled variables) underlying triangular urns are Gamma. The technique we use couples partial differential equations with the method of moments applied in a bootstrapped manner to produce exact and asymptotic moments. For the dominant color, we get exact moments, while relaxing the balance condition. The exact moments include alternating signs and Stirling numbers of the second kind.     

Pólya and Newtonian function fields

Let be a finite function field extension and denote by O _K the integral closure of in K. In this article, we are interested in Pólya fields, that is, fields K, such that the O _K -module Int(O _K ) of integer-valued polynomials over O _K admits a regular basis. We show that the cyclotomic extensions of are Pólya fields, and we characterize some totally imaginary extensions which are Pólya fields. Then, we are interested in Pólya fields K which have a regular basis of the form for some sequences of elements of O _K . For totally imaginary extensions, we show that it is the case if and only if O _K is isomorphic to . This gives a answer to a question raised by Thakur. The author thanks his thesis adviser Jean-Luc Chabert, and Mireille Car for their help, and their valuable advices to do this work. The author thanks also the referee for his valuable remarks.     

Pólya convertibility problem for symmetric matrices

We investigate symmetric (0, 1) matrices on which the permanent is convertible to the determinant by assigning ± signs to their entries. In particular, we obtain several quantitative bounds for the number of nonzero elements of such matrices, including the analog of Gibson’s theorem for symmetric matrices.     

Polynomial Ensembles and Pólya Frequency Functions

Journal of Theoretical Probability - We study several kinds of polynomial ensembles of derivative type which we propose to call Pólya ensembles. These ensembles are defined on the spaces of...     

Computational Aspects of Optional Pólya Tree

Optional Pólya tree (OPT) is a flexible nonparametric Bayesian prior for density estimation. Despite its merits, the computation for OPT inference is challenging. In this article, we present time complexity analysis for OPT inference and propose two algorithmic improvements. The first improvement, named limited-lookahead optional Pólya tree (LL-OPT), aims at accelerating the computation for OPT inference. The second improvement modifies the output of OPT or LL-OPT and produces a continuous piecewise linear density estimate. We demonstrate the performance of these two improvements using simulated and real date examples.     

Extensions of the Generalized Pólya Process

Methodology and Computing in Applied Probability - A new self-exciting counting process is here considered, which extends the generalized Pólya process introduced by Cha (Adv Appl Probab...     

Martingale characterization of Pólya processes and sequences

It is proved that a mixed Poisson process ξ_t is a Pólya process if and only if there exists a nondegenerate linear transform ξ_t → η_t = a(t)ξ_t + b(t) such that η_t is a martingale. A similar result is valid for Pólya sequences.     

On the shape of random Pólya structures

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random Pólya trees: a uniform random Pólya tree of size $n$ consists of a conditioned critical Galton–Watson tree $C_n$ and many small forests, where with probability tending to one, as $n$ tends to infinity, any forest $F_n\left(v\right)$, that is attached to a node $v$ in $C_n$, is maximally of size $\left|F_n\left(v\right)\right|=O(logn)$. Their proof used the framework of a Boltzmann sampler and deviation inequalities.In this paper, first, we employ a unified framework in analytic combinatorics to prove this fact with additional improvements for $\left|F_n\left(v\right)\right|$, namely $\left|F_n\left(v\right)\right|=\Theta (logn)$. Second, we give a combinatorial interpretation of the rational weights of these forests and the defining substitution process in terms of automorphisms associated to a given Pólya tree. Third, we derive the limit probability that for a random node $v$ the attached forest $F_n\left(v\right)$ is of a given size. Moreover, structural properties of those forests like the number of their components are studied. Finally, we extend all results to other Pólya structures.     

Type II bivariate Pólya–Aeppli distribution

In this paper, we introduce the Type II bivariate Pólya–Aeppli distribution as a compound Poisson distribution with bivariate geometric compounding distribution. The probability mass function, recursion formulas, conditional distributions and some other properties are then derived for this distribution.     

The arithmetic of the characteristic Pólya functions

In the framework of the theory of D. Kendall's delphic semigroups are considered problems of divisibility in the semigroup of convex characteristic functions on the semiaxis (0,). Letn ()={:₁¦₁1 or ₁=}, and I_o()={: ₁¦ ₁ N()}. The following results are proved: 1) The semigroup is almost delphic in the sense of R. Davidson. 2) N() is a set of the type G which is dense in (in the topology of uniform convergence on compacta). 3) The class I_o() contains only the function identically equal to one.Translated from Matematicheskie Zametki, Vol. 21, No. 5, pp. 717–725, May, 1977.The author thanks I. V. Ostrovskii for the formulation of the problem and valuable remarks.     

Functional Limit Theorems for the Pólya Urn

Journal of Theoretical Probability - For the plain Pólya urn with two colors, black and white, we prove a functional central limit theorem for the number of white balls, assuming that the...     

On a theorem of G. Pólya

f(z), :f(n)=0 (n=0, ±1, ±2, ...). ((n)} L _p ,p>1, .     

Pólya分布在气候统计中的应用

Pólya分布在气候统计中常用来拟合雾、雷暴等.本文给出了Pólya分布总体在全样本场合下参数的矩估计和极大似然估计,并研究了估计的存在性,并通过大量的Monte Carlo模拟说明了估计的精度,认为在样本较大的情形下极大似然估计优于矩估计.最后通过具体的雾与雷暴等气候统计数据说明本文方法的可行性.     

A generalization of the Pólya–Vinogradov inequality

In this paper we consider an approach of Dobrowolski and Williams which leads to a generalization of the Pólya–Vinogradov inequality. We show how the Dobrowolski–Williams approach is related to the classical proof of Pólya–Vinogradov using Fourier analysis. Our results improve upon the earlier work of Bachman and Rachakonda (Ramanujan J. 5:65–71, 2001). In passing, we also obtain sharper explicit versions of the Pólya–Vinogradov inequality.