Related papers: Forest formulas of discrete Green's functions
We compute the Green's function for the Hodge Laplacian on the symmetric spaces M\times\Sigma, where M is a simply connected n-dimensional Riemannian or Lorentzian manifold of constant curvature and \Sigma is a simply connected Riemannian…
We give an expression for the determinant of the twisted Laplacian associated with any linear representation of a finite quiver in terms of traces of the holonomy of its cycles. To establish this expression, we prove a general identity for…
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…
We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…
In this paper it is shown how the generating functional for Green's functions in relativistic quantum field theory and in thermal field theory can be evaluated in terms of a standard quantum mechanical path integral. With this calculational…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove…
For dendrite graphs from biological experiments on mouse's retinal ganglion cells, a paper by Nakatsukasa, Saito and Woei reveals a mysterious phase transition phenomenon in the spectra of the corresponding graph Laplacian matrices. While…
Based on results of Digne-Michel-Lehrer (2003) we give two formulae for two-variable Green functions attached to Lusztig induction in a finite reductive group. We present applications to explicit computation of these Green functions, to…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
Exact eigendecomposition of large matrices is very expensive, and it is practically impossible to compute exact eigenvalues. Instead, one may set a more modest goal of approaching the empirical distribution of the eigenvalues, recovering…
Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…
We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…
In a paper from 2012 Jab{\l}o\'nski, Jung and Stochel introduced the weighted shifts on directed trees, a generalisation of well known weighted shift operators on $\ell^2$. In the last decade this class has proven itself handy for finding…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
We prove an asymptotic formula for the determinant of the bundle Laplacian on discrete $d$-dimensional tori as the number of vertices tends to infinity. This determinant has a combinatorial interpretation in terms of cycle-rooted spanning…
We present a general abstract framework for combinatorial Dyson-Schwinger equations, in which combinatorial identities are lifted to explicit bijections of sets, and more generally equivalences of groupoids. Key features of combinatorial…
Efficient computation of lattice defect geometries such as point defects, dislocations, disconnections, grain boundaries, interfaces and free surfaces requires accurate coupling of displacements near the defect to the long-range elastic…