2000-01-01

# A stochastic uncoupling process for graphs

## Publication

### Publication

A discrete stochastic uncoupling process for finite spaces is introduced, called the emph{Markov Cluster Process (MCL~process). The process takes a stochastic matrix as input, and then alternates flow expansion and flow inflation, each step defining a stochastic matrix in terms of the previous one. Flow expansion corresponds with taking the~$k^{th$~power of a stochastic matrix, where~$kinN$. Flow inflation corresponds with a parametrized operator~$Gamma_r$, $rgeq 0$, which maps the set of (column) stochastic matrices onto itself. The image~$Gamma_r M$ is obtained by raising each entry in~$M$ to the~$r^{th$~power and rescaling each column to have sum~$1$ again. In practice the process converges very fast towards a limit which is idempotent under both matrix multiplication and inflation, with quadratic convergence around the limit points. The limit is in general extremely sparse and the number of components of its associated graph may be larger than the number associated with the input matrix. This uncoupling is a desired effect as it reveals structure in the input matrix. The inflation operator~$Gamma_r$ is shown to map the class of matrices which are diagonally similar to a symmetric matrix onto itself. The term emph{diagonally positive semi-definite (dpsd) is used for matrices which are diagonally similar to a positive semi-definite matrix. It is shown that for $rinN$ and for~$M$ a stochastic dpsd matrix, the image~$Gamma_r M$ is again dpsd. Determinantal inequalities satisfied by a dpsd matrix~$M$ imply a natural ordering among the diagonal elements of~$M$, generalizing a mapping of nonnegative column allowable idempotent matrices onto overlapping clusterings. The spectrum of~$Gamma_{infty M$, for dpsd $M$, is of the form~${0^{n-k, 1^k$, where~$k$ is the number of endclasses of the ordering associated with~$M$, and~$n$ is the dimension of~$M$. Reductions of dpsd matrices are given, a connection with Hilbert's distance and the contraction ratio defined for nonnegative matrices is discussed, and several conjectures are made.

Additional Metadata | |
---|---|

MSC | Matrices (incidence, Hadamard, etc.) (msc 05B20), Positive matrices and their generalizations; cones of matrices (msc 15B48), Stochastic matrices (msc 15B51), Classification and discrimination; cluster analysis (msc 62H30), Graph theory (including graph drawing) (msc 68R10), Pattern recognition, speech recognition (msc 68T10), Programming involving graphs or networks (msc 90C35) |

Publisher | CWI |

Series | Information Systems [INS] |

Citation |
van Dongen, S. (2000).
A stochastic uncoupling process for graphs. Information Systems [INS]. CWI. |