相关论文: Asymptotic evaluation of a lattice sum associated …
In this paper we are concerned with the asymptotic behavior of \[ \operatorname{tr}(\mathcal{L}^+_{\rm sq}) = \frac{1}{4} \sum_{j,k=0 \atop (j,k) \neq (0,0)}^{n-1} \frac{1}{1-\frac{1}{2} \big( \cos \frac{2\pi j}{n} + \cos \frac{2\pi k}{n}…
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 consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…
A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…
We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…
We consider the fractional Laplacian on a domain and investigate the asymptotic behavior of its eigenvalues. Extending methods from semi-classical analysis we are able to prove a two-term formula for the sum of eigenvalues with the leading…
Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…
In the past two decades, the field of applied finance has tremendously benefited from graph theory. As a result, novel methods ranging from asset network estimation to hierarchical asset selection and portfolio allocation are now part of…
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…
In this paper, we study the asymptotic behavior of the sum of twisted traces of self-dual or conjugate self-dual discrete automorphic representations of $\mathrm{GL}_n$ for the level aspect of principal congruence subgroups under some…
Graph signal processing (GSP) is a prominent framework for analyzing signals on non-Euclidean domains. The graph Fourier transform (GFT) uses the combinatorial graph Laplacian matrix to reveal the spectral decomposition of signals in the…
We determine the asymptotic behaviour of the number of the Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the…
We consider two independent random variables with the given tail asymptotic (e.g. power or exponential). We find tail asymptotic for their sum and product. This is done by some cumbersome but purely technical computations and requires the…
We consider the problem of inferring the unobserved edges of a graph from data supported on its nodes. In line with existing approaches, we propose a convex program for recovering a graph Laplacian that is approximately diagonalizable by a…
The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…
Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…
Let X_i, i\in N, be i.i.d. B-valued random variables, where B is a real separable Banach space. Let \Phi be a smooth enough mapping from B into R. An asymptotic evaluation of Z_n=E(\exp (n\Phi (\sum_{i=1}^nX_i/n))), up to a factor (1+o(1)),…
It is shown that the second term in the asymptotic expansion as $t\to 0$ of the trace of the semigroup of symmetric stable processes (fractional powers of the Laplacian) of order $\alpha$, for any $0<\alpha<2$, in Lipschitz domains is given…