4.3 Article

Maximum Entropy Design by a Markov Chain Process

Journal

Publisher

OXFORD UNIV PRESS INC
DOI: 10.1093/jssam/smad010

Keywords

Algorithm; Conditional Poisson sampling; Inclusion probability; Markov chain

Ask authors/readers for more resources

In this article, the implementation of maximum entropy (ME) design using a Markov chain is studied. A new method for calculating the weights associated with conditional Poisson sampling is presented. A simple method of random exchanges of units is studied, which allows switching from one sample to another. By repeating the exchange process, a sample that respects the design can be selected, and its convergence rate has been investigated theoretically and by simulation, showing promising results.
In this article, we study an implementation of maximum entropy (ME) design utilizing a Markov chain. This design, which is also called the conditional Poisson sampling design, is difficult to implement. We first present a new method for calculating the weights associated with conditional Poisson sampling. Then, we study a very simple method of random exchanges of units, which allows switching from one sample to another. This exchange system defines an irreducible and aperiodic Markov chain whose ME design is the stationary distribution. The design can be implemented without enumerating all possible samples. By repeating the exchange process a large number of times, it is possible to select a sample that respects the design. The process is simple to implement, and its convergence rate has been investigated theoretically and by simulation, which led to promising results.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available