Related papers: Correlations in uniform spanning trees: a fermioni…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
New results on uniform convergence in probability for expansions of Gaussian random processes using compactly supported wavelets are given. The main result is valid for general classes of nonstationary processes. An application of the…
This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…
We derive an exact probabilistic representation for the evolution of a Hubbard model with site- and spin-dependent hopping coefficients and site-dependent interactions in terms of an associated stochastic dynamics of a collection of Poisson…
We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $\delta \mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $\delta$ goes to 0. In…
Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…
A random matrix ensemble incorporating both GUE and Poisson level statistics while respecting $U(N)$ invariance is proposed and shown to be equivalent to a system of noninteracting, confined, one dimensional fermions at finite temperature.
We study the probability distribution $F(u)$ of the maximum of smooth Gaussian fields defined on compact subsets of $\R^d$ having some geometric regularity. Our main result is a general formula for the density of $F$. Even though this is an…
We investigate the spectral statistics of an interacting fermionic system derived by projecting the Hubbard interaction onto the two lowest-energy, degenerate flat bands of the dice lattice subjected to a $\pi$-flux. Surprisingly, the…
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which arise in the study of the dimer model. We focus in particular on the relation between the dimer model on the heaxgonal lattice with a given…
Fix a bounded $3$-polygon $(\Omega; x_1, x_2, x_3)$ with three marked boundary points $x_1, x_2, x_3\in\partial\Omega$ and suppose $(\Omega^{\delta}; x_1^{\delta}, x_2^{\delta}, x_3^{\delta})$ is an approximation of $(\Omega; x_1, x_2,…
A uniform asymptotic theory of the free-space paraxial propagation of coherent flattened Gaussian beams is proposed in the limit of nonsmall Fresnel numbers. The pivotal role played by the error function in the mathematical description of…
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth, as a function of time. We consider both uniform attachment, where incoming nodes form links to existing nodes…
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…
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a…
Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…