Related papers: Bi-Laplacians on graphs and networks
We study combinatorial Laplacians on rectangular subgraphs of $ \epsilon \mathbb{Z}^2 $ that approximate Laplace-Beltrami operators of Riemannian metrics as $ \epsilon \rightarrow 0 $. These laplacians arise as follows: we define the notion…
We prove optimal regularity results in $L_p$-based function spaces in space and time for a large class of linear parabolic equations with a nonlocal elliptic operator in bounded domains with limited smoothness. Here the nonlocal operator is…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
In this paper, we present an $L_q(L_p)$-regularity theory for parabolic equations of the form: $$ \partial_t u(t,x)=\mathcal{L}^{\vec{a},\vec{b}}(t)u(t,x)+f(t,x),\quad u(0,x)=0. $$ Here, $\mathcal{L}^{\vec{a},\vec{b}}(t)$ represents…
Hypergraphs extend traditional graphs by enabling the representation of N-ary relationships through higher-order edges. Akin to a common approach of deriving graph Laplacians, we define function spaces and corresponding symmetric products…
We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We…
We show that a discrete harmonic function which is bounded on a large portion of a periodic planar graph is constant. A key ingredient is a new unique continuation result for the weighted graph Laplacian. The proof relies on the structure…
We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and of bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of…
We put together a general framework to deal with elliptic and parabolic equations associated with (nonlinear) nonlocal (fractional order) operators. Many well-known nonlocal operators enter into our framework, and in addition one may…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
In this work we investigate the well-posedness for difussion equations associated to subelliptic pseudo-differential operators on compact Lie groups. The diffusion by strongly elliptic operators is considered as a special case and in…
We consider a strongly elliptic differential expression of the form $b(D)^* g(x/\varepsilon) b(D)$, $\varepsilon >0$, where $g(x)$ is a matrix-valued function in ${\mathbb R}^d$ assumed to be bounded, positive definite and periodic with…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
We revisit miscellaneous linear differential operators mostly associated with lattice Green functions in arbitrary dimensions, but also Calabi-Yau operators and order-seven operators corresponding to exceptional differential Galois groups.…
For an elliptic, semilinear differential operator of the form $S(u) = A : D^2 u + b(x, u , Du)$, consider the functional $E_\infty(u) = \mathop{\mathrm{ess \, sup}}_\Omega |S(u)|$. We study minimisers of $E_\infty$ for prescribed boundary…
We study the Laplacian operator of an uncorrelated random network and, as an application, consider hopping processes (diffusion, random walks, signal propagation, etc.) on networks. We develop a strict approach to these problems. We derive…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
We investigate discrete fractional Laplacians defined on the half-lattice in several dimensions, allowing possibly different fractional orders along each coordinate direction. By expressing the half-lattice operator as a boundary…