The combinatorial Laplacian operator on graphs may be viewed as a discrete analogue of the classical Laplacian operator. Therefore, the combinatorial Laplacian operator and the problems related to the combinatorial PDEs on graphs find importance in the study of “analysis on graphs”. We have solved discrete analogues of certain known results of classical PDEs. Also observed some of the similarities and the differences of these results with the classical results. Finally we will discuss some of the related problems for future research.
Date and Time : 04-04-2017 TBA
Venue : Seminar Hall, 219 @ CET
Speaker : Sumit Mohanty, NISER Bhubaneswar