Polyharmonic Functions for Finite Graphs and Markov Chains

Thomas Hirschler () and Wolfgang Woess ()
Additional contact information
Thomas Hirschler: Technische Universität Graz, Institut für Diskrete Mathematik
Wolfgang Woess: Technische Universität Graz, Institut für Diskrete Mathematik

A chapter in Frontiers in Analysis and Probability, 2020, pp 77-90 from Springer

Abstract: Abstract On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a λ-polyharmonic function is a complex function f on the vertex set which satisfies (λ ⋅ I − P)nf(x) = 0 at each interior vertex. Here, P may be the normalised adjacency 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 is 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, Colonna, Gowrisankaran and Singman, and more recently, by Picardello and Woess.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-56409-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9783030564094

DOI: 10.1007/978-3-030-56409-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().