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.

Author information

Contact details are reproduced from the original publication and may be historical.

José-Luis Menaldi

Wayne State University, Dept. of Mathematics, Detroit, MI 48202, U.S.A.

jlm@math.wayne.edu

Keywords

  • Connected graphs
  • connectivity
  • variational inequalities
  • discrete maximum principles
  • Markov chains

Mathematics Subject Classification

05C35, 90C35; 05C40, 35R30, 94C12

References

  1. C. Berenstein, S. Y. Chung: ω-harmonic functions and inverse conductivity problems on networks, to be published.Google Scholar
  2. F. Chung, S. T. Yau: Discrete Green’s function, J. Comb. Theory, Ser. A 91 (2000) 191–214.https://doi.org/10.1006/jcta.2000.3094Google Scholar
  3. J. L. Doob: Stochastic Processes, Wiley, New York (1953).Google Scholar
  4. J. L. Lions: Equations Differentielles Operationnelles et Problèmes aux Limites, Springer, Berlin (1961).https://doi.org/10.1007/978-3-662-25839-2Google Scholar

Suggested citation

A. Bensoussan, J.-L. Menaldi. “Difference Equations on Weighted Graphs.” Journal of Convex Analysis 12 (2005), No. 1, 13–44. https://doi.org/10.68381/jca12002

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2005. Rights now held by Banach Press LLC.