English
Related papers

Related papers: The $Z$-invariant massive Laplacian on isoradial g…

200 papers

We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known…

Mathematical Physics · Physics 2008-11-26 Andrea Bedini , Sergio Caracciolo , Andrea Sportiello

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

Combinatorics · Mathematics 2010-04-27 Russell Lyons

We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic…

Combinatorics · Mathematics 2013-04-05 Eliseu Fritscher , Carlos Hoppen , Vilmar Trevisan

Free quantal motion on group manifolds is considered. The Hamiltonian is given by the Laplace -- Beltrami operator on the group manifold, and the purpose is to get the (Feynman's) evolution kernel. The spectral expansion, which produced a…

Quantum Physics · Physics 2009-10-30 Nurit Krausz , M. S. Marinov

In their study of the giant component in inhomogeneous random graphs, Bollob\'as, Janson, and Riordan introduced a class of branching processes parametrized by a possibly unbounded graphon. We prove that the tree structures underlying two…

Combinatorics · Mathematics 2025-08-27 Jan Hladký , Eng Keat Hng , Anna Margarethe Limbach

In this paper we prove that the existence of absolutely continuous spectrum of the Kirchhoff Laplacian on a radial metric tree graph together with a finite complexity of the geometry of the tree implies that the tree is in fact eventually…

Spectral Theory · Mathematics 2016-06-28 Pavel Exner , Christian Seifert , Peter Stollmann

We study combinatorial Laplacians on rectangular subgraphs of $ \epsilon \mathbb{Z}^2 $ that approximate Laplace-Beltrami operators of Riemannian metrics as $ \epsilon \rightarrow 0 $. These laplacians arise as follows: we define the notion…

Mathematical Physics · Physics 2015-01-12 Ananth Sridhar

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

Probability · Mathematics 2011-12-09 Richard Kenyon

In this paper we derive the inverse spatial Laplacian for static, spherically symmetric backgrounds by solving Poisson's equation for a point source. This is different from the electrostatic Green function, which is defined on the four…

General Relativity and Quantum Cosmology · Physics 2017-08-16 Karan Fernandes , Amitabha Lahiri

There is a recently discovered connection between the spectral theory of Schr\"o-dinger operators whose potentials exhibit aperiodic order and that of Laplacians associated with actions of groups on regular rooted trees, as Grigorchuk's…

Group Theory · Mathematics 2016-07-01 Rostislav Grigorchuk , Daniel Lenz , Tatiana Nagnibeda

Kirchoff's matrix tree theorem of 1847 connects the number of spanning trees of a graph to the spectral determinant of the discrete Laplacian [22]. Recently an analogue was obtained for quantum graphs relating the number of spanning trees…

Mathematical Physics · Physics 2025-03-27 Jonathan Harrison , Tracy Weyand

We study (unrooted) random forests on a graph where the probability of a forest is multiplicatively weighted by a parameter $\beta>0$ per edge. This is called the arboreal gas model, and the special case when $\beta=1$ is the uniform forest…

Probability · Mathematics 2021-07-06 Roland Bauerschmidt , Nicholas Crawford , Tyler Helmuth , Andrew Swan

Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…

Spectral Theory · Mathematics 2023-03-29 Jonathan Harrison , Tracy Weyand

We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on…

Spectral Theory · Mathematics 2026-05-14 Ángel Alfredo Morán Ledezma

In this paper, we explore the properties of zeta functions associated with infinite graphs of groups that arise as quotients of cuspidal tree-lattices, including all non-uniform arithmetic quotients of the tree of rank one Lie groups over…

Group Theory · Mathematics 2023-07-13 Soonki Hong , Sanghoon Kwon

Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that…

Probability · Mathematics 2019-01-11 Tom Hutchcroft

We consider the first order periodic systems perturbed by a $2N\ts 2N$ matrix-valued periodic potential on the real line. The spectrum of this operator is absolutely continuous and consists of intervals separated by gaps. We define the…

Spectral Theory · Mathematics 2007-05-23 Evgeny Korotyaev

Given a finite simple graph $G$ on $m$ vertices, the zeon combinatorial Laplacian $\Lambda$ of $G$ is an $m\times m$ graph having entries in the complex zeon algebra $\mathbb{C}\mathfrak{Z}$. It is shown here that if the graph has a unique…

Combinatorics · Mathematics 2025-10-07 G. Stacey Staples

Generalizing the 't Hooft and Veltman method of unitary regulators, we demonstrate for the first time the existence of local, Lorentz-invariant, physically motivated Lagrangians of quantum-electrodynamic phenomena such that: (i) Feynman…

High Energy Physics - Theory · Physics 2007-05-23 Marijan Ribaric , Luka Sustersic

The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine…

Combinatorics · Mathematics 2024-10-18 Bishal Sonar , Ravi Srivastava