# Networks, Markov Lie Monoids, and Generalized Entropy

## Abstract

The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the sum of the components of a vector, and (2) the n dimensional Abelian Lie group, A(n), of scaling transformations of the coordinates. With the restriction of the first Lie algebra parameters to nonnegative values, one obtains exactly all Markov transformations in n dimensions that are continuously connected to the identity. In this work we show that every network, as defined by its C matrix, is in one to one correspondence to one element of the Markov monoid of the same dimensionality. It follows that any network matrix, C, is the generator of a continuous Markov transformation that can be interpreted as producing an irreversible flow among the nodes of the corresponding network.

## Keywords

Generalize Entropy General Linear Group Eigenvalue Spectrum Connection Matrix Renyi Entropy## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Renyi, A.: Probability Theory. North-Holland Series in Applied Mathematics and Mechanics, 670 pages. North-Holland Pub. Co., Amsterdam (1970)Google Scholar
- 2.Renyi, A.: Selected Papers of Alfred Renyi, Akademia Kiado, Buadapest, vol. 2 of 3 volumes (1976)Google Scholar
- 3.Johnson, J.E.: Markov-type Lie Groups in GL(n, R). Journal of Mathematical Physics 26, 252–257 (1985)MATHCrossRefMathSciNetGoogle Scholar
- 4.Gudkov, V., Johnson, J.E.: Network as a complex system: information flow analysis, 10 pages (2001) arXiv:lin.CD/0110008v1Google Scholar
- 5.Gudkov, V., Johnson, J.E.: Chapter 1: Multidimensional network monitoring for intrusion detection, 12 pages (2002) arXiv: cs.CR/020620v1Google Scholar