IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-56409-4_4.html
   My bibliography  Save this book chapter

Polyharmonic Functions for Finite Graphs and Markov Chains

In: Frontiers in Analysis and Probability

Author

Listed:
  • Thomas Hirschler

    (Technische Universität Graz, Institut für Diskrete Mathematik)

  • Wolfgang Woess

    (Technische Universität Graz, Institut für Diskrete Mathematik)

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.

Suggested Citation

  • Thomas Hirschler & Wolfgang Woess, 2020. "Polyharmonic Functions for Finite Graphs and Markov Chains," Springer Books, in: Nalini Anantharaman & Ashkan Nikeghbali & Michael Th. Rassias (ed.), Frontiers in Analysis and Probability, pages 77-90, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-56409-4_4
    DOI: 10.1007/978-3-030-56409-4_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-56409-4_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.