David L.Powers, Bounds on graph eigenvalues. Linear Algebra and Its Applications . 1989David L. Powers, Bounds on graph eigenvalues, Linear Algebm Appl. 117:1-6 (1989).Powers, Bounds on graph eigenvalues. David L. Linear Algebra and Its Applications . 1989...
09 Graphon spectral decompositions for LQG control and games 47:55 Mitigating Epidemics_ Perspectives from Stackelberg Mean Field Games and Graphon 53:32 On nonlocal interactions in mean field games - Part 1 38:23 On nonlocal interactions in mean field games - Part 2 11:39 Z_2 harmonic ...
Stanić, Z.: Inequalities for Graph Eigenvalues, London Mathematical Society Lecture Note Series, vol. 423. Cambridge University Press, Cambridge (2015) Book Google Scholar Stevanović, D.: Spectral Radius of Graphs. Academic Press, New York (2015) MATH Google Scholar Tian, G.-X., Chen...
(with the k th element of the vector being the value associated to \(v_{k}\in \mathcal{e}(g)\) ). 4 the eigenvalues of l are nonnegative. the null-space of l for a graph with q disjoint components is q -dimensional, with the null-space spanned by vectors corresponding to ...
More spectral bounds on the clique and independence numbers We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues. In particular we prove the following results. Let G... V Nikiforov - Academic Press, Inc. 被引量: 41发表: 2009年 On a Pos...
A standard way to bound the number of links in a cut-set | V | relies on Laplacian eigenvalues, which approximate the largest and smallest possible cut-sets for a given size of the set V . In this article, we extend the standard spectral approximations by including information about the ...
Tocover time is the first time when the particle has visited all the vertices in the graph starting from a given vertex. In this paper, we present upper and lower bounds that relate the expected cover time for a graph to the eigenvalues of the Markov chain that describes the random walk ...
for an orthonormal basis\(\{\left\vert {\psi }_{j}\right\rangle \}\), wherepjare non-negative eigenvalues summing to 1. In this work, as in ref.39,40, we make use of the concept of a density matrix to describe a complex network (i.e. a graph with many edges and vertices, ...
In the Fastest Mixing Markov Chain problem, we are given a graph $$G = (V, E)$$ and desire the discrete-time Markov chain with smallest mixing time $$\tau
Universal Bounds for the Low Eigenvalues of Neumann Laplacians in N Dimensions The authors consider bounds on the Neumann eigenvalues of the Laplacian on domains in $I\\mathbb{R}^n $ in the light of their recent results on Dirichlet e... MS Ashbaugh,RD Benguria - Society for Industrial an...