Related papers: Fractional Negative Binomial and Polya Processes
It is our intention to provide via fractional calculus a generalization of the pure and compound Poisson processes, which are known to play a fundamental role in renewal theory, without and with reward, respectively. We first recall the…
The method of Fractional Borel Summation is suggested in conjunction with self-similar factor approximants. The method used for extrapolating asymptotic expansions at small variables to large variables, including the variables tending to…
Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial…
We present the Parallel, Forward-Backward with Pruning (PFBP) algorithm for feature selection (FS) in Big Data settings (high dimensionality and/or sample size). To tackle the challenges of Big Data FS PFBP partitions the data matrix both…
We propose two-stage and sequential procedures to estimate the unknown parameter N of a binomial distribution with unknown parameter p, when we reinforce data with an independent sample of a negative-binomial experiment having the same p.
With the development of new remote sensing technology, large or even massive spatial datasets covering the globe become available. Statistical analysis of such data is challenging. This article proposes a semiparametric approach to model…
Copulas are a powerful tool to model dependence between the components of a random vector. One well-known class of copulas when working in two dimensions is the Farlie-GumbelMorgenstern (FGM) copula since their simple analytic shape enables…
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
For a nonnegative integer $p$, we give explicit formulas for the $p$-Frobenius number and the $p$-genus of generalized Fibonacci numerical semigroups. Here, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose…
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…
We consider an array of random variables, taking values in a complete and separable metric space, that exhibits a kind of symmetry which we call row exchangeability. Given such an array, a natural model for Bayesian nonparametric inference…
In this paper, we study a Skellam type variant of the generalized counting process (GCP), namely, the generalized Skellam process. Some of its distributional properties such as the probability mass function, probability generating function,…
The probability of false discovery proportion (FDP) exceeding $\gamma\in[0,1)$, defined as $\gamma$-FDP, has received much attention as a measure of false discoveries in multiple testing. Although this measure has received acceptance due to…
Fractional, anomalous diffusion in space-periodic potentials is investigated. The analytical solution for the effective, fractional diffusion coefficient in an arbitrary periodic potential is obtained in closed form in terms of two…
We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…
We propose a framework for fitting fractional polynomials models as special cases of Bayesian Generalized Nonlinear Models, applying an adapted version of the Genetically Modified Mode Jumping Markov Chain Monte Carlo algorithm. The…
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…
Fractional Brownian motion (fBm) is a ubiquitous diffusion process in which the memory effects of the stochastic transport result in the mean squared particle displacement following a power law, $\langle {\Delta r}^2 \rangle \sim…
In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…