We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions of finitely generated groups by automorphisms on rooted trees, and thus their edges are naturally labeled by the generators of the group. It is thus natural to consider weight functions on these graphs taking different values according to the labeling. We study in detail the well-known example of the Hanoi Towers group H-(3), closely related to the Sierpinski gasket. (c) 2012 Elsevier Ltd. All rights reserved
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a...
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cant...
AbstractThree different zeta functions are attached to a finite connected, possibly irregular graphX...
AbstractWe study partition functions for the dimer model on families of finite graphs converging to ...
AbstractThe number of matchings of a graph G is an important graph parameter in various contexts, no...
We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which a...
AbstractThe different manners of embedding subgraphs of many disjoint edges in a parent graph arise ...
International audienceWe introduce a general model of dimer coverings of certain plane bipartite gra...
The recent field of analysis on fractals has been studied under a probabilistic and analytic point o...
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic bou...
AbstractGeneralizing results of Temperley (London Mathematical Society Lecture Notes Series 13 (1974...
Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite p...
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which ar...
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a...
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cant...
AbstractThree different zeta functions are attached to a finite connected, possibly irregular graphX...
AbstractWe study partition functions for the dimer model on families of finite graphs converging to ...
AbstractThe number of matchings of a graph G is an important graph parameter in various contexts, no...
We compute the complexity of two infinite families of finite graphs: the Sierpiński graphs, which a...
AbstractThe different manners of embedding subgraphs of many disjoint edges in a parent graph arise ...
International audienceWe introduce a general model of dimer coverings of certain plane bipartite gra...
The recent field of analysis on fractals has been studied under a probabilistic and analytic point o...
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic bou...
AbstractGeneralizing results of Temperley (London Mathematical Society Lecture Notes Series 13 (1974...
Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions...
The dimer model is a probability measure on perfect matchings (or dimer configurations)on a graph. D...
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite p...
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which ar...
Using the method of spectral decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a...
We give the first example of a connected 4-regular graph whose Laplace operator's spectrum is a Cant...
AbstractThree different zeta functions are attached to a finite connected, possibly irregular graphX...