Related papers: Generic Laplace eigenfunctions on metric graphs
Recently, Bollob\'as, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with $\Theta(n)$ edges. Roughly speaking, there is one model for each {\em kernel}, i.e., each symmetric…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
Consider a smooth closed surface $M$ of fixed genus $\geqslant 2$ with a hyperbolic metric $\sigma$ of total area $A$. In this article, we study the behavior of geometric and dynamical characteristics (e.g., diameter, Laplace spectrum,…
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…
We consider Laplacians on periodic both discrete and metric equilateral graphs. Their spectrum consists of an absolutely continuous part (which is a union of non-degenerate spectral bands) and flat bands, i.e., eigenvalues of infinite…
We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equations that we study…
We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions.
We prove upper bounds on the $L^p$ norms of eigenfunctions of the discrete Laplacian on regular graphs. We then apply these ideas to study the $L^p$ norms of joint eigenfunctions of the Laplacian and an averaging operator over a finite…
We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…
We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
For a simple graph $G$ with $n$ vertices, $m$ edges and signless Laplacian eigenvalues $q_{1} \geq q_{2} \geq \cdots \geq q_{n} \geq 0$, its the signless Laplacian energy $QE(G)$ is defined as $QE(G) = \sum_{i=1}^{n}|q_{i} - \bar{d} |$,…
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…
The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by…
We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as…