Polyharmonic Functions for Finite Graphs and Markov Chains

From MaRDI portal
Publication:3384286

DOI10.1007/978-3-030-56409-4_4zbMATH Open1483.31034arXiv1901.08376OpenAlexW2912690489MaRDI QIDQ3384286FDOQ3384286

Wolfgang Woess, Thomas Hirschler

Publication date: 15 December 2021

Published in: Frontiers in Analysis and Probability (Search for Journal in Brave)

Abstract: On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a lambda-polyharmonic function is a complex function f on the vertex set which satisfies (lambdacdotIP)nf(x)=0 at each interior vertex. Here, P may be the normalised adjaceny matrix, but more generally, we consider the transition matrix P of an arbitrary Markov chain to which the (oriented) graph structure is adapted. After describing these `global' polyharmonic functions, we turn to solving the Riquier problem, where n boundary functions are preassigned and a corresponding `tower' of n successive Dirichlet type problems are solved. The resulting unique solution will be polyharmonic only at those points which have distance at least n from the boundary. Finally, we compare these results with those concerning infinite trees with the end boundary, as studied by Cohen, Colonnna, Gowrisankaran and Singman, and more recently, by Picardello and Woess.


Full work available at URL: https://arxiv.org/abs/1901.08376





Cites Work


Cited In (2)






This page was built for publication: Polyharmonic Functions for Finite Graphs and Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384286)