A functional limit theorem for random graphs with applications to subgraph count statistics
From MaRDI portal
Publication:3490034
DOI10.1002/rsa.3240010103zbMath0708.05052MaRDI 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 distribution; functional limit theorems; central limit theorems; random graph; martingale convergence theorem; statistics; subgraph counts; Skorokhad topology
05C80: Random graphs (graph-theoretic aspects)
60F17: Functional limit theorems; invariance principles
Related Items
Random graphs with monochromatic triangles in every edge coloring, A graph Fourier transform and proportional graphs, Central limit theorem for statistics of subcritical configuration models, On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm, Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence, Asymptotic normality of the \(k\)-core in random graphs, Small variance of subgraph counts in a random tournament, How unproportional must a graph be?, Rademacher chaos: tail estimates versus limit theorems, Detecting local network motifs, Weighted dependency graphs, A central limit theorem for incomplete U-statistics over triangular arrays, Monotonicity, asymptotic normality and vertex degrees in random graphs, Functional limit theorems for multitype branching processes and generalized Pólya urns., Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Susceptibility in subcritical random graphs, Proportional graphs, Asymptotic distributions in random graphs with applications to social networks, Probabilistic construction of proportional graphs, Multicyclic components in a random graph process
Cites Work
