Download Manual for BLOCKS version 1.6
Transcript
2.2. The Gibbs sequence This posterior distribution is estimated on the basis of a so-called Gibbs sequence. This is a sequence of colorations, constructed by a chance mechanism devised so that, whatever the starting point, the coloration eventually will approximate a sample from the posterior distribution of the coloration given the network data. The number of colors (latent classes) is constant within one Gibbs sequence (although in some steps there might be zero vertices in some of the classes). Every step in the sequence is also called an iteration. When you run BLOCKS, the screen will show the generated colorations by patterns of colored squares (the coloration is not shown for every step in the sequence but only one in so many steps, because showing it for each step would make you dizzy and the program slow). Since the sequentially generated colorations are (approximately) a sample from the distribution, the probabilities can be inferred from averages of a long sequence. The Gibbs sequence will need a start-up (some mechanics say a ‘burn-in’) period before it has indeed converged to a sample from the posterior distribution. The problem is that there are no definite guidelines about how long this start-up period needs to be. Therefore it is best to take it pretty long. The user must specify the number of iterations for the start-up part of the sequence; after this number of iterations it is assumed that convergence has taken place; the user also specifies the number of iterations after this point, the so-called post-convergence iterations. The parameters of the posterior distribution are estimated as averages over the post-convergence iterations, so-called posterior means. In most cases, 10,000 to 100,000 iterations should suffice both for the pre-convergence and the post-convergence number of iterations. If you are unsure whether you had enough iterations, take the preferred number of latent classes and make a real long Gibbs sequence to check that it gives the same answers as those obtained with a shorter sequence. In one execution of BLOCKS, several Gibbs sequences can be constructed, because the number of colors can assume several values from a minimum to a maximum value, and for each color it is possible to make more than one Gibbs sequence. The several Gibbs sequences made for the same color are replications of one another; if they yield approximately the same results, this gives confidence in the outcomes. BLOCKS Theory Operation of the program Project Input data Output files Options Getting started Example: Kapferer’s . . . Parts and units Basic information file Constants References Title Page J I Page 9 of 56 Go Back Full Screen Close Quit