Jialin Zhang
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
Research Subjects
Jialin Zhang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jingyi Shi
Department of Mathematics and Statistics, Mississippi State University, Starkville, MS, USA
4 shared publications - Zhiyi Zhang
Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223, USA
3 shared publications - Chen Chen
Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, North Carolina, USA
2 shared publications - Amanda G. Conrad
Department of Food Science, Nutrition, and Health Promotion, Mississippi State University, Starkville, Mississippi, USA
1 shared publication - Ann Stewart
Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223, USA
1 shared publication Chen Chen
Department of Mathematics and Statistics, University of North Carolina at Charlotte, Charlotte, NC 28223, USA
1 shared publication
Latest Publications
- 2 September 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (3) , 89
Turing–Entropic Tail Classification: A Nonparametric Approach to Tail Inference
- 2 September 2026
- Published by Springer Nature in Methodology and Computing in Applied Probability
- Vol. 28 (3) , 89
Turing–Entropic Tail Classification: A Nonparametric Approach to Tail Inference
- 27 July 2026
- Published by Taylor & Francis in Journal of Applied Statistics
- p. 1-29
Confidence intervals using Turing's estimator: simulations and applications
1. Estimating the probability of unseen or rarely observed outcomes is an important problem in statistics, with applications ranging from linguistics and ecology to natural language processing and ...
- 27 July 2026
- Published by Taylor & Francis in Journal of Applied Statistics
- p. 1-29
Confidence intervals using Turing's estimator: simulations and applications
1. Estimating the probability of unseen or rarely observed outcomes is an important problem in statistics, with applications ranging from linguistics and ecology to natural language processing and ...
- Open Access
Necessary and Sufficient Conditions for Characterizing Finite Discrete Distributions with Generalized Shannon's Entropy
This article establishes necessary and sufficient conditions under which a finite set of Generalized Shannon's Entropy (GSE) characterizes a finite discrete distribution up to permutation. For an alphabet of cardinality K, it is shown that K-1 distinct positive real orders of GSE are sufficient (and necessary if no multiplicity) to identify the distribution up to permutation. When the distribution has a known multiplicity structure with s distinct values, s-1 orders are sufficient and necessary. These results provide a label-invariant foundation for inference on unordered sample spaces and enable practical goodness-of-fit procedures across disparate alphabets. The findings also suggest new approaches for testing, estimation, and model comparison in settings where moment-based and link-based methods are inadequate.
Open AccessNecessary and Sufficient Conditions for Characterizing Finite Discrete Distributions with Generalized Shannon's Entropy
This article establishes necessary and sufficient conditions under which a finite set of Generalized Shannon's Entropy (GSE) characterizes a finite discrete distribution up to permutation. For an alphabet of cardinality K, it is shown that K-1 distinct positive real orders of GSE are sufficient (and necessary if no multiplicity) to identify the distribution up to permutation. When the distribution has a known multiplicity structure with s distinct values, s-1 orders are sufficient and necessary. These results provide a label-invariant foundation for inference on unordered sample spaces and enable practical goodness-of-fit procedures across disparate alphabets. The findings also suggest new approaches for testing, estimation, and model comparison in settings where moment-based and link-based methods are inadequate.
- Open Access
Confidence Intervals Using Turing's Estimator: Simulations and Applications
Turing's estimator allows one to estimate the probabilities of outcomes that either do not appear or only rarely appear in a given random sample. We perform a simulation study to understand the finite sample performance of several related confidence intervals (CIs) and introduce an approach for selecting the appropriate CI for a given sample. We give an application to the problem of authorship attribution and apply it to a dataset comprised of tweets from users on X (Twitter). Further, we derive several theoretical results about asymptotic normality and asymptotic Poissonity of Turing's estimator for two important discrete distributions.
Open AccessConfidence Intervals Using Turing's Estimator: Simulations and Applications
Turing's estimator allows one to estimate the probabilities of outcomes that either do not appear or only rarely appear in a given random sample. We perform a simulation study to understand the finite sample performance of several related confidence intervals (CIs) and introduce an approach for selecting the appropriate CI for a given sample. We give an application to the problem of authorship attribution and apply it to a dataset comprised of tweets from users on X (Twitter). Further, we derive several theoretical results about asymptotic normality and asymptotic Poissonity of Turing's estimator for two important discrete distributions.
- 22 March 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 210
A normal test for independence via generalized mutual information
- 22 March 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 210
A normal test for independence via generalized mutual information
- 1 February 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 208
Nonparametric clustering of discrete probability distributions with generalized Shannon’s entropy and heatmap
- 1 February 2024
- Published by Elsevier in Statistics & Probability Letters
- Vol. 208
Nonparametric clustering of discrete probability distributions with generalized Shannon’s entropy and heatmap
- Open Access
- 30 September 2022
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 4 (4) , 865-887
Entropic Statistics: Concept, Estimation, and Application in Machine Learning and Knowledge Extraction
The demands for machine learning and knowledge extraction methods have been booming due to the unprecedented surge in data volume and data quality. Nevertheless, challenges arise amid the emerging data complexity as significant chunks of information and knowledge lie within the non-ordinal realm of data. To address the challenges, researchers developed considerable machine learning and knowledge extraction methods regarding various domain-specific challenges. To characterize and extract information from non-ordinal data, all the developed methods pointed to the subject of Information Theory, established following Shannon’s landmark paper in 1948. This article reviews recent developments in entropic statistics, including estimation of Shannon’s entropy and its functionals (such as mutual information and Kullback–Leibler divergence), concepts of entropic basis, generalized Shannon’s entropy (and its functionals), and their estimations and potential applications in machine learning and knowledge extraction. With the knowledge of recent development in entropic statistics, researchers can customize existing machine learning and knowledge extraction methods for better performance or develop new approaches to address emerging domain-specific challenges.
- 30 September 2022
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 4 (4) , 865-887
Open AccessEntropic Statistics: Concept, Estimation, and Application in Machine Learning and Knowledge Extraction
The demands for machine learning and knowledge extraction methods have been booming due to the unprecedented surge in data volume and data quality. Nevertheless, challenges arise amid the emerging data complexity as significant chunks of information and knowledge lie within the non-ordinal realm of data. To address the challenges, researchers developed considerable machine learning and knowledge extraction methods regarding various domain-specific challenges. To characterize and extract information from non-ordinal data, all the developed methods pointed to the subject of Information Theory, established following Shannon’s landmark paper in 1948. This article reviews recent developments in entropic statistics, including estimation of Shannon’s entropy and its functionals (such as mutual information and Kullback–Leibler divergence), concepts of entropic basis, generalized Shannon’s entropy (and its functionals), and their estimations and potential applications in machine learning and knowledge extraction. With the knowledge of recent development in entropic statistics, researchers can customize existing machine learning and knowledge extraction methods for better performance or develop new approaches to address emerging domain-specific challenges.
- Open Access
Asymptotic Normality for Plug-In Estimators of Generalized Shannon’s Entropy
Shannon’s entropy is one of the building blocks of information theory and an essential aspect of Machine Learning (ML) methods (e.g., Random Forests). Yet, it is only finitely defined for distributions with fast decaying tails on a countable alphabet. The unboundedness of Shannon’s entropy over the general class of all distributions on an alphabet prevents its potential utility from being fully realized. To fill the void in the foundation of information theory, Zhang (2020) proposed generalized Shannon’s entropy, which is finitely defined everywhere. The plug-in estimator, adopted in almost all entropy-based ML method packages, is one of the most popular approaches to estimating Shannon’s entropy. The asymptotic distribution for Shannon’s entropy’s plug-in estimator was well studied in the existing literature. This paper studies the asymptotic properties for the plug-in estimator of generalized Shannon’s entropy on countable alphabets. The developed asymptotic properties require no assumptions on the original distribution. The proposed asymptotic properties allow for interval estimation and statistical tests with generalized Shannon’s entropy.
Open AccessAsymptotic Normality for Plug-In Estimators of Generalized Shannon’s Entropy
Shannon’s entropy is one of the building blocks of information theory and an essential aspect of Machine Learning (ML) methods (e.g., Random Forests). Yet, it is only finitely defined for distributions with fast decaying tails on a countable alphabet. The unboundedness of Shannon’s entropy over the general class of all distributions on an alphabet prevents its potential utility from being fully realized. To fill the void in the foundation of information theory, Zhang (2020) proposed generalized Shannon’s entropy, which is finitely defined everywhere. The plug-in estimator, adopted in almost all entropy-based ML method packages, is one of the most popular approaches to estimating Shannon’s entropy. The asymptotic distribution for Shannon’s entropy’s plug-in estimator was well studied in the existing literature. This paper studies the asymptotic properties for the plug-in estimator of generalized Shannon’s entropy on countable alphabets. The developed asymptotic properties require no assumptions on the original distribution. The proposed asymptotic properties allow for interval estimation and statistical tests with generalized Shannon’s entropy.
- 17 January 2020
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 49 (2) , 307-324
Estimation of population size in entropic perspective
Nonparametric estimation of population size is a long standing and difficult problem. It is difficult because, particularly from a likelihood perspective, the underlying distribution could vary greatly and many small probability events may not be observed in a sample. However if approached from an entropic standpoint, certain trends can be exploited. This article proposes several estimators based on an entropic representation of population size, and establishes their consistency. Simulation results of the proposed estimators are also reported in comparison with a well-known estimator, and the advantages are noted. Two examples with real data are also included.
- 17 January 2020
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 49 (2) , 307-324
Estimation of population size in entropic perspective
Nonparametric estimation of population size is a long standing and difficult problem. It is difficult because, particularly from a likelihood perspective, the underlying distribution could vary greatly and many small probability events may not be observed in a sample. However if approached from an entropic standpoint, certain trends can be exploited. This article proposes several estimators based on an entropic representation of population size, and establishes their consistency. Simulation results of the proposed estimators are also reported in comparison with a well-known estimator, and the advantages are noted. Two examples with real data are also included.