arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1901.08376math.PR
收藏

有限图与马尔可夫链的多重调和函数

Polyharmonic functions for finite graphs and Markov chains

Thomas Hirschler, Wolfgang Woess

摘要:

在一个有限图上,顶点集被划分为内部顶点和边界顶点,$λ$ -多调和函数是顶点集上的一个复函数$f$,它在每个内部顶点处满足$(λ\cdot I - P)^n f(x) = 0$。这里,$P$可以是归一化邻接矩阵,但更一般地,我们考虑任意马尔可夫链的转移阵$P$,(定向)图结构适用于该转移矩阵。在描述这些“全球”多调和函数,我们转向解决Riquier问题,其中$n$边界函数预先分配和相应的“塔”的$n$连续Dirichlet型问题得到解决。所得到的唯一解将仅在距离边界至少为$n$的那些点处是多调和的。最后,我们比较这些结果与那些关于无限树的结束边界,研究科恩,Colonnna,Gowrisankaran和Singman,最近,皮卡德罗和Woess。

英文摘要:

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 $(λ\cdot I - P)^n f(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑