Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bi-Laplacians on graphs and networks

Published 20 Dec 2017 in math.AP | (1712.07370v3)

Abstract: We study the differential operator $A=\frac{d4}{dx4}$ acting on a connected network $\mathcal{G}$ along with $\mathcal L2$, the square of the discrete Laplacian acting on a connected discrete graph $\mathsf{G}$. For both operators we discuss well-posedness of the associated {linear} parabolic problems [ \frac{\partial u}{\partial t}=-Au,\qquad\frac{df}{dt}=-\mathcal L2 f, ] on $Lp(\mathcal{G})$ or $\ellp(\mathsf{V})$, respectively, for $1\leq p\leq\infty$. In view of the well-known lack of parabolic maximum principle for all elliptic differential operators of order $2N$ for $N>1$, our most surprising finding is that, after some transient time, the parabolic equations driven by $-A$ may display Markovian features, depending on the imposed transmission conditions in the vertices. Analogous results seem to be unknown in the case of general domains and even bounded intervals. Our analysis is based on a detailed study of bi-harmonic functions complemented by simple combinatorial arguments. We elaborate on analogous issues for the discrete bi-Laplacian; a characterization of complete graphs in terms of the Markovian property of the semigroup generated by $-\mathcal L2$ is also presented.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.