Difference Equations on Weighted Graphs
Journal of convex analysis, Tome 12 (2005) no. 1, pp. 13-44
Voir la notice de l'article provenant de la source Heldermann Verlag
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.
Classification :
05C35, 90C35, 05C40, 35R30, 94C12
Mots-clés : Connected graphs, connectivity, variational inequalities, discrete maximum principles, Markov chains
Mots-clés : Connected graphs, connectivity, variational inequalities, discrete maximum principles, Markov chains
@article{JCA_2005_12_1_JCA_2005_12_1_a1,
author = {A. Bensoussan and J.-L. Menaldi},
title = {Difference {Equations} on {Weighted} {Graphs}},
journal = {Journal of convex analysis},
pages = {13--44},
publisher = {mathdoc},
volume = {12},
number = {1},
year = {2005},
url = {http://geodesic.mathdoc.fr/item/JCA_2005_12_1_JCA_2005_12_1_a1/}
}
A. Bensoussan; J.-L. Menaldi. Difference Equations on Weighted Graphs. Journal of convex analysis, Tome 12 (2005) no. 1, pp. 13-44. http://geodesic.mathdoc.fr/item/JCA_2005_12_1_JCA_2005_12_1_a1/