Jordan M. Stoyanov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jordan M. Stoyanov has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Gwo Dong Lin
Institute of Statistical Science Academia Sinica 11529 Taipei Taiwan (ROC
6 shared publications - Aldo Tagliani
Department of Economics and Management, University of Trento, 38122 Trento, Italy
2 shared publications - Christophe Vignat
Department of Mathematics, Tulane University, New Orleans, USA
2 shared publications - Pier Luigi Novi Inverardi
University of Trento (Italy)
2 shared publications Anirban DasGupta
1 shared publication- Chengfu Wei
Zhongtai Securities Institute for Financial Studies Shandong University 250100 Jinan Shandong China
1 shared publication
Latest Publications
- Open Access
- 19 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2671
New Sufficient Conditions for Moment Determinacy via Probability Density Tails
One of the ways to characterize a probability distribution is to show that it is moment-determinate, uniquely determined by knowing all its moments. The uniqueness, in the absolutely continuous case, depends entirely on the behaviour of the tails of the probability density function f. We find and exploit a condition, (D), in terms only of f which is of a ‘general’ form and easy to check. Condition (D), showing the ‘speed’ for f to tend to zero, is sufficient to conclude the moment determinacy. We establish a series of theorems and corollaries in both Stieltjes and Hamburger cases and provide an interesting illustrative example. The results in this paper are either new or extend some recently published results.
- 19 August 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (16) , 2671
Open AccessNew Sufficient Conditions for Moment Determinacy via Probability Density Tails
One of the ways to characterize a probability distribution is to show that it is moment-determinate, uniquely determined by knowing all its moments. The uniqueness, in the absolutely continuous case, depends entirely on the behaviour of the tails of the probability density function f. We find and exploit a condition, (D), in terms only of f which is of a ‘general’ form and easy to check. Condition (D), showing the ‘speed’ for f to tend to zero, is sufficient to conclude the moment determinacy. We establish a series of theorems and corollaries in both Stieltjes and Hamburger cases and provide an interesting illustrative example. The results in this paper are either new or extend some recently published results.
- Open Access
Improved Catoni-Type Confidence Sequences for Estimating the Mean When the Variance Is Infinite
We consider a discrete time stochastic model with infinite variance and study the mean estimation problem as in Wang and Ramdas (2023). We refine the Catoni-type confidence sequence (abbr. CS) and use an idea of Bhatt et al. (2022) to achieve notable improvements of some currently existing results for such model. Specifically, for given $α\in (0, 1]$, we assume that there is a known upper bound $ν_α > 0$ for the $(1 + α)$-th central moment of the population distribution that the sample follows. Our findings replicate and `optimize' results in the above references for $α= 1$ (i.e., in models with finite variance) and enhance the results for $α< 1$. Furthermore, by employing the stitching method, we derive an upper bound on the width of the CS as $\mathcal{O} \left(((\log \log t)/t)^{\fracα{1+α}}\right)$ for the shrinking rate as $t$ increases, and $\mathcal{O}(\left(\log (1/δ)\right)^{\frac{α}{1+α}})$ for the growth rate as $δ$ decreases. These bounds are improving upon the bounds found in Wang and Ramdas (2023). Our theoretical results are illustrated by results from a series of simulation experiments. Comparing the performance of our improved $α$-Catoni-type CS with the bound in the above cited paper indicates that our CS achieves tighter width.Open AccessImproved Catoni-Type Confidence Sequences for Estimating the Mean When the Variance Is Infinite
We consider a discrete time stochastic model with infinite variance and study the mean estimation problem as in Wang and Ramdas (2023). We refine the Catoni-type confidence sequence (abbr. CS) and use an idea of Bhatt et al. (2022) to achieve notable improvements of some currently existing results for such model. Specifically, for given $α\in (0, 1]$, we assume that there is a known upper bound $ν_α > 0$ for the $(1 + α)$-th central moment of the population distribution that the sample follows. Our findings replicate and `optimize' results in the above references for $α= 1$ (i.e., in models with finite variance) and enhance the results for $α< 1$. Furthermore, by employing the stitching method, we derive an upper bound on the width of the CS as $\mathcal{O} \left(((\log \log t)/t)^{\fracα{1+α}}\right)$ for the shrinking rate as $t$ increases, and $\mathcal{O}(\left(\log (1/δ)\right)^{\frac{α}{1+α}})$ for the growth rate as $δ$ decreases. These bounds are improving upon the bounds found in Wang and Ramdas (2023). Our theoretical results are illustrated by results from a series of simulation experiments. Comparing the performance of our improved $α$-Catoni-type CS with the bound in the above cited paper indicates that our CS achieves tighter width. - Open Access
- 16 March 2024
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 53, 180-197
Kolmogorov, stochastics in Bulgaria, and probabilistic problems with unexpected solutions
In this talk, I am going to share with the readers my memories of personal meetings with Andrey Nikolaevich Kolmogorov (1903–1987), the content of our conversations, and the fruitful consequences. The reader is familiar with, or could read, the timely prepared recent comprehensive paper [34], presented by N.M. Yanev at the 52nd Spring Conference of the UBM. Included here are several new details about Andrey Nikolaevich and the great influence of the Moscow Probability School on the development of Stochastics in Bulgaria. I have used MathSciNet and introduced the ‘Kolmogorov number’, a ‘collaboration distance’ between a mathematician and Kolmogorov, with a focus on Bulgarian stochasticians. I am writing about Kolmogorov’s approach to doing mathematics in general and the role of counterexamples. Discussed are two specific probabilistic problems which, according to him, are with most unusual solutions, ‘Skitovich-Darmois theorem’ and ‘Plackett problem’. Several related short stories and not well-known facts are presented.
- 16 March 2024
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 53, 180-197
Open AccessKolmogorov, stochastics in Bulgaria, and probabilistic problems with unexpected solutions
In this talk, I am going to share with the readers my memories of personal meetings with Andrey Nikolaevich Kolmogorov (1903–1987), the content of our conversations, and the fruitful consequences. The reader is familiar with, or could read, the timely prepared recent comprehensive paper [34], presented by N.M. Yanev at the 52nd Spring Conference of the UBM. Included here are several new details about Andrey Nikolaevich and the great influence of the Moscow Probability School on the development of Stochastics in Bulgaria. I have used MathSciNet and introduced the ‘Kolmogorov number’, a ‘collaboration distance’ between a mathematician and Kolmogorov, with a focus on Bulgarian stochasticians. I am writing about Kolmogorov’s approach to doing mathematics in general and the role of counterexamples. Discussed are two specific probabilistic problems which, according to him, are with most unusual solutions, ‘Skitovich-Darmois theorem’ and ‘Plackett problem’. Several related short stories and not well-known facts are presented.
- Open Access
Maximum Entropy Criterion for Moment Indeterminacy of Probability Densities
We deal with absolutely continuous probability distributions with finite all-positive integer-order moments. It is well known that any such distribution is either uniquely determined by its moments (M-determinate), or it is non-unique (M-indeterminate). In this paper, we follow the maximum entropy approach and establish a new criterion for the M-indeterminacy of distributions on the positive half-line (Stieltjes case). Useful corollaries are derived for M-indeterminate distributions on the whole real line (Hamburger case). We show how the maximum entropy is related to the symmetry property and the M-indeterminacy.
Open AccessMaximum Entropy Criterion for Moment Indeterminacy of Probability Densities
We deal with absolutely continuous probability distributions with finite all-positive integer-order moments. It is well known that any such distribution is either uniquely determined by its moments (M-determinate), or it is non-unique (M-indeterminate). In this paper, we follow the maximum entropy approach and establish a new criterion for the M-indeterminacy of distributions on the positive half-line (Stieltjes case). Useful corollaries are derived for M-indeterminate distributions on the whole real line (Hamburger case). We show how the maximum entropy is related to the symmetry property and the M-indeterminacy.
- Open Access
The Problem of Moments: A Bunch of Classical Results with Some Novelties
We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger’s results a century ago and ending with the great progress made only in recent times by C. Berg and collaborators. We describe here known results containing necessary and sufficient conditions for moment (in)determinacy in both Hamburger and Stieltjes moment problems. In our exposition, we follow an approach different from that commonly used. There are novelties well complementing the existing theory. Among them are: (a) to emphasize on the geometric interpretation of the indeterminacy conditions; (b) to exploit fine properties of the eigenvalues of perturbed symmetric matrices allowing to derive new lower bounds for the smallest eigenvalues of Hankel matrices (these bounds are used for concluding indeterminacy); (c) to provide new arguments to confirm classical results; (d) to give new numerical illustrations involving commonly used probability distributions.
Open AccessThe Problem of Moments: A Bunch of Classical Results with Some Novelties
We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger’s results a century ago and ending with the great progress made only in recent times by C. Berg and collaborators. We describe here known results containing necessary and sufficient conditions for moment (in)determinacy in both Hamburger and Stieltjes moment problems. In our exposition, we follow an approach different from that commonly used. There are novelties well complementing the existing theory. Among them are: (a) to emphasize on the geometric interpretation of the indeterminacy conditions; (b) to exploit fine properties of the eigenvalues of perturbed symmetric matrices allowing to derive new lower bounds for the smallest eigenvalues of Hankel matrices (these bounds are used for concluding indeterminacy); (c) to provide new arguments to confirm classical results; (d) to give new numerical illustrations involving commonly used probability distributions.
- Open Access
- 29 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 271
Characterization of Probability Distributions via Functional Equations of Power-Mixture Type
We study power-mixture type functional equations in terms of Laplace–Stieltjes transforms of probability distributions on the right half-line These equations arise when studying distributional equations of the type , where the random variable has known distribution, while the distribution of the random variable is a transformation of that of , and we want to find the distribution of X. We provide necessary and sufficient conditions for such functional equations to have unique solutions. The uniqueness is equivalent to a characterization property of a probability distribution. We present results that are either new or extend and improve previous results about functional equations of compound-exponential and compound-Poisson types. In particular, we give another affirmative answer to a question posed by J. Pitman and M. Yor in 2003. We provide explicit illustrative examples and deal with related topics.- 29 January 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (3) , 271
Open AccessCharacterization of Probability Distributions via Functional Equations of Power-Mixture Type
We study power-mixture type functional equations in terms of Laplace–Stieltjes transforms of probability distributions on the right half-line These equations arise when studying distributional equations of the type , where the random variable has known distribution, while the distribution of the random variable is a transformation of that of , and we want to find the distribution of X. We provide necessary and sufficient conditions for such functional equations to have unique solutions. The uniqueness is equivalent to a characterization property of a probability distribution. We present results that are either new or extend and improve previous results about functional equations of compound-exponential and compound-Poisson types. In particular, we give another affirmative answer to a question posed by J. Pitman and M. Yor in 2003. We provide explicit illustrative examples and deal with related topics. - Open Access
New Checkable Conditions for Moment Determinacy of Probability Distributions
We have analyzed some conditions which are essentially involved in deciding whether or not a probability distribution is unique (moment-determinate) or non-unique (moment-indeterminate) by its moments. We suggest new conditions concerning both absolutely continuous and discrete distributions. By using the new conditions, which are easily checkable, we either establish new results, or extend previous ones in both Hamburger case (distributions on the whole real line) and Stieltjes case (distributions on the positive half-line). Specific examples illustrate both the results and the relationship between the new conditions and previously available conditions.
Open AccessNew Checkable Conditions for Moment Determinacy of Probability Distributions
We have analyzed some conditions which are essentially involved in deciding whether or not a probability distribution is unique (moment-determinate) or non-unique (moment-indeterminate) by its moments. We suggest new conditions concerning both absolutely continuous and discrete distributions. By using the new conditions, which are easily checkable, we either establish new results, or extend previous ones in both Hamburger case (distributions on the whole real line) and Stieltjes case (distributions on the positive half-line). Specific examples illustrate both the results and the relationship between the new conditions and previously available conditions.
- 6 January 2020
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 148 (4) , 1791-1804
Nonconventional limits of random sequences related to partitions of integers
- 6 January 2020
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 148 (4) , 1791-1804
Nonconventional limits of random sequences related to partitions of integers
- Open Access
On conditions under which a probability distribution is uniquely determined by its moments
We study the relationship between the well-known Carleman's condition guaranteeing that a probability distribution is uniquely determined by its moments, and a recent easily checkable condition on the rate of growth of the moments. We use asymptotic methods in theory of integrals and involve properties of the Lambert $W$-function to show that the quadratic rate of growth of the ratios of consecutive moments, as a sufficient condition for uniqueness, is more restrictive than Carleman's condition. We derive a series of statements, one of them showing that Carleman's condition does not imply Hardy's condition, although the inverse implication is true. Related topics are also discussed.
Open AccessOn conditions under which a probability distribution is uniquely determined by its moments
We study the relationship between the well-known Carleman's condition guaranteeing that a probability distribution is uniquely determined by its moments, and a recent easily checkable condition on the rate of growth of the moments. We use asymptotic methods in theory of integrals and involve properties of the Lambert $W$-function to show that the quadratic rate of growth of the ratios of consecutive moments, as a sufficient condition for uniqueness, is more restrictive than Carleman's condition. We derive a series of statements, one of them showing that Carleman's condition does not imply Hardy's condition, although the inverse implication is true. Related topics are also discussed.
- Open Access
Non-Conventional Limits of Random Sequences Related to Partitions of Integers
We deal with a sequence of integer-valued random variables $\{Z_N\}_{N=1}^{\infty}$ which is related to restricted partitions of positive integers. We observe that $Z_N=X_1+ \ldots + X_N$ for independent and bounded random variables $X_j$'s, so $Z_N$ has finite mean ${\bf E}Z_N$ and variance ${\bf Var}Z_N$. We want to find the limit distribution of ${\hat Z}_N=\left(Z_N-{\bf E}Z_N\right)/{\sqrt{{\bf Var}Z_N}}$ as $N \to \infty.$ While in many cases the limit distribution is normal, the main results established in this paper are that ${\hat Z}_N \overset{d}{\to} Z_{*},$ where $Z_{*}$ is a bounded random variable. We find explicitly the range of values of $Z_*$ and derive some properties of its distribution. The main tools used are moment generating functions, cumulant generating functions, moments and cumulants of the random variables involved. Useful related topics are also discussed.Open AccessNon-Conventional Limits of Random Sequences Related to Partitions of Integers
We deal with a sequence of integer-valued random variables $\{Z_N\}_{N=1}^{\infty}$ which is related to restricted partitions of positive integers. We observe that $Z_N=X_1+ \ldots + X_N$ for independent and bounded random variables $X_j$'s, so $Z_N$ has finite mean ${\bf E}Z_N$ and variance ${\bf Var}Z_N$. We want to find the limit distribution of ${\hat Z}_N=\left(Z_N-{\bf E}Z_N\right)/{\sqrt{{\bf Var}Z_N}}$ as $N \to \infty.$ While in many cases the limit distribution is normal, the main results established in this paper are that ${\hat Z}_N \overset{d}{\to} Z_{*},$ where $Z_{*}$ is a bounded random variable. We find explicitly the range of values of $Z_*$ and derive some properties of its distribution. The main tools used are moment generating functions, cumulant generating functions, moments and cumulants of the random variables involved. Useful related topics are also discussed.