Related papers: On high-girth expander graphs with localized eigen…

In this paper, a new higher Hochschild Complex is defined with an Iterated Integral map to locally model differential forms on the space of bigons on $M$. In particular, given the local data for a gerbe with structure 2-group given by a…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

These are expended notes of my talk at the summer institute in algebraic geometry (Seattle, July-August 2005), whose main purpose is to present a global overview on the theory of higher and derived stacks. This text is far from being…

We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.

Let $G$ be a connected graph of order $n$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is the mean of all eccentricities in $G$. We give upper bounds on the…

In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…

We introduce a method to embed edge-colored graphs into families of expander graphs, which generalizes a framework developed by Dragani\'c, Krivelevich, and Nenadov (2022). As an application, we show that each family of sufficiently…

Let $G$ be a graph and $S\subseteq V(G)$. If every two adjacent vertices of $G$ have different metric $S$-representations, then $S$ is a local metric generator for $G$. A local metric generator of smallest order is a local metric basis for…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

We use a randomised embedding method to prove that for all \alpha>0 any sufficiently large oriented graph G with minimum in-degree and out-degree \delta^+(G),\delta^-(G)\geq (3/8+\alpha)|G| contains every possible orientation of a Hamilton…

This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published literature only covers graphs of up to degree 7. The approach…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

We show that any connected regular graph with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular, and in particular that it is a generalized odd graph.

Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on…

Here we introduce connectivity operators, namely, diffusion operators, general Laplacian operators, and general adjacency operators for hypergraphs. These operators are generalisations of some conventional notions of apparently different…

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

The purpose of this survey is to describe how locally compact groups can be studied as geometric objects. We will emphasize the main ideas and skip or just sketch most proofs, often referring the reader to our much more detailed book…

We generalize the zig-zag product construction to produce infinite families of regular graphs of any constant degree. We analyze the second largest eigenvalue of this new zig-zag product to show that the modified zig-zag product of good…

There has been significant recent interest in graph-based nearest neighbor search methods, many of which are centered on the construction of navigable graphs over high-dimensional point sets. A graph is navigable if we can successfully move…

We investigate a descent on simple graphs, starting with the complete graph on $n$ vertices and ending up with the cycle graph by removing one edge after another. We obtain quantitative results showing that graphs with large diameter must…