Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded) open access

On the accretivity and m-accretivity of Laplacians and porous medium-type operators on graphs

Bianchi, Davide et al. · arxiv_oai_expanded
arXiv (OAI Expanded) · Papers
Open Source ↗Direct PDF ↓
functional-analysis
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2607.09625] On the accretivity and m-accretivity of Laplacians and porous medium-type operators on graphs Skip to main content Search Submit Donate Log in Mathematics > Functional Analysis arXiv:2607.09625 (math) [Submitted on 10 Jul 2026 ( v1 ), last revised 22 Aug 2026 (this version, v2)] Title: On the accretivity and m-accretivity of Laplacians and porous medium-type operators on graphs Authors: Davide Bianchi , Matthias Keller , Alberto G. Setti , Radosław K. Wojciechowski View PDF HTML (experimental) Abstract: We study the accretivity and m-accretivity of Laplacian and porous medium-type operators on weighted graphs. In particular, we give several conditions that imply these properties for maximal operators and investigate when these operators agree with various restrictions. For porous medium-type operators on $\ell^1$ and for Laplacians on $\ell^p$ for $p \in [1,\infty)$, we show that there always exists a dense subset of the domain on which the maximal operator is m-accretive. As a consequence, we establish that accretivity, m-accretivity and injectivity of the shifted operator are all equivalent for these maximal operators. Under additional conditions on the graph, we then prove that the maximal operators are m-accretive on the entire domain, not just a dense subset. We also investigate minimal operators and show that they are m-accretive if and only if the minimal and maximal operators agree and the maximal operator is accretive. We then give some conditions that imply this agreement. Furthermore, for the minimal Laplacian on $\ell^p$, we show that accretivity and m-accretivity are not equivalent. For the $\ell^2$ case, we give connections to Markov uniqueness and essential self-adjointness. For the $\ell^\infty$ case, we establish the equivalence of stochastic completeness at infinity, m-accretivity for the maximal Laplacian on $\ell^\infty$, and m-accretivity of the minimal Laplacian on $\ell^1$. Comments: v2: further weakened the assumptions on the nonlinearity ϕ Subjects: Functional Analysis (math.FA) Cite as: arXiv:2607.09625 [math.FA] (or arXiv:2607.09625v2 [math.FA] for this version) https://doi.org/10.48550/arXiv.2607.09625 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Davide Bianchi [ view email ] [v1] Fri, 10 Jul 2026 17:23:48 UTC (65 KB) [v2] Sat, 22 Aug 2026 09:34:35 UTC (67 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: math.FA < prev | next > new | recent | 2026-07 Change to browse by: math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 664343 · SHA-256 efbd90ddf92f10bb
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive