Mrinal Kanti Roychowdhury

Prof. Mrinal Kanti Roychowdhury

The University of Texas Rio Grande Valley, Edinburg, Texas, USA
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 June 2017 in Journal of Fractal Geometry
Verified
Journal Article
Closed access
PDF file
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury
Quantization of a probability distribution is the process of estimating a given probability by a discrete probability that assumes only a finite number of levels in its support. Centroidal Voronoi tessellations (CVT) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions. In this paper, we investigate the optimal quantization and the centroidal Voronoi tessellations with n generators for a Borel probability measure P on \mathbb R supported by a dyadic Cantor set generated by two self-similar mappings with similarity ratios r , where 0 < r \leq \frac{5-\sqrt{17}}2 .

1 April 2019 in Israel Journal of Mathematics
Verified
Journal Article
Closed access
PDF file
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury

1 December 2018 in Uniform distribution theory
Verified
Journal Article
Open access
PDF file
JRJoseph Rosenblatt
Joseph Rosenblatt
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury
Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite number of points. In this paper, firstly a general approach to this process is outlined using independent random variables and ergodic maps; these give asymptotically the optimal sets of n -means and the n th quantization errors for all positive integers n . Secondly two piecewise uniform distributions are considered on R: one with infinite number of pieces and one with finite number of pieces. For these two probability measures, we describe the optimal sets of n -means and the n th quantization errors for all n ∈ N. It is seen that for a uniform distribution with infinite number of pieces to determine the optimal sets of n -means for n ≥ 2 one needs to know an optimal set of ( n − 1)-means, but for a uniform distribution with finite number of pieces one can directly determine the optimal sets of n -means and the n th quantization errors for all n ∈ N.

1 January 2018 in Discrete and Continuous Dynamical Systems
Verified
Journal Article
Open access
PDF file
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury
The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. Let $P$ be a Borel probability measure on $\mathbb R$ such that $P = \frac 12 P\circ S_1^{-1}+\frac 12 P\circ S_2^{-1},$ where $S_1$ and $S_2$ are two contractive similarity mappings given by $S_1(x) = rx$ and $S_2(x) = rx+1-r$ for $0<r<\frac 12$ and $x∈ \mathbb R$. Then, $P$ is supported on the Cantor set generated by $S_1$ and $S_2$. The case $r = \frac 13$ was treated by Graf and Luschgy who gave an exact formula for the unique optimal quantization of the Cantor distribution $P$ (Math. Nachr., 183 (1997), 113-133). In this paper, we compute the precise range of $r$-values to which Graf-Luschgy formula extends.

23 July 2024 in Journal of Fractal Geometry
Verified
Journal Article
Open access
PDF file
MPMegha Pandey
Megha Pandey
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury
The theory of constrained quantization has been recently introduced by Pandey and Roychowdhury. In this paper, they have further generalized their previous definition of constrained quantization and studied the constrained quantization for the classical Cantor distribution. Toward this, they have calculated the optimal sets of n -points, n th constrained quantization errors, the constrained quantization dimensions, and the constrained quantization coefficients, taking different families of constraints for all n\in \mathbb{N} . The results in this paper show that both the constrained quantization dimension and the constrained quantization coefficient for the Cantor distribution depend on the underlying constraints. It also shows that the constrained quantization coefficient for the Cantor distribution can exist and be equal to the constrained quantization dimension. These facts are not true in the unconstrained quantization for the Cantor distribution.

24 October 2020 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
GPGabriela Pena
Gabriela Pena
HRHansapani Rodrigo
Hansapani Rodrigo
MRMrinal Kanti Roychowdhury
Mrinal Kanti Roychowdhury
JSJosef Sifuentes
Josef Sifuentes
ESErwin Suazo
Erwin Suazo