Related papers: Gaussian Waves on the Regular Tree

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…

We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…

Motivated by certain problems of statistical physics we consider a stationary stochastic process in which deterministic evolution is interrupted at random times by upward jumps of a fixed size. If the evolution consists of linear decay, the…

We introduce a family of generalized d'Alembertian operators in D-dimensional Minkowski spacetimes which are manifestly Lorentz-invariant, retarded, and non-local, the extent of the nonlocality being governed by a single parameter $\rho$.…

We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…

The remarkable universality of the eigenvalue correlation functions is perhaps one of the most salient findings in random matrix theory. Particularly for short-range separations of the eigenvalues, the correlation functions have been shown…

We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

A recent line of work has shown remarkable behaviors of the generalization error curves in simple learning models. Even the least-squares regression has shown atypical features such as the model-wise double descent, and further works have…

For the Gaussian free field on a $(d + 1)$-regular tree with $d \geq 2$, we study the percolative properties of its level sets in the critical and the near-critical regime. In particular, we show the continuity of the percolation…

We study an ensemble of random matrices (the Rosenzweig-Porter model) which, in contrast to the standard Gaussian ensemble, is not invariant under changes of basis. We show that a rather complete understanding of its level correlations can…

We discuss a family of time-reversible, scale-invariant diffusions with singular coefficients. In analogy with the standard Gaussian theory, a corresponding family of generalized characteristic functions provides a useful tool for proving…

We discuss the Pointwise Ergodic Theorem for the Gaussian divisor function $d(n)$, that is, for a measure preserving $\mathbb Z[i]$ action $T$, the limit $$\lim_{N\rightarrow \infty} \frac{1}{D(N)} \sum _{\mathscr{N} (n) \leq N} d(n)…

We consider two non-Gaussian ensembles of large Hermitian random matrices with strong level confinement and show that near the soft edge of the spectrum both scaled density of states and eigenvalue correlations follow so-called Airy laws…

We consider the uniform random $d$-regular graph on $N$ vertices, with $d \in [N^\alpha, N^{2/3-\alpha}]$ for arbitrary $\alpha > 0$. We prove that in the bulk of the spectrum the local eigenvalue correlation functions and the distribution…

We give an approximation algorithm for MaxCut and provide guarantees on the average fraction of edges cut on $d$-regular graphs of girth $\geq 2k$. For every $d \geq 3$ and $k \geq 4$, our approximation guarantees are better than those of…

We consider inhomogeneous Erd\H{o}s-R\'enyi graphs. We suppose that the maximal mean degree $d$ satisfies $d \ll \log n$. We characterize the asymptotic behavior of the $n^{1 - o(1)}$ largest eigenvalues of the adjacency matrix and its…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

For each $n \ge 1$, let $\mathrm{d}^n=(d^{n}(i),1 \le i \le n)$ be a sequence of positive integers with even sum $\sum_{i=1}^n d^n(i) \ge 2n$. Let $(G_n,T_n,\Gamma_n)$ be uniformly distributed over the set of simple graphs $G_n$ with degree…