English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/218378
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


Tree decompositions of real-world networks from simulated annealing

AuthorsKlemm, Konstantin
Issue Date4-Aug-2020
PublisherInstitute of Physics Publishing
CitationJournal of Physics: Complexity 1: 035003 (2020)
AbstractDecompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network. Tree and branch decompositions considered here directly represent network structure as trees for recursive computation of network properties. Unlike coarse-graining approximations in terms of community structure or metapopulations, tree decompositions of sufficiently small width allow for exact results on equilibrium processes. Here we use simulated annealing to find tree decompositions of narrow width for a set of medium-size empirical networks. Rather than optimizing tree decompositions directly, we employ a search space constituted by so-called elimination orders being permutations on the network's node set. For each in a database of empirical networks with up to 1000 edges, we find a tree decomposition of low width.
DescriptionThe data that support the findings of this study are openly available at the following https://ifisc.uib-csic.es/users/klemm/supplement_klemm_elorder.txt.
Publisher version (URL)https://doi.org/10.1088/2632-072X/ab9d2f
Appears in Collections:(IFISC) Artículos
Files in This Item:
File Description SizeFormat 
Klemm_2020_J_Phys_Complex.pdf963,27 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.