Homogeneous complex networks

L Bogacz, Z Burda, B Waclaw

Research output: Contribution to journalArticlepeer-review

Abstract

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 languageEnglish
Pages (from-to)587-607
Number of pages21
JournalPhysica a-Statistical mechanics and its applications
Volume366
Issue number1
DOIs
Publication statusPublished - 1 Jul 2006

Keywords

  • complex networks
  • random graphs
  • statistical mechanics
  • Markov process
  • STATISTICAL-MECHANICS
  • RANDOM GRAPHS
  • DEGREE SEQUENCE
  • EVOLUTION
  • SIZE

Fingerprint

Dive into the research topics of 'Homogeneous complex networks'. Together they form a unique fingerprint.

Cite this