اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRemarks on Bounds of Normalized Laplacian Eigenvalues of Graphs
113
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $G$ be a connected undirected graph with $n$, $nge 3$, vertices and $m$ edges. Denote by $rho_1 ge rho_2 ge cdots > rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $rho_i$, $i=1,2,ldots , n-1$, are determined in terms of $n$ and general Randi c index, $R_{-1}$.
قيم البحث
اقرأ أيضاً
In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By the uniquen
ess of the first eigenfunction of $p$-Laplacian, as $pto 1,$ we identify the Cheeger constant of a symmetric graph with that of the quotient graph. By this approach, we calculate various Cheeger constants of spherically symmetric graphs.
We propose a method to efficiently estimate the Laplacian eigenvalues of an arbitrary, unknown network of interacting dynamical agents. The inputs to our estimation algorithm are measurements about the evolution of a collection of agents (potentially
one) during a finite time horizon; notably, we do not require knowledge of which agents are contributing to our measurements. We propose a scalable algorithm to exactly recover a subset of the Laplacian eigenvalues from these measurements. These eigenvalues correspond directly to those Laplacian modes that are observable from our measurements. We show how our technique can be applied to networks of multiagent systems with arbitrary dynamics in both continuous- and discrete-time. Finally, we illustrate our results with numerical simulations.
In this paper, we study the bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diame
ter respectively. We also prove similar estimates for higher order Steklov eigenvalues.
In this paper we address the problem of determining whether the eigenspaces of a class of weighted Laplacians on Cayley graphs are generically irreducible or not. This work is divided into two parts. In the first part, we express the weighted Laplaci
an on Cayley graphs as the divergence of a gradient in an analogous way to the approach adopted in Riemannian geometry. In the second part, we analyze its spectrum on left-invariant Cayley graphs endowed with an invariant metric in both directed and undirected cases. We give some criteria for a given eigenspace being generically irreducible. Finally, we introduce an additional operator which is comparable to the Laplacian, and we verify that the same criteria hold.
We study Riesz means of the eigenvalues of the Heisenberg Laplacian with Dirichlet boundary conditions on bounded domains. We obtain an inequality with a sharp leading term and an additional lower order term, improving the result of Hanson and Laptev.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
