Uniqueness of a solution to a general class of discrete system defined on connected graphs
Avetik Arakelyan, Farid Bozorgnia
TL;DR
This paper proves the uniqueness of solutions for a broad class of implicit discrete systems on connected graphs, inspired by spatial segregation in reaction-diffusion equations.
Contribution
It establishes a general uniqueness theorem for discrete systems on graphs, extending previous results in reaction-diffusion spatial segregation.
Findings
Uniqueness of solutions is proven for the class of systems considered.
The results apply to systems motivated by reaction-diffusion spatial segregation.
The work broadens understanding of discrete systems on connected graphs.
Abstract
In this work we prove uniqueness result for an implicit discrete system defined on connected graphs. Our discrete system is motivated from a certain class of spatial segregation of reaction-diffusion equations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical and Theoretical Epidemiology and Ecology Models · advanced mathematical theories · Differential Equations and Numerical Methods