Related papers: Spectra of large diluted but bushy random graphs
The unconstrained exponential family of random graphs assumes no prior knowledge of the graph before sampling, but it is natural to consider situations where partial information about the graph is known, for example the total number of…
In a recent study we have obtained correction terms to the large N asymptotic expansions of the eigenvalue density for the Gaussian unitary and Laguerre unitary ensembles of random N by N matrices, both in the bulk and at the soft edge of…
Various important and useful quantities or measures that characterize the topological network structure are usually investigated for a network, then they are averaged over the samples. In this paper, we propose an explicit representation by…
We study the pressure of the "edge-triangle model", which is equivalent to the cumulant generating function of triangles in the Erd\"os-R\'enyi random graph. By analyzing finite graphs of increasing volume, as well as the graphon…
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime, the limiting free energy exists together…
Upper exponential inequalities for the tail probabilities of the centered and normalized number of triangles in the Erd\"{o}s-R\'{e}nyi graph are obtained, where the probability of every edge is fixed. The result is formulated in terms of…
We study the asymptotic shape of random unlabelled graphs subject to certain subcriticality conditions. The graphs are sampled with probability proportional to a product of Boltzmann weights assigned to their $2$-connected components. As…
We study the problem of robustly estimating the parameter $p$ of an Erd\H{o}s-R\'enyi random graph on $n$ nodes, where a $\gamma$ fraction of nodes may be adversarially corrupted. After showing the deficiencies of canonical estimators, we…
It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…
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…
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…
We investigate some topological and spectral properties of Erd\H{o}s-R\'{e}nyi (ER) random digraphs $D(n,p)$. In terms of topological properties, our primary focus lies in analyzing the number of non-isolated vertices $V_x(D)$ as well as…
Let X_i, i\in N, be i.i.d. B-valued random variables, where B is a real separable Banach space. Let \Phi be a smooth enough mapping from B into R. An asymptotic evaluation of Z_n=E(\exp (n\Phi (\sum_{i=1}^nX_i/n))), up to a factor (1+o(1)),…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
We study a class of Hermitian random matrices which includes and generalizes Wigner matrices, heavy-tailed random matrices, and sparse random matrices such as the adjacency matrices of Erdos-Renyi random graphs with p ~ 1/N. Our NxN random…
We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…
Non-asymptotic theory of random matrices strives to investigate the spectral properties of random matrices, which are valid with high probability for matrices of a large fixed size. Results obtained in this framework find their applications…
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random…