Related papers: Volume growth and spectrum for general graph Lapla…

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

We show that for any Riemannian foliation with a simply connected and negatively curved leaf space the normal exponential map of a leaf is a diffeomorphism. As an application, if the leaves are furthermore minimal submanifolds, we give a…

We study average growth of the spectral function of the Laplacian on a Riemannian manifold. Two types of averaging are considered: with respect to the spectral parameter and with respect to a point on a manifold. We obtain as well related…

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

We study a discrete Laplace operator $\Delta$ on percolation subgraphs of an infinite graph. The ball volume is assumed to grow at most polynomially. We are interested in the behavior of the integrated density of states near the lower…

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…

The purpose of this paper is to point out that `supremum' in two inequalities of Brooks should be replaced with `infimum'. The results of this paper are already known by Professor Higuci. Hence, I want to delete this paper from this…

It is conjectured that the Laplacian spectrum of a graph is majorized by its conjugate degree sequence. In this paper, we prove that this majorization holds for a class of graphs including trees. We also show that a generalization of this…

Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…

Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.

We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…

For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…

To some extent, graph evolutionary mechanisms can be explained by its spectra. Here, we are interested in two graph operations, namely, motif (subgraph) doubling and attachment that are biologically relevant. We investigate how these two…

Let $G=\left( V\left( G\right) ,E\left( G\right) \right) $ be an $\left( n,m\right) $-graph and $X$ a nonempty proper subset of $V\left( G\right) $. Let $X^{c}=V\left( G\right) \backslash X$.\ The edge density of $X$ in $G$ is given by…

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a $m$-dimensional submanifold $M$ in $R^d$ as the sample size $n$ increases and the neighborhood size $h$ tends to zero. We show…

We obtain area growth estimates for constant mean curvature graphs in $\mathbb{E}(\kappa,\tau)$-spaces with $\kappa\leq 0$, by finding sharp upper bounds for the volume of geodesic balls in $\mathbb{E}(\kappa,\tau)$. We focus on complete…

The behavior of a certain random growth process is analyzed on arbitrary regular and non-regular graphs. Our argument is based on the Expander Mixing Lemma, which entails that the results are strongest for Ramanujan graphs, which…

We give an approximation algorithm for non-uniform sparsest cut with the following guarantee: For any $\epsilon,\delta \in (0,1)$, given cost and demand graphs with edge weights $C, D$ respectively, we can find a set $T\subseteq V$ with…

Given a length function on the edge set of a finite graph, we define a vertex-weight and an edge-weight in terms of it and consider the corresponding graph Laplacian. In this paper, we consider the problem of maximizing the first nonzero…