Related papers: Broadcasting with Random Matrices
Generative models have enjoyed widespread success in a variety of applications. However, they encounter inherent mathematical limitations in modeling distributions where samples are constrained by equalities, as is frequently the setting in…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
The Griffiths first and second inequalities have played an important role in the analysis of ferromagnetic models. In spin-glass models, although the counterpart of the Griffiths first inequality has been obtained, the counterpart of the…
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite…
Given a random binary picture $P_n$ of size $n$, i.e., an $n\times n$ grid filled with zeros and ones uniformly at random, when is it possible to reconstruct $P_n$ from its $k$-deck, i.e., the multiset of all its $k\times k$ subgrids? We…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
We introduce and study the problem of posterior inference on tree-structured graphical models in the presence of a malicious adversary who can corrupt some observed nodes. In the well-studied broadcasting on trees model, corresponding to…
We consider random instances of non-convex perceptron problems in the high-dimensional limit of a large number of examples $M$ and weights $N$, with finite load $\alpha = M/N$. We develop a formalism based on replica theory to predict the…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
V. Levenshtein first proposed the sequence reconstruction problem in 2001. This problem studies the model where the same sequence from some set is transmitted over multiple channels, and the decoder receives the different outputs. Assume…
The probability distribution of lens image separations is calculated for the ``standard'' gravitational lensing statistics model in an arbitrary, flat Robertson-Walker universe, where lensing galaxies are singular isothermal spheres that…
We introduce a method to reconstruct an element of a Hilbert space in terms of an arbitrary finite collection of linearly independent reconstruction vectors, given a finite number of its samples with respect to any Riesz basis. As we…
We consider Erd\H{o}s-R\'{e}nyi graphs $G(n,p_n)$ with large constant expected degree $\lambda$ and $p_n=\lambda/n$. Bordenave and Lelarge (2010) showed that the infinite-volume limit, in the Benjamini-Schramm topology, is a Galton-Watson…
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…
The evolution of aligned DNA sequence sites is generally modeled by a Markov process operating along the edges of a phylogenetic tree. It is well known that the probability distribution on the site patterns at the tips of the tree…
This thesis deals with applications of experimental mathematics to a number of problems. The first problem is related to random graph statistics. We consider a certain class of Galton-Watson random trees and look at the total height…
Background: We study the statistical properties of fragment coverage in genome sequencing experiments. In an extension of the classic Lander-Waterman model, we consider the effect of the length distribution of fragments. We also introduce…
Several real-world and abstract structures and systems are characterized by marked hierarchy to the point of being expressed as trees. Because the study of these entities often involves sampling (or discovering) the tree nodes in a specific…