Related papers: Spectral gap for the signed interchange process wi…
We present a theoretical interpretation of radio-frequency (RF) pairing gap experiments in trapped atomic Fermi gases, over the entire range of the BCS-BEC crossover, for temperatures above and below $T_c$. Our calculated RF excitation…
We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…
In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use…
We consider biased random walk on regular tree and we obtain the spectral radius, first return probability and $n$-step transition probability.
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of \textit{self-organized criticality}. The transience class of a sandpile is…
We calculate the excitonic optical absorption spectra of (In,Ga)As/GaAs self-assembled quantum dots by adopting an atomistic pseudopotential approach to the single-particle problem followed by a configuration-interaction approach to the…
We relate the notions of spectral gap for unitary representations and subfactors with definability of certain important sets in the corresponding structures. We give several applications of this relationship.
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
The spherical functions of the noncompact Grassmann manifolds over the real or complex numbers or the quaternions with rank q and dimension parameter p can be seen as Heckman-Opdam hypergeometric functions of type BC, when the double coset…
We consider Schr\"odinger operators with dynamically defined potentials arising from continuous sampling along orbits of strictly ergodic transformations. The Gap Labeling Theorem states that the possible gaps in the spectrum can be…
In this paper we investigate generalizations of Kazhdan's property $(T)$ to the setting of uniformly convex Banach spaces. We explain the interplay between the existence of spectral gaps and that of Kazhdan projections. Our methods employ…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
We study a random walk on the Lie algebra $\mathfrak{sl}_2(\mathbf{F}_p)$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we…
We obtain various new limit theorems for random walks on SL_2(C) under low moment conditions. For non-elementary measures with a finite second moment, we prove a Local Limit Theorem for the norm cocycle, yielding the optimal version of a…
We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…
We introduce asymptotic R\'enyi entropies as a parameterized family of invariants for random walks on groups. These invariants interpolate between various well-studied properties of the random walk, including the growth rate of the group,…
We introduce a general Bayesian framework for graph matching grounded in a new theory of exchangeable random permutations. Leveraging the cycle representation of permutations and the literature on exchangeable random partitions, we define,…
We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random nxn matrix L defined by L(j,k)=X(j,k) if k<>j and…