Abstract / Description of output
We discuss various ensembles of homogeneous complex networks and a Monte-Carlo method of generating graphs from these ensembles. The method is quite general and can be applied to simulate micro-canonical, canonical or grand-canonical ensembles for systems with various statistical weights. It can be used to construct homogeneous networks with desired properties, or to construct a non-trivial scoring function for problems of advanced motif searching. (c) 2005 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 587-607 |
Number of pages | 21 |
Journal | Physica a-Statistical mechanics and its applications |
Volume | 366 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jul 2006 |
Keywords / Materials (for Non-textual outputs)
- complex networks
- random graphs
- statistical mechanics
- Markov process
- STATISTICAL-MECHANICS
- RANDOM GRAPHS
- DEGREE SEQUENCE
- EVOLUTION
- SIZE