19 research outputs found

    Extreme Values of the Fiedler Vector on Trees

    Full text link
    Let GG be a connected tree on nn vertices and let L=DAL = D-A denote the Laplacian matrix on GG. The second-smallest eigenvalue λ2(G)>0\lambda_{2}(G) > 0, also known as the algebraic connectivity, as well as the associated eigenvector ϕ2\phi_2 have been of substantial interest. We investigate the question of when the maxima and minima of ϕ2\phi_2 are assumed at the endpoints of the longest path in GG. 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 ϕk\phi_k

    On localization of eigenfunctions of the magnetic Laplacian

    Full text link
    Let ΩRd\Omega \subset \mathbb{R}^d and consider the magnetic Laplace operator given by H(A)=(iA(x))2 H(A) = \left(- i\nabla - A(x)\right)^2, where A:ΩRdA:\Omega \rightarrow \mathbb{R}^d, subject to Dirichlet eigenfunction. This operator can, for certain vector fields AA, have eigenfunctions H(A)ψ=λψH(A) \psi = \lambda \psi that are highly localized in a small region of Ω\Omega. The main goal of this paper is to show that if ψ|\psi| assumes its maximum in x0Ωx_0 \in \Omega, then AA behaves `almost' like a conservative vector field in a 1/λ1/\sqrt{\lambda}-neighborhood of x0x_0 in a precise sense: we expect localization in regions where \left|\mbox{curl} A \right| is small. The result is illustrated with numerical examples

    Improved bounds for Hermite-Hadamard inequalities in higher dimensions

    Get PDF
    Let OmegasubsetmathbbRnOmega subset mathbb{R}^n be a convex domain and let f:OmegaightarrowmathbbRf:Omega ightarrow mathbb{R} be a positive, subharmonic function (i.e. Deltafgeq0Delta f geq 0). Then rac1OmegaintOmegafdxleqraccnpartialOmegaintpartialOmegafdsigma, rac{1}{|Omega|} int_{Omega}{f dx} leq rac{c_n}{ |partial Omega| } int_{partial Omega}{ f dsigma}, where cnleq2n3/2c_n leq 2n^{3/2}. This inequality was previously only known for convex functions with a much larger constant. We also show that the optimal constant satisfies cngeqn1c_n geq n-1. As a byproduct, we establish a sharp geometric inequality for two convex domains where one contains the other Omega2subsetOmega1subsetmathbbRn Omega_2 subset Omega_1 subset mathbb{R}^n: rac{|partial Omega_1|}{|Omega_1|} rac{| Omega_2|}{|partial Omega_2|} leq n.$

    Fast escape in incompressible vector fields

    No full text
    corecore