2011
DOI: 10.1007/978-3-642-23811-6_20
|View full text |Cite
|
Sign up to set email alerts
|

Statistical Mechanics on Isoradial Graphs

Abstract: Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs naturally arise in two approaches used by physicists: transfer matrices and conformal field theory. This leads us to the fact that isoradial graphs provide a natural setting for discrete complex analysis, to which we dedicate one section. Then, we give an overview of explicit resu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
25
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(25 citation statements)
references
References 50 publications
(38 reference statements)
0
25
0
Order By: Relevance
“…That work is, in a sense, combinatorial in nature, and it provides connections between percolation on a graph embedded in R 2 and on a type of dual graph obtained via a generalized star-triangle transformation. In contrast, the work reported here is closely connected to the property of isoradiality (see [3,8]), and is thus more geometric in nature. It permits the proof of relations between a variety of two-dimensional graphs.…”
mentioning
confidence: 66%
See 2 more Smart Citations
“…That work is, in a sense, combinatorial in nature, and it provides connections between percolation on a graph embedded in R 2 and on a type of dual graph obtained via a generalized star-triangle transformation. In contrast, the work reported here is closely connected to the property of isoradiality (see [3,8]), and is thus more geometric in nature. It permits the proof of relations between a variety of two-dimensional graphs.…”
mentioning
confidence: 66%
“…and (3,4,6,4). The second may be transformed into the hexagonal lattice by one sequence of star-triangle transformations as marked.…”
Section: Introduction and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, it is important to observe that our procedure allows many distinct types of tessellations as long as they meet the bounded-cell condition (18). Besides Voronoi tessellations and sphere tessellations studied in this work, examples include disordered isoradial graphs [76], Delaunay triangulations, "Delaunay-centroidal" tessellations [44,54], dissected tessellations [77], and various generalizations of Voronoi tessellations, such as Laguerre tessellations [74,75] and tessellations in Manhattan distances [103]. Since constructing progenitor packings is the most time-consuming step in our numerical implementations, one would increase sample sizes by employing other tessellations that can be efficiently generated.…”
Section: Conclusion and Discussionmentioning
confidence: 99%
“…It has been studied in fields like statistical me-105 chanics [19] where the rigidity of planar isoradial graphs is well understood, but has not been extended to R 3 . It is indeed possible to transform a planar Tchebycheff net into an isoradial mesh (cf Figure 2).…”
mentioning
confidence: 99%