Related papers: Forest formulas of discrete Green's functions
In this paper, we provide an exact formula for the average hitting times in a wheel graph $W_{N+1}$ using a combinatorial approach. For this wheel graph, the average hitting times can be expressed using Fibonacci numbers when the number of…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…
For random matrices with tree-like structure there exists a recursive relation for the local Green functions whose solution permits to find directly many important quantities in the limit of infinite matrix dimensions. The purpose of this…
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…
We express connected Fermionic Green's functions in terms of completely explicit tree formulas. In contrast with the ordinary formulation in terms of Feynman graphs these formulas allow a completely transparent proof of convergence of the…
The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a…
In this paper, we aim to provide probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree formulas are closely related to loop-erased…
Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of…
Arakelov-Green functions defined on metrized graphs have important role in relating arithmetical problems on algebraic curves into graph theoretical problems. In this paper, we clarify the combinatorial interpretation of certain…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
This article is devoted to deduce the expression of the Green's function related to a general constant coefficients fractional difference equation coupled to Dirichlet conditions. In this case, due to the points where some of the fractional…
We give the spectral representation for a class of selfadjoint discrete graph Laplacians $\Delta$, with $\Delta$ depending on a chosen graph $G$ and a conductance function $c$ defined on the edges of $G$. We show that the spectral…
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…
Given a finite group $G$ and its representation $\rho$, the corresponding McKay graph is a graph $\Gamma(G,\rho)$ whose vertices are the irreducible representations of $G$; the number of edges between two vertices $\pi,\tau$ of…
We present a spectral weight conserving formalism for Fermionic thermal Green's functions that are discretized in imaginary time and thus periodic in imaginary ("Matsubara") frequency. The formalism requires a generalization of the Dyson…
We study the asymptotic expansion of the determinant of the graph Laplacian associated to discretizations of a half-translation surface endowed with a flat unitary vector bundle. By doing so, over the discretizations, we relate the…
It is known that the generating function associated with the enumeration of non-backtracking walks on finite graphs is a rational matrix-valued function of the parameter; such function is also closely related to graph-theoretical results…