A functional limit theorem for random graphs with applications to subgraph count statistics
From MaRDI portal
Publication:3490034
DOI10.1002/rsa.3240010103zbMath0708.05052OpenAlexW2082286519MaRDI QIDQ3490034
Publication date: 1990
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240010103
asymptotic distributionfunctional limit theoremscentral limit theoremsrandom graphmartingale convergence theoremstatisticssubgraph countsSkorokhad topology
Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17)
Related Items (21)
Rademacher chaos: tail estimates versus limit theorems ⋮ Proportional graphs ⋮ Asymptotic distributions in random graphs with applications to social networks ⋮ Probabilistic construction of proportional graphs ⋮ Random graphs with monochromatic triangles in every edge coloring ⋮ How unproportional must a graph be? ⋮ Fluctuations of subgraph counts in graphon based random graphs ⋮ Multicyclic components in a random graph process ⋮ On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm ⋮ Detecting local network motifs ⋮ Asymptotic normality of the \(k\)-core in random graphs ⋮ Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence ⋮ Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) ⋮ Monotonicity, asymptotic normality and vertex degrees in random graphs ⋮ Weighted dependency graphs ⋮ A central limit theorem for incomplete U-statistics over triangular arrays ⋮ Central limit theorem for statistics of subcritical configuration models ⋮ A graph Fourier transform and proportional graphs ⋮ Susceptibility in subcritical random graphs ⋮ Small variance of subgraph counts in a random tournament ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns.
Cites Work
This page was built for publication: A functional limit theorem for random graphs with applications to subgraph count statistics
