19 research outputs found
Extreme Values of the Fiedler Vector on Trees
Let be a connected tree on vertices and let denote the
Laplacian matrix on . The second-smallest eigenvalue ,
also known as the algebraic connectivity, as well as the associated eigenvector
have been of substantial interest. We investigate the question of when
the maxima and minima of are assumed at the endpoints of the longest
path in . Our results also apply to more general graphs that `behave
globally' like a tree but can exhibit more complicated local structure. The
crucial new ingredient is a reproducing formula for the eigenvector
On localization of eigenfunctions of the magnetic Laplacian
Let and consider the magnetic Laplace operator
given by , where , subject to Dirichlet eigenfunction. This operator can, for
certain vector fields , have eigenfunctions that
are highly localized in a small region of . The main goal of this paper
is to show that if assumes its maximum in , then
behaves `almost' like a conservative vector field in a
neighborhood of in a precise sense: we expect
localization in regions where \left|\mbox{curl} A \right| is small. The
result is illustrated with numerical examples
A compactness principle for maximising smooth functions over toroidal geodesics
DOI:
10.1017/S000497271800163
Improved bounds for Hermite-Hadamard inequalities in higher dimensions
Let be a convex domain and let be a positive, subharmonic function (i.e. ). Then
where . This inequality was previously only known for convex functions with a much larger constant. We also
show that the optimal constant satisfies . As a byproduct,
we establish a sharp geometric inequality for two convex domains where one contains the other :
rac{|partial Omega_1|}{|Omega_1|} rac{| Omega_2|}{|partial Omega_2|} leq n.$