Related papers: Nodal Replication of Planar Random Waves

In this paper, we characterize the asymptotic and large scale behavior of the eigenvalues of wavelet random matrices in high dimensions. We assume that possibly non-Gaussian, finite-variance $p$-variate measurements are made of a…

This paper discusses the enumeration of two-terminal series-parallel networks, i.e. the number of electrical networks built with n identical elements connected in series or parallel with two-terminal nodes. They frequently occur in applied…

Markov random fields are used to model high dimensional distributions in a number of applied areas. Much recent interest has been devoted to the reconstruction of the dependency structure from independent samples from the Markov random…

The renormalization group and operator product expansion are applied to the model of a passive scalar quantity advected by the Gaussian self-similar velocity field with finite, and not small, correlation time. The inertial-range energy…

This paper investigates the approximation power of three types of random neural networks: (a) infinite width networks, with weights following an arbitrary distribution; (b) finite width networks obtained by subsampling the preceding…

Wright-Fisher diffusions and their dual ancestral graphs occupy a central role in the study of allele frequency change and genealogical structure, and they provide expressions, explicit in some special cases but generally implicit, for the…

In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…

We show the existence of 1-parameter families of non-periodic, complete, embedded minimal surfaces in euclidean space with infinitely many parallel planar ends. In particular we are able to produce finite genus examples and quasi-periodic…

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…

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

Let $\Omega\subset \mathbb{R}^N$, $N=1,2,3$, be an open bounded and connected set with continuous piecewise $\mathrm{C}^{\infty}$ boundary. Here we deal with almost periodic distributions of the form $u(t,x)=\sum_{n=0}^{+\infty} c_n S_n(x)…

We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…

We consider a single particle spectrum as given by the eigenvalues of the Wigner-Dyson ensembles of random matrices, and fill consecutive single particle levels with n fermions. Assuming that the fermions are non-interacting, we show that…

We consider the Anderson Hamiltonian (AH) and the parabolic Anderson model (PAM) with white noise and Dirichlet boundary condition on a bounded planar domain $D\subset\mathbb R^2$. We compute the small time asymptotics of the AH's…

The Ewens-Pitman model refers to a distribution for random partitions of $[n]=\{1,\ldots,n\}$, which is indexed by a pair of parameters $\alpha \in [0,1)$ and $\theta>-\alpha$, with $\alpha=0$ corresponding to the Ewens model in population…

In this article, we investigate an inverse problem for a semi-linear wave equation posed on bounded domain in $\mathbb{R}^{n+1}$, with $n \geq 2$. Our primary objective is to reconstruct the damping coefficient, the linear and nonlinear…

The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P, up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

Random graph alignment refers to recovering the underlying vertex correspondence between two random graphs with correlated edges. This can be viewed as an average-case and noisy version of the well-known graph isomorphism problem. For the…

Let $F$ be a totally real field. We study the root numbers $\epsilon(1/2, \pi)$ of self-dual cuspidal automorphic representations $\pi$ of $\mathrm{GL}_{2N}/F$ with conductor $\mathfrak n$ and regular integral infinitesimal character…