When are small subgraphs of a random graph normally distributed?
From MaRDI portal
Publication:1092512
DOI10.1007/BF00718031zbMath0627.60045MaRDI QIDQ1092512
Publication date: 1988
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Related Items
Picker-chooser fixed graph games, Upper tails for subgraph counts in random graphs, On tree census and the giant component in sparse random graphs, Concentration of non‐Lipschitz functions and applications, KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH, The missing log in large deviations for triangle counts, The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph, Asymptotic distributions in random graphs with applications to social networks, Normal limiting distributions for systems of linear equations in random sets, Testing for Equivalence of Network Distribution Using Subgraph Counts, Moderate deviations via cumulants, Upper tails via high moments and entropic stability, Subgraph counts in random graphs using incomplete U-statistics methods, Normal approximation for generalizedU-statistics and weighted random graphs, Logarithmic Sobolev inequalities for finite spin systems and applications, The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph, Central limit theorems for patterns in multiset permutations and set partitions, Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence, Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, Threshold functions for small subgraphs in simple graphs and multigraphs, The number of perfect matchings, and the nesting properties, of random regular graphs, A limit theorem for small cliques in inhomogeneous random graphs, The number of triangles in random intersection graphs, Threshold functions for small subgraphs: an analytic approach, Fluctuations of subgraph counts in graphon based random graphs, Subgraph distributions in dense random regular graphs, Exponential inequalities for the number of subgraphs in the Erdös-Rényi random graph, A transition of limiting distributions of large matchings in random graphs, Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method, Triangles and subgraph probabilities in random regular graphs, The upper tail problem for induced 4‐cycles in sparse random graphs, A simplified second-order Gaussian Poincaré inequality in discrete setting with applications, Local limit theorems for subgraph counts, On the concentration of the chromatic number of random graphs, Induced subgraphs in sparse random graphs with given degree sequences, Fundamentals of Stein's method, Unnamed Item, Law of the iterated logarithm for random graphs, Unions of random trees and applications, On the number of weakly connected subdigraphs in random \(k\)NN digraphs, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Central limit theorems in the configuration model, Limiting distribution of short cycles in inhomogeneous random uniform hypergraph, Weighted dependency graphs, Convex hulls of dense balanced graphs, A local central limit theorem for triangles in a random graph, Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting, The lower tail: Poisson approximation revisited, The Distribution of Patterns in Random Trees, On the missing log in upper tail estimates, Bivariate fluctuations for the number of arithmetic progressions in random sets, Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs, Sub-Gaussian Tails for the Number of Triangles inG(n, p), Anti-concentration for subgraph counts in random graphs, Central limit theorem for statistics of subcritical configuration models, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs, Stein's method of exchangeable pairs in multivariate functional approximations, Upper tail bounds for stars, Large cycles in random generalized Johnson graphs, A concentration result with application to subgraph count, Distribution of the number of spanning regular subgraphs in random graphs, Asymptotic normality of subcubes in random subgraphs of the \(n\)-cube, Local limit theorems via Landau-Kolmogorov inequalities, The asymptotic distributions of generalized U-statistics with applications to random graphs
Cites Work
- Subgraph counts in random graphs using incomplete U-statistics methods
- Every graph is contained in a sparsest possible balanced graph
- Strongly balanced graphs and random graphs
- On random simplices in product distributions
- Poisson convergence and random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
