Related papers: Gaussian Waves on the Regular Tree

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

We show that for any infinite tree of finite cone type satisfying a mild expansion condition, the only typical process on its vertices with covariance induced by the Green's function is the Gaussian wave. This generalizes a result of…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

One of the most surprising discoveries in quantum chaos was that nodal domains of eigenfunctions of quantum-chaotic billiards and maps in the semi-classical limit display critical percolation. Here we extend these studies to the level sets…

Let a family of gradient Gaussian vector fields on $ \mathbb{Z}^d $ be given. We show the existence of a uniform finite range decomposition of the corresponding covariance operators, that is, the covariance operator can be written as a sum…

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

We establish a quantitative criterion for an operator defined on a Galton-Watson random tree for having an absolutely continuous spectrum. For the adjacency operator, this criterion requires that the offspring distribution has a relative…

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact, computer simulation suggests that the bound our method…

Let $\mathcal{T}$ be a rooted tree endowed with the natural partial order $\preceq$. Let $(Z(v))_{v\in \mathcal{T}}$ be a sequence of independent standard Gaussian random variables and let $\alpha = (\alpha_k)_{k=1}^\infty$ be a sequence of…

Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq \sigma^2\leq 1$. In this paper, we present an alternative proof of this result for the edge…

We consider a family of gradient Gaussian vector fields on $\Z^d$, where the covariance operator is not translation invariant. A uniform finite range decomposition of the corresponding covariance operators is proven, i.e., the covariance…

The fermionic Gaussian operator basis provides a representation for treating strongly correlated fermion systems, as well as playing an important role in random matrix theory. We prove that a resolution of unity exists for any even…

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

For a very general class of unbounded self-adjoint operator function we prove upper bounds for eigenvalues which lie within arbitrary gaps of the essential spectrum. These upper bounds are given by triple variations. Furthermore, we find…

We consider matrix-valued processes described as solutions to stochastic differential equations of very general form. We study the family of the empirical measure-valued processes constructed from the corresponding eigenvalues. We show that…

For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (`hard constraint'), while the canonical ensemble requires the constraint to be met only…

Introducing sets of constraints, we define new classes of random-matrix ensembles, the constrained Gaussian unitary (CGUE) and the deformed Gaussian unitary (DGUE) ensembles. The latter interpolate between the GUE and the CGUE. We derive a…

The largest eigenvalue of random tensors is an important feature of systems involving disorder, equivalent to the ground state energy of glassy systems or to the injective norm of quantum states. For symmetric Gaussian random tensors of…

We develop a version of fluctuating relativistic hydrodynamics in a way very different from the usual derivation: Instead of treating it as a coarse-grained deterministic theory expanded in gradients of equilibrium quantities, we treat it…

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…