Pages that link to "Item:Q1119948"

The following pages link to Subgraph counts in random graphs using incomplete U-statistics methods (Q1119948):

Displaying 15 items.

• The asymptotic distributions of generalized U-statistics with applications to random graphs (Q811004) (← links)
• When are small subgraphs of a random graph normally distributed? (Q1092512) (← links)
• A central limit theorem for decomposable random variables with applications to random graphs (Q1264157) (← links)
• On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics (Q1379723) (← links)
• Minimum variance rectangular designs for U-statistics. (Q1421945) (← links)
• Anti-concentration for subgraph counts in random graphs (Q2039444) (← links)
• Edgeworth expansions for network moments (Q2131253) (← links)
• Motif-based tests for bipartite networks (Q2136609) (← links)
• Logarithmic Sobolev inequalities for finite spin systems and applications (Q2174983) (← links)
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs (Q2223629) (← links)
• A local central limit theorem for triangles in a random graph (Q5740273) (← links)
• Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon (Q6049917) (← links)
• A limit theorem for small cliques in inhomogeneous random graphs (Q6080866) (← links)
• Fluctuations of subgraph counts in graphon based random graphs (Q6091052) (← links)
• Local limit theorems for subgraph counts (Q6176774) (← links)