Lander–Green algorithm

The Lander–Green algorithm is a method used for generating random samples from the uniform distribution over specific combinatorial objects such as integer partitions or certain types of labeled structures. It is particularly well-known for its application in generating random integer partitions efficiently. The algorithm operates by combining techniques from combinatorial enumeration and probabilistic sampling. It ensures that each possible configuration has an equal chance of being selected, which is crucial for applications in statistical analysis, simulations, and other computational problems.