English
Related papers

Related papers: Limits for embedding distributions

200 papers

We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviour, we conclude that the Wiener-entropy of graphs of a given…

Combinatorics · Mathematics 2024-12-17 Stijn Cambie , Yanni Dong

We consider sequences of symmetric $U$-statistics, not necessarily Hoeffding-degenerate, both in a one- and multi-dimensional setting, and prove quantitative central limit theorems (CLTs) based on the use of {\it contraction operators}. Our…

Probability · Mathematics 2021-04-01 Christian Döbler , Giovanni Peccati

In the current work we are concerned with sequences of graphs having a grid geometry, with a uniform local structure in a bounded domain $\Omega\subset {\mathbb R}^d$, $d\ge 1$. When $\Omega=[0,1]$, such graphs include the standard Toeplitz…

Numerical Analysis · Mathematics 2021-11-30 Andrea Adriani , Davide Bianchi , Paola Ferrari , Stefano Serra-Capizzano

A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…

Probability · Mathematics 2010-03-23 Martin Bender

We determine the asymptotics of the joint eigenfunctions of the torus action on a toric Kahler variety. Such varieties are models of completely integrable systems in complex geometry. We first determine the pointwise asymptotics of the…

Complex Variables · Mathematics 2007-05-23 Bernard Shiffman , Tatsuya Tate , Steve Zelditch

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce the notion of \emph{patchworks} to describe the possible…

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

Statistics Theory · Mathematics 2017-05-08 Kai Zhang

We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We…

Statistical Mechanics · Physics 2012-05-03 Ajit C. Balram , Deepak Dhar

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…

Probability · Mathematics 2021-07-28 Othmane Safsafi

We consider Canonical Gibbsian ensembles of Euler point vortices on the 2-dimensional torus or in a bounded domain of R 2 . We prove that under the Central Limit scaling of vortices intensities, and provided that the system has zero global…

Probability · Mathematics 2020-04-22 Francesco Grotto , Marco Romito

For positive integers $r > \ell \geq 1$, an $\ell$-cycle in an $r$-uniform hypergraph is a cycle where each edge consists of $r$ vertices and each pair of consecutive edges intersect in $\ell$ vertices. For $\ell \geq 2$, we determine the…

Combinatorics · Mathematics 2025-01-08 Byron Chin

We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…

Probability · Mathematics 2013-01-11 Hsien-Kuei Hwang , Vytas Zacharovas

We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are…

Combinatorics · Mathematics 2025-11-27 Arthur Forey , Javier Fresán , Emmanuel Kowalski , Yuval Wigderson

For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…

Combinatorics · Mathematics 2023-08-22 Seonghyuk Im , Jaehoon Kim , Younjin Kim , Hong Liu

Graph embeddings, a class of dimensionality reduction techniques designed for relational data, have proven useful in exploring and modeling network structure. Most dimensionality reduction methods allow out-of-sample extensions, by which an…

Machine Learning · Statistics 2019-10-02 Keith Levin , Fred Roosta , Minh Tang , Michael W. Mahoney , Carey E. Priebe

We study the asymptotic properties of the conormal cycle of nodal sets associated to a random superposition of eigenfunctions of the Laplacian on a smooth compact Riemannian manifold without boundary. In the case where the dimension is odd,…

Spectral Theory · Mathematics 2016-04-04 Nguyen Viet Dang , Gabriel Riviere

We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…

Mathematical Physics · Physics 2015-06-03 Maria Shcherbina , Brunello Tirozzi

In earlier work, Billey--Konvalinka--Swanson studied the asymptotic distribution of the coefficients of Stanley's $q$-hook length formula, or equivalently the major index on standard tableaux of straight shape and certain skew shapes. We…

Combinatorics · Mathematics 2023-08-25 Sara C. Billey , Joshua P. Swanson

We prove a central limit theorem for smooth linear statistics related to the zero divisors of Gaussian i.i.d. centered holomorphic sections of tensor powers of a Hermitian holomorphic line bundle over a non-compact Hermitian manifold.

Complex Variables · Mathematics 2026-05-05 Afrim Bojnik , Ozan Günyüz

We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we…

Combinatorics · Mathematics 2023-07-14 Tobias Johnson