SearcharxivSearch

arXiv · 2511.03402

Uniqueness of the second eigenspace of the interchange process

Abstract

The spectral gap theorem of Caputo, Liggett, and Richthammer states that on any connected weighted graph, the second eigenvalue of the interchange process equals the second eigenvalue of the random walk process. We characterize the corresponding eigenspace in the regular representation of the symmetric group. Except when the graph is a $4$-cycle whose four edge weights are equal, the entire second eigenspace lies in the direct sum of copies of the standard representation and is generated by copies of the second eigenspace of the random-walk Laplacian. The proof refines the octopus induction scheme by isolating the summand of the restricted representation that can support equality, and analyzing it in explicit two-subset and exterior-square coordinates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dennis Belotserkovskiy, Joe P. Chen. 2025-11-05. Uniqueness of the second eigenspace of the interchange process. https://arxiv.org/abs/2511.03402

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR