Related papers: Aldous property for full-flag Johnson graphs

Let $S_n$ denote the symmetric group on $n$ elements, and $\Sigma\subseteq S_{n}$ a symmetric subset of permutations. Aldous' spectral gap conjecture, proved by Caputo, Liggett and Richthammer [arXiv:0906.1238], states that if $\Sigma$ is a…

Aldous' spectral gap conjecture states that the second largest eigenvalue of any connected Cayley graph on the symmetric group Sn with respect to a set of transpositions is achieved by the standard representation of Sn. This celebrated…

We prove an analog of Aldous' spectral gap conjecture in the generalized symmetric groups $G\wr S_n$ where $G$ is an arbitrary finite group. Moreover, we show that Caputo's extension of the conjecture to hypergraphs transfers to these…

In their celebrated paper (arXiv:0906.1238), Caputo, Liggett and Richthammer proved Aldous' conjecture and showed that for an arbitrary finite graph, the spectral gap of the interchange process is equal to the spectral gap of the underlying…

We introduce and study a variant of the family of Johnson graphs, the Full-Flag Johnson graphs. We show that Full-Flag Johnson graphs are Cayley graphs on S_n generated by certain classes of permutations, and that they are in fact…

Let $G$ be a graph on $n$ vertices. The $k$-token graph (or symmetric $k$-th power) of $G$, denoted by $F_k(G)$ has as vertices the ${n\choose k}$ $k$-subsets of vertices from $G$, and two vertices are adjacent when their symmetric…

A conjecture by D. Aldous, which can be formulated as a statement about the first nontrivial eigenvalue of the Laplacian of certain Cayley graphs on the symmetric group generated by transpositions, has been recently proven by Caputo,…

We show that the spectral-gap of a general zero range process can be controlled in terms of the spectral-gap of a single particle. This is in the spirit of Aldous' famous spectral-gap conjecture for the interchange process. Our main…

It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…

A Cayley graph on the symmetric group $S_n$ is said to have the Aldous property if its strictly second largest eigenvalue (that is, the largest eigenvalue strictly smaller than the degree) is attained by the standard representation of…

We show that the spectral gap for the interchange process (and the symmetric exclusion process) in a $d$-dimensional box of side length $L$ is asymptotic to $\pi^2/L^2$. This gives more evidence in favor of Aldous's conjecture that in any…

We consider the interchange process (IP) on the $d$-dimensional, discrete hypercube of side-length $n$. Specifically, we compare the spectral gap of the IP to the spectral gap of the random walk (RW) on the same graph. We prove that the two…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

We give a spectral gap characterization of fullness for type $\mathrm{III}$ factors which is the analog of a theorem of Connes in the tracial case. Using this criterion, we generalize a theorem of Jones by proving that if $M$ is a full…

We study equitable 2-partitions of the Johnson graphs J(n,w) with a quotient matrix containing the eigenvalue lambda_2(w,n) = (w-2)(n-w-2)-2 in its spectrum. For any w>=4 and n>=2w, we find all admissible quotient matrices of such…

This paper, and its companion [BCV24], are devoted to a negative resolution of the Aldous--Lyons Conjecture [AL07, Ald07]. This conjecture, originated in probability theory, is well known (cf. [Gel18]) to be equivalent to the statement that…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

In 1983, Conway-Gordon showed that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices,…

A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is…

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…