Markov Sampling for Finite Populations
K. Suresh Chandra, S. Sampath, G.K. Balasubramani
Abstract
K. Suresh Chandra, S. Sampath, G.K. Balasubramani
Abstract
In this paper we have introduced a new sampling scheme for a finite population, called a Markov sampling scheme, which always provides distinct units for a fixed sample size. The utility of this sampling over conventional simple random sampling and systematic sampling is discussed for certain categories of labelled populations.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we have introduced a new sampling scheme for a finite population, called a Markov sampling scheme, which always provides distinct units for a fixed sample size. The utility of this sampling over conventional simple random sampling and systematic sampling is discussed for certain categories of labelled populations.
Key concepts: Poisson sampling, Simple random sample, Mathematics, Sampling (signal processing), Sampling design, Sampling scheme, Markov chain, Statistics