Abstract
In discrete systems graphs setting, we mimic the variational formulation of boundary value problems. Working on with un- normalized weights rather than normalized weights, discrete Dirichlet and Neumann problems, and their probabilistic interpretations are discussed. Moreover, non-symmetric forms, non-variational setting, and an identification problem are also considered. © Heldermann Verlag.
| Original language | English |
|---|---|
| Pages (from-to) | 13-44 |
| Journal | Journal of Convex Analysis |
| Volume | 12 |
| Issue number | 1 |
| Publication status | Published - 2005 |
| Externally published | Yes |
Research Keywords
- Connected graphs
- Connectivity
- Discrete maximum principles
- Markov chains
- Variational inequalities