Related papers: Quantum ergodicity on large regular graphs

We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…

We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by…

We establish an abstract local ergodic theorem, under suitable space-time scaling, for the (boundary-driven) symmetric exclusion process on an increasing sequence of balls covering an infinite weighted graph. The proofs are based on 1-block…

This paper is dedicated to the proof of a Quantum Ergodicity (QE) theorem for the eigenfunctions of subLaplacians on contact metric manifolds, under the assumption that the Reeb flow is ergodic. To do so, we rely on a semiclassical…

The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…

We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.

In this paper, we investigate capacity preserving transformations and their ergodicity. We show that for any measurable transformation $\theta$ there always exists a $\theta$-invariant capacity. We investigate some limit properties under…

We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…

We examine the consequences of classical ergodicity for the localization properties of individual quantum eigenstates in the classical limit. We note that the well known Schnirelman result is a weaker form of quantum ergodicity than the one…

Uncertainty principles present an important theoretical tool in signal processing, as they provide limits on the time-frequency concentration of a signal. In many real-world applications the signal domain has a complicated irregular…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…

First theoretical and numerical results on the global structure of the energy shell, the Green function spectra and the eigenfunctions, both localized and ergodic, in a generic conservative quantum system are presented. In case of quantum…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

We prove a quantum ergodic restriction theorem for the Cauchy data of a sequence of quantum ergodic eigenfunctions on a hypersurface $H$ of a Riemannian manifold $(M, g)$. The technique of proof is to use a Rellich type identity to relate…

A finite group $G$ is called $C$-quasirandom (by Gowers) if all non-trivial irreducible complex representations of $G$ have dimension at least $C$. For any unit $\ell^{2}$ function on a finite group we associate the quantum probability…

We prove a new quantum variance estimate for toral eigenfunctions. As an application, we show that, given any orthonormal basis of toral eigenfunctions and any smooth embedded hypersurface with nonvanishing principal curvatures, there…

We investigate the rate of decrease at infinity of eigenfunctions of quantum graphs by using Agmon's method to prove $L^2$ and $L^\infty$ bounds on the product of an eigenfunction with the exponential of a certain metric. A generic result…

We develop a Perron-Frobenius type theory for products of random quantum channels acting on finite-dimensional matrix algebras sampled from a stationary and ergodic stochastic process, which, in keeping with the literature, we call ergodic…

A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…