Related papers: Cayley graphs on the symmetric group generated by …

In this paper, we investigate the spectrum of a class of weighted Laplacians on Cayley graphs and determine under what conditions the corresponding eigenspaces are generically irreducible. Specifically, we analyze the spectrum on…

A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a…

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…

Stable commutator length scl_G(g) of an element g in a group G is an invariant for group elements sensitive to the geometry and dynamics of G. For any group G acting on a tree, we prove a sharp bound scl_G(g)>=1/2 for any g acting without…

The energy levels of a quantum graph with time reversal symmetry and unidirectional classical dynamics are doubly degenerate and obey the spectral statistics of the Gaussian Unitary Ensemble. These degeneracies, however, are lifted when the…

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…

In this article, we derive two spectral gap bounds for the reduced Laplacian of a general simplicial complex. Our two bounds are proven by comparing a simplicial complex in two different ways with a larger complex and with the corresponding…

We show that the infinitesimal generator of the symmetric simple exclusion process, recast as a quantum spin-1/2 ferromagnetic Heisenberg model, can be solved by elementary techniques on the complete, complete bipartite, and related…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

Let $\Gamma(G,S)$ denote the Cayley graph of a group $G$ with respect to a set $S \subset G$. In this paper, we analyze the spectral properties of the Cayley graphs $\mathcal{T}_{m,n,k} = \Gamma(\mathbb{Z}_m \ltimes_k \mathbb{Z}_n, \{(\pm…

We prove the spectral gap property for random walks on the product of two non-locally isomorphic analytic real or p-adic compact groups with simple Lie algebras, under the necessary condition that the marginals posses a spectral gap.…

Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…

Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\binom{k+1}{2}$ for each $k\in \{1,2,\cdots,n\}$, which has come to be known as…

The fundamental gap is the difference between the first two Dirichlet eigenvalues of a Schr\"odinger operator (and the Laplacian, in particular). For horoconvex domains in hyperbolic space, Nguyen, Stancu and Wei conjectured that it is…

A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the…

The first non-zero Laplacian eigenvalue $\lambda_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $\kappa$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $\lambda_1=\kappa$ is…

In this paper, we construct some non-normal Cayley graphs and explicitly provide their spectra and eigenspaces using representation theory of finite groups.

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…