Related papers: Forest formulas of discrete Green's functions
In our previous paper, Green functions associated to complex reflection groups G(e,1,n) were discussed. It involved a combinatorial approach to the Green functions of classical groups of type B_n or C_n. In this paper, we introduce Green…
The Laplacian matrix $L$ of a signed graph $G$ may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of $L$. This is achieved by finding a combinatorial formula for the Moore-Penrose inverse of an…
Perturbation theory using self-consistent Green's functions is one of the most widely used approaches to study many-body effects in condensed matter. On the basis of general considerations and by performing analytical calculations for the…
Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this work, we consider the problem of bijectively embedding the…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
An essential spanning forest of an infinite graph $G$ is a spanning forest of $G$ in which all trees have infinitely many vertices. Let $G_n$ be an increasing sequence of finite connected subgraphs of $G$ for which $\bigcup G_n=G$.…
On a countable tree $T$, allowing vertices with infinite degree, we consider an arbitrary stochastic irreducible nearest neighbour transition operator $P$. We provide a boundary integral representation for general eigenfunctions of $P$ with…
An induced forest of a graph G is an acyclic induced subgraph of G. The present paper is devoted to the analysis of a simple randomised algorithm that grows an induced forest in a regular graph. The expected size of the forest it outputs…
In this note we derive an exact formula for the Green's function of the random walk on different subspaces of the discrete lattice (orthants, including the half space, and the strip) without killing on the boundary in terms of the Green's…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
For an indifference graph $G$ we define a symmetric function of increasing spanning forests of $G$. We prove that this symmetric function satisfies certain linear relations, which are also satisfied by the chromatic quasisymmetric function…
Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…
The uniform spanning forest measure ($\mathsf{USF}$) on a locally finite, infinite connected graph $G$ with conductance $c$ is defined as a weak limit of uniform spanning tree measure on finite subgraphs. Depending on the underlying graph…
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '$\Gamma$-species' which incorporates data about 'structural' group actions). This culminates…
We consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions of trace formulae, relating Laplace spectra to sums…
We derive a variational formula for the outward normal derivative of the Green function for the Schr\"odinger and Laplace--Beltrami operators, viewed as perturbations of the Laplacian. As an application we begin to characterize elliptic…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…