Traffic modeling: monotonic total-connected random walk on a network

Monotonic (particles move in the same direction) and total-connected (particles that occupy neighboring cells move synchronized) random ($p<1$) and deterministic ($p=1$) walks on closed networks, which consist of circles, are considered. An algorithm has been developed that allows to calculate the duration of the time interval after that all the particles will be contained in the unique cluster. It is proved that such the interval is finite in the considered model. Some statements are proved that allow to found the velocity of movement if deterministic movement occurs on the follows structures: two rings (two closed sequences of cells) that have a common cell; a closed sequence of rings each of that has two common cells with two the neighboring rings; a two-dimensional network structure in that each cell has common cells with four the neighboring rings; a similar infinite network.