Combinatorial Perron parameters for trees
Autor(a) principal: | |
---|---|
Data de Publicação: | 2019 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/25122 |
Resumo: | The notion of combinatorial Perron value was introduced in [2]. We continue the study of this parameter and also introduce a new parameter πe(M) which gives a new lower bound on the spectral radius of the bottleneck matrix M of a rooted tree. We prove a bound on the approximation error for πe(M). Several properties of these two parameters are shown. These ideas are motivated by the concept of algebraic connectivity. A certain extension property for the combinatorial Perron value is shown and it allows us to define a new center concept for caterpillars. We also compare computationally this new center to the so-called characteristic set, i.e., the center obtained from algebraic connectivity. |
id |
RCAP_0e56a2ca2da46de30cb74b47de97adb4 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/25122 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Combinatorial Perron parameters for treesPerron valueBotleneck matrixTreeLaplacian matrixMajorizationThe notion of combinatorial Perron value was introduced in [2]. We continue the study of this parameter and also introduce a new parameter πe(M) which gives a new lower bound on the spectral radius of the bottleneck matrix M of a rooted tree. We prove a bound on the approximation error for πe(M). Several properties of these two parameters are shown. These ideas are motivated by the concept of algebraic connectivity. A certain extension property for the combinatorial Perron value is shown and it allows us to define a new center concept for caterpillars. We also compare computationally this new center to the so-called characteristic set, i.e., the center obtained from algebraic connectivity.Elsevier2020-04-01T00:00:00Z2019-04-01T00:00:00Z2019-04-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/25122eng0024-3795https://doi.org/10.1016/j.laa.2018.12.028Andrade, EnideCiardo, LorenzoDahl, Geirinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:48:52Zoai:ria.ua.pt:10773/25122Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:58:30.121699Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Combinatorial Perron parameters for trees |
title |
Combinatorial Perron parameters for trees |
spellingShingle |
Combinatorial Perron parameters for trees Andrade, Enide Perron value Botleneck matrix Tree Laplacian matrix Majorization |
title_short |
Combinatorial Perron parameters for trees |
title_full |
Combinatorial Perron parameters for trees |
title_fullStr |
Combinatorial Perron parameters for trees |
title_full_unstemmed |
Combinatorial Perron parameters for trees |
title_sort |
Combinatorial Perron parameters for trees |
author |
Andrade, Enide |
author_facet |
Andrade, Enide Ciardo, Lorenzo Dahl, Geir |
author_role |
author |
author2 |
Ciardo, Lorenzo Dahl, Geir |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Andrade, Enide Ciardo, Lorenzo Dahl, Geir |
dc.subject.por.fl_str_mv |
Perron value Botleneck matrix Tree Laplacian matrix Majorization |
topic |
Perron value Botleneck matrix Tree Laplacian matrix Majorization |
description |
The notion of combinatorial Perron value was introduced in [2]. We continue the study of this parameter and also introduce a new parameter πe(M) which gives a new lower bound on the spectral radius of the bottleneck matrix M of a rooted tree. We prove a bound on the approximation error for πe(M). Several properties of these two parameters are shown. These ideas are motivated by the concept of algebraic connectivity. A certain extension property for the combinatorial Perron value is shown and it allows us to define a new center concept for caterpillars. We also compare computationally this new center to the so-called characteristic set, i.e., the center obtained from algebraic connectivity. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019-04-01T00:00:00Z 2019-04-01 2020-04-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/25122 |
url |
http://hdl.handle.net/10773/25122 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0024-3795 https://doi.org/10.1016/j.laa.2018.12.028 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137639538884608 |