Related papers: Diagonal Compressed Random Variables in a Graph W*…

We show that a locally finite, connected graph has a coarse embedding into a Hilbert space if and only if there exist bond percolations with arbitrarily large marginals and two-point function vanishing at infinity. We further show that the…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

Given a hypergraph $\Gamma=(\Omega,\mathcal{X})$ and a sequence $\mathbf{p} = (p_\omega)_{\omega\in \Omega}$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega$ obtained by keeping every vertex $\omega$…

We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…

We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…

We address the question of the asymptotic description of random tensors that are local-unitary invariant, that is, invariant by conjugation by tensor products of independent unitary matrices. We consider both the mixed case of a tensor with…

$C_\infty$ Algebras and their morphisms are a framework in which one can study algebras and their maps that are not commutaive-associative but are homotopic to being that. In statistics cumulants measure the independence of random…

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…

Deep learning models have significantly improved the visual quality and accuracy on compressive sensing recovery. In this paper, we propose an algorithm for signal reconstruction from compressed measurements with image priors captured by a…

We give the first non-trivial decremental dynamic embedding of a weighted, undirected graph $G$ into $\ell_p$ space. Given a weighted graph $G$ undergoing a sequence of edge weight increases, the goal of this problem is to maintain a…

In condensed-matter, level statistics has long been used to characterize the phases of a disordered system. We provide evidence within the context of a simple model that in a disordered large-N gauge theory with a gravity dual, there exist…

In this paper, we mainly study the random sampling stability for signals in a weighted reproducing kernel subspace of $L_\nu^p(\mathbb{R}^d)$ without the additional requirement that the kernel function has symmetry. The sampling set is…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous paper (arXiv:0903.4730) that considering the connected components of G(n,p) as a…

W-transforms are introduced as uniformity-preserving univariate transformations on the unit interval induced by distribution functions and piecewise strictly monotone functions, and their properties are investigated. When applied…

We introduce a dynamic mechanism for the solution of analytically-tractable substructure in probabilistic programs, using conjugate priors and affine transformations to reduce variance in Monte Carlo estimators. For inference with…

This paper is devoted to studying $R$-diagonal and $\eta$-diagonal pairs of random variables. We generalize circular elements to the bi-free setting, defining bi-circular element pairs of random variables, which provide examples of…

We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…

The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on…

Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…