Network Transitivity and Matrix Models

Preprint

16 October 2003

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0310234

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.

Keywords

All Related Versions

Version 1, 2003-10-10, ArXiv
Version 2, 2003-10-16, ArXiv
Published version: Physical Review E, 69 (2), 026106.

This publication has 0 references indexed in Scilit: