The Braess' paradox for pendent twins

DOI10.1016/j.laa.2019.12.040zbMath1437.05218arXiv1909.12549OpenAlexW2999321404WikidataQ126402081 ScholiaQ126402081MaRDI QIDQ2174494

Lorenzo Ciardo

Publication date: 21 April 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12549

zbMATH Keywords

planar graphrandom graphresistance distanceeffective resistanceKemeny's constantrandom walk on a graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Random walks on graphs (05C81)

Related Items

On Kemeny's constant for trees with fixed order and diameter ⋮ On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ Families of graphs with twin pendent paths and the Braess edge ⋮ Kemeny's constant and the Kirchhoff index for the cluster of highly symmetric graphs ⋮ Perron value and moment of rooted trees ⋮ A 1-separation formula for the graph Kemeny constant and Braess edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning 2-forests and resistance distance in 2-connected graphs
• Inertia characteristics of self-adjoint matrix polynomials
• Random planar graphs
• On electric resistances for distance-regular graphs
• Complete multipartite graphs and Braess edges
• Asymptotic enumeration and limit laws of planar graphs
• Kemeny's Constant And An Analogue Of Braess' Paradox For Trees
• Scaling Laws for Consensus Protocols Subject to Noise
• Control Techniques for Complex Networks
• Pseudoinverss of Postive Semidefeinite Matrices