Abstract / Description of output
Random graphs are widely used for modeling complex networks. Instead of considering many different models, to study dynamical phenomena on networks, it is desirable to design a general algorithm which produces random graphs with a variety of properties. Here we present a Monte Carlo method based on a random walk in the space of graphs. By ascribing to each graph a statistical weight we can generate networks of different types by tuning the weight function. The algorithm allows in particular to perform multicanonical simulations known, e.g., from spin models.
Original language | English |
---|---|
Title of host publication | PATH INTEGRALS: NEW TRENDS AND PERSPECTIVES, PROCEEDINGS |
Editors | W Janke, A Pelster |
Place of Publication | SINGAPORE |
Publisher | World Scientific |
Pages | 342-345 |
Number of pages | 4 |
ISBN (Print) | 978-981-283-726-4 |
Publication status | Published - 2008 |
Event | 9th International Conference on Path Integrals - Dresden, Germany Duration: 23 Sept 2007 → 28 Sept 2007 |
Conference
Conference | 9th International Conference on Path Integrals |
---|---|
Country/Territory | Germany |
Period | 23/09/07 → 28/09/07 |
Keywords / Materials (for Non-textual outputs)
- Complex networks
- Random graphs
- Monte Carlo methods
- Multicanonical simulations
- STATISTICAL-MECHANICS
- COMPLEX NETWORKS