The L^2-strong maximum principle on arbitrary countable networks

DOI10.1016/J.LAA.2011.03.001zbMATH Open1221.35082arXiv0902.0251OpenAlexW2127471391MaRDI QIDQ551289FDOQ551289

Authors: Stefano Cardanobile 

Publication date: 15 July 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We study the strong maximum principle for the heat equation associated with the Dirichlet form on countable networks. We start by analyzing the boundedness properties of the incidence operators on a countable network. Subsequently, we prove that the strong maximum principle is equivalent to the underlying graph being connected after deletion of the nodes with infinite degree. Using this result, we prove that the number of connected components of the graph with respect to the heat flow equals the number of maximal invariant ideals of the adjacency matrix.

Full work available at URL: https://arxiv.org/abs/0902.0251

Recommendations

• scientific article; zbMATH DE number 66735
• The strong maximum principle for the heat equation
• A maximum principle for node voltages in finitely structured, transfinite, electrical networks
• A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
• On a strong maximum principle for Dirichlet forms

zbMATH Keywords

irreducibilityquantum graphsgraph Laplacianinfinite networks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Maximum principles in context of PDEs (35B50) Heat equation (35K05)

Cites Work

• Variational and semigroup methods for waves and diffusion in networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Can One Hear the Shape of a Drum?
• An index theory for uniformly locally finite graphs
• The spectrum of an infinite graph
• Harmonic functions on locally finite networks
• Can one hear the shape of a network?
• Title not available (Why is that?)
• Recurrent networks and a theorem of Nash-Williams
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Diffusion systems and heat equations on networks
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• The length of an extremal network in a normed space: Maxwell formula
• Parabolic theory of the discrete \(p\)-Laplace operator
• The generalized strong isoperimetric inequality in locally finite networks
• Dynamical systems associated with adjacency matrices

This page was built for publication: The \(L^2\)-strong maximum principle on arbitrary countable networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551289)