Results 1 
2 of
2
A trace on fractal graphs AND THE IHARA ZETA FUNCTION
, 2008
"... Starting with Ihara’s work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors. Then, Clair and MokhtariSharghi have studied zeta functions for infinite graphs acted u ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Starting with Ihara’s work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors. Then, Clair and MokhtariSharghi have studied zeta functions for infinite graphs acted upon by a discrete group of automorphisms. The main formula in all these treatments establishes a connection between the zeta function, originally defined as an infinite product, and the Laplacian of the graph. In this article, we consider a different class of infinite graphs. They are fractal graphs, i.e. they enjoy a selfsimilarity property. We define a zeta function for these graphs and, using the machinery of operator algebras, we prove a determinant formula, which relates the zeta function with the Laplacian of the graph. We also prove functional equations, and a formula which allows approximation of the zeta function by the zeta functions of finite subgraphs. The Ihara zeta function, originally associated to certain groups and then combinatorially
BOSE EINSTEIN CONDENSATION ON INHOMOGENEOUS AMENABLE GRAPHS
, 812
"... Abstract. We investigate the Bose–Einstein Condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. The resulting topological model, whose Hamiltonian is the pure hopping one given by the opposite of the adjacency operator, has also a mathematical inte ..."
Abstract
 Add to MetaCart
Abstract. We investigate the Bose–Einstein Condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. The resulting topological model, whose Hamiltonian is the pure hopping one given by the opposite of the adjacency operator, has also a mathematical interest in itself. We show that for the nonhomogeneous networks like the comb graphs, particles condensate in momentum and configuration space as well. In this case different properties of the network, of geometric and probabilistic nature, such as the volume growth, the shape of the ground state, and the transience, all play a rôle in the condensation phenomena. The situation is quite different for homogeneous networks where just one of these parameters, e.g. the volume growth, is enough to determine the appearance of the condensation. 1.