scispace - formally typeset
P

Palaniappan Vellaisamy

Researcher at Indian Institute of Technology Bombay

Publications -  128
Citations -  1896

Palaniappan Vellaisamy is an academic researcher from Indian Institute of Technology Bombay. The author has contributed to research in topics: Poisson distribution & Negative binomial distribution. The author has an hindex of 19, co-authored 126 publications receiving 1683 citations. Previous affiliations of Palaniappan Vellaisamy include Indian Institutes of Technology & Michigan State University.

Papers
More filters
Journal ArticleDOI

Probabilistic interpretations of nonclassic adomian polynomials

TL;DR: The Adomian decomposition method (ADM) is a powerful tool for solving many nonlinear functional equations and a large class of initial/boundary value problems as discussed by the authors.
Posted Content

Evaluation of missing data mechanisms in two and three dimensional incomplete tables

TL;DR: In this paper, the authors provide characterizations for the various missing mechanisms of a variable in terms of response and non-response odds for two and three dimensional incomplete tables and propose easily verifiable procedures to evaluate the missing at random (MAR), missing completely at random and not missing at Random (NMAR) assumptions of the missing data models.
Posted Content

A Compound Poisson Convergence Theorem for Sums of $m$-Dependent Variables

TL;DR: In this paper, the Simons-Johnson theorem holds for the sum of two Poisson variables defined on different lattices, with exponential weights and a limiting compound Poisson distribution.
Journal ArticleDOI

On martingale characterizations for some generalized space fractional Poisson processes

TL;DR: In this article, the authors obtained martingale characterizations for the generalized space fractional Poisson process (GSFPP) and for counting processes with Bernstein intertimes, which serve as extensions of the Watanabe's characterization for the classical homogenous Poisson processes.

Binomial Approximation to Locally Dependent CDO

TL;DR: Stein’s method for binomial approximation using the stop-loss metric that allows one to obtain a bound on the error term between the expectation of call functions is developed and its bounds are sharper than the existing bounds.