Orthogonal decompositions and functional limit theorems for random graph statistics
From MaRDI portal
Publication:4309695
DOI10.1090/memo/0534zbMath0810.05001OpenAlexW2070145404MaRDI QIDQ4309695
Publication date: 9 April 1995
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0534
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Related Items
The distance profile of rooted and unrooted simply generated trees, Rademacher chaos: tail estimates versus limit theorems, How unproportional must a graph be?, On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles, Central limit theorems for patterns in multiset permutations and set partitions, The number of perfect matchings, and the nesting properties, of random regular graphs, Moderate deviations in cycle count, Fluctuations of subgraph counts in graphon based random graphs, Subgraph distributions in dense random regular graphs, Depth-first search performance in a random digraph with geometric outdegree distribution, Local limit theorems for subgraph counts, Random Regular Graphs: Asymptotic Distributions and Contiguity, On the number of isolated vertices in a growing random graph, 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 𝐺(𝑛,𝑝), Weighted dependency graphs, A functional limit theorem for the profile of search trees, Bootstrap percolation on the random graph \(G_{n,p}\), Tightness and weak convergence for jump processes, A local central limit theorem for triangles in a random graph, Preferential attachment when stable, A graph Fourier transform and proportional graphs, Component structure of the configuration model: Barely supercritical case, Small variance of subgraph counts in a random tournament, Distribution of the number of spanning regular subgraphs in random graphs, Functional limit theorems for multitype branching processes and generalized Pólya urns.
