arXiv · cond-mat/0310234
Network Transitivity and Matrix Models
Abstract
This paper is a step towards a systematic theory of the transitivity (clustering) phenomenon in random networks. A static framework is used, with adjacency matrix playing the role of the dynamical variable. Hence, our model is a matrix model, where matrices are random, but their elements take values 0 and 1 only. Confusion present in some papers where earlier attempts to incorporate transitivity in a similar framework have been made is hopefully dissipated. Inspired by more conventional matrix models, new analytic techniques to develop a static model with non-trivial clustering are introduced. Computer simulations complete the analytic discussion.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Z. Burda, J. Jurkiewicz, A. Krzywicki. 2003-10-16. Network Transitivity and Matrix Models. https://doi.org/10.1103/physreve.69.026106
Cite the original work for its findings. Save a collection to share your selection of sources.