A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins

Details A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins

2009-06-04

arxiv.org/abs/0906.1004v1

Statistics

Computation

27 pages

Scientific paper

Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there are practical algorithms for approximate uniform sampling. Here it is shown how dynamic programming and recent asymptotic enumeration results can be used to simplify and improve a certain class of approximate uniform samplers. The dynamic programming perspective suggests interesting generalizations.

Affiliated with

Also associated with

No associations

Rating

A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dynamic Programming Approach for Approximate Uniform Generation of Binary Matrices with Specified Margins will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521569