2019
DOI: 10.1017/fms.2019.4
|View full text |Cite
|
Sign up to set email alerts
|

Elastic Graphs

Abstract: An elastic graph is a graph with an elasticity associated to each edge. It may be viewed as a network made out of ideal rubber bands. If the rubber bands are stretched on a target space there is an elastic energy. We characterize when a homotopy class of maps from one elastic graph to another is loosening, i.e., decreases this elastic energy for all possible targets. This fits into a more general framework of energies for maps between graphs.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 32 publications
0
7
0
Order By: Relevance
“…Given any , a ribbon elastic graph G can be thickened into a conformal surface with boundary by replacing each edge e of G by a rectangle of size and gluing the rectangles at the vertices by using the given ribbon structure. There are then inequalities relating and , to within a multiplicative factor as shown by the second author [57, Props. 4.8 and 4.9].…”
Section: Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…Given any , a ribbon elastic graph G can be thickened into a conformal surface with boundary by replacing each edge e of G by a rectangle of size and gluing the rectangles at the vertices by using the given ribbon structure. There are then inequalities relating and , to within a multiplicative factor as shown by the second author [57, Props. 4.8 and 4.9].…”
Section: Examplesmentioning
confidence: 99%
“…There is a parallel notion of extremal length with respect to elastic graphs, as introduced by the second author [56], just as there is for ordinary lengths (Subsection 4.4).…”
Section: Extremal Length With Respect To Elastic Graphsmentioning
confidence: 99%
“…In recent work, Dylan Thurston discovered a positive characterization for rationality ( [7,8]). Central to the theory is an elastic graph spine G f in CP 1 − C f the existence of which is necessary and sufficient for the self-cover to be conjugate to a rational map.…”
Section: Rational Maps On Cp 1 As Branched Self-coversmentioning
confidence: 99%
“…Asymptotic q-conformal energies. A virtual endomorphism of graphs pπ, φq has, for each q P r1, 8s, an associated asymptotic q-conformal graph energy E q pπ, φq, introduced by the second author [Thu19]. We summarize some key points; see §4 or the references for more.…”
mentioning
confidence: 99%
“…Energies of graph maps. ( §4) When equipped with natural length metrics, the maps φ n :" φ n 0 : G n Ñ G 0 have, for each q P r1, 8s, a q-conformal energy E q q rφ n s in the sense introduced by the second author in [Thu19]. The growth rate of this energy as n tends to infinity, namely E q rπ, φs :" lim E q q rφ n s 1{n , is called the asymptotic q-conformal energy, depends only on the homotopy class rπ, φs, and is non-increasing in q (Proposition 4.11).…”
mentioning
confidence: 99%