Related papers: Limits for embedding distributions
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…
In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. S\'os proposed a question that if we consider only the number of edges…
Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…
In this paper, we are interested in sequences of q-tuple of N-by-N random matrices having a strong limiting distribution (i.e. given any non-commutative polynomial in the matrices and their conjugate transpose, its normalized trace and its…
Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…
The tube model is a central concept in polymer physics, and allows to reduce the complex many-filament problem of an entangled polymer solution to a single filament description. We investigate the probability distribution function of…
We address the issue of the Central Limit Theorem for (both local and global) empirical measures of diffusions interacting on a possibly diluted Erd\H{o}s-R\'enyi graph. Special attention is given to the influence of initial condition (not…
In this paper, we first generalize a theorem for counting the number of faces of an oriented embedding of a graph that passing through a given cut-edge set [S. Stahl, Trans. Amer. Math. Soc. 259 (1980), 129--145] to all surfaces. Then we…
We consider N-tensor powers of a positive Hermitian line bundle L over a non-compact complex manifold X. In the compact case, B. Shiffman and S. Zelditch proved that the zeros of random sections become asymptotically uniformly distributed…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
Let $H_d(n,p)$ signify a random $d$-uniform hypergraph with $n$ vertices in which each of the ${n}\choose{d}$ possible edges is present with probability $p=p(n)$ independently, and let $H_d(n,m)$ denote a uniformly distributed with $n$…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…
We obtain sufficient conditions exlcuding the existence of non-trivial distribution sections of bundles over the boundary of symmetric spaces of negative curvature which are invariant with respect to a geometrically finite group of…
Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
We prove asymptotic normality of the distributions defined by q-supernomials, which implies asymptotic normality of the distributions given by the central string functions and the basic specialization of fusion modules of the current…
We introduce families of jointly symmetric, binary distributions that are generated over directed star graphs whose nodes represent variables and whose edges indicate positive dependences. The families are parametrized in terms of a single…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…