Show simple item record

dc.contributor.authorFerrer Cancho, Ramon
dc.contributor.authorGómez Rodríguez, Carlos
dc.contributor.authorEsteban Ángeles, Juan Luis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2021-05-10T14:14:28Z
dc.date.issued2021-02-11
dc.identifier.citationFerrer-i-Cancho, R.; Gómez-Rodríguez, C.; Esteban, J.L. Bounds of the sum of edge lengths in linear arrangements of trees. "Journal of statistical mechanics: Theory and experiment", 11 Febrer 2021, vol. 2021, article 023403, p. 1-44.
dc.identifier.issn1742-5468
dc.identifier.urihttp://hdl.handle.net/2117/345381
dc.description.abstractA fundamental problem in network science is the normalization of the topological or physical distance between vertices, which requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the variation of the physical distance in linear arrangements of the vertices of trees. In particular, we investigate various problems of the sum of edge lengths in trees of a fixed size: the minimum and the maximum value of the sum for specific trees, the minimum and the maximum in classes of trees (bistar trees and caterpillar trees) and finally the minimum and the maximum for any tree. We establish some foundations for research on optimality scores for spatial networks in one dimension.
dc.description.sponsorshipRFC is supported by the grant TIN2017-89244-R from MINECO (Ministerio de Economía, Industria y Competitividad) and the recognition 2017SGR-856 (MACDA) from AGAUR (Generalitat de Catalunya). CGR is funded by the European Research Council (ERC), under the European Union’s Horizon 2020 research and innovation programme (FASTPARSE, grant agreement No 714150), the ANSWER-ASAP project (TIN2017-85160-C2-1-R) from MINECO and Xunta de Galicia (ED431C 2020/11, ED431G2019/01, and an Oportunius program grant to complement ERC grants). JLE is funded by the grants TIN2016-76573-C2-1-P and PID2019-109137GB-C22 from MINECO.
dc.format.extent44 p.
dc.language.isoeng
dc.publisherInstitute of Physics (IOP)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshGraph theory
dc.subject.lcshTrees (Graph theory)
dc.subject.lcshTopology
dc.titleBounds of the sum of edge lengths in linear arrangements of trees
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacArbres (Teoria de grafs)
dc.subject.lemacTopologia
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.identifier.doi10.1088/1742-5468/abd4d7
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://iopscience.iop.org/article/10.1088/1742-5468/abd4d7/meta
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac31267885
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/TIN2017-89244-R
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/TIN2016-76573-C2-1-P
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO/PID2019-109137GB-C22
dc.relation.projectidinfo:eu-repo/grantAgreement/AGAUR/2017 SGR 856
dc.date.lift2022-02-11
local.citation.authorFerrer-i-Cancho, R.; Gómez-Rodríguez, C.; Esteban, J. L.
local.citation.publicationNameJournal of statistical mechanics: Theory and experiment
local.citation.volume2021
local.citation.numberarticle 023403
local.citation.startingPage1
local.citation.endingPage44


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder