Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Laplacians on infinite graphs: Dirichlet and Neumann boundary conditions (1103.3695v2)

Published 18 Mar 2011 in math.FA, math-ph, and math.MP

Abstract: We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard formal Laplacian and we can characterize the Dirichlet and Neumann Laplacians as the largest and smallest Markovian restrictions of the standard formal Laplacian. In the case of general graphs, this class contains the Dirichlet and Neumann Laplacians and we describe how these may differ from each other, characterize when they agree, and study connections to essential selfadjointness and stochastic completeness. Finally, we study basic common features of all Laplacians associated to a graph. In particular, we characterize when the associated semigroup is positivity improving and present some basic estimates on its long term behavior. We also discuss some situations in which the Laplacian associated to a graph is unique and, in this context, characterize its boundedness.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.