Pages that link to "Item:Q1119948"
From MaRDI portal
The following pages link to Subgraph counts in random graphs using incomplete U-statistics methods (Q1119948):
Displaying 31 items.
- The asymptotic distributions of generalized U-statistics with applications to random graphs (Q811004) (← links)
- Subsampling bootstrap of count features of networks (Q892240) (← links)
- Variance of the subgraph count for sparse Erdős-Rényi graphs (Q968190) (← links)
- When are small subgraphs of a random graph normally distributed? (Q1092512) (← links)
- Asymptotic normality of graph statistics (Q1116572) (← 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)
- On the number of subgraphs of a specified form embedded in a random graph (Q1397228) (← links)
- Minimum variance rectangular designs for U-statistics. (Q1421945) (← links)
- Small variance of subgraph counts in a random tournament (Q1579850) (← links)
- Upper tails for subgraph counts in random graphs (Q1881736) (← 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)
- Modular statistics for subgraph counts in sparse random graphs (Q2256135) (← links)
- Poisson approximation of subgraph counts in stochastic block models and a graphon model (Q2954228) (← links)
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝) (Q3298973) (← links)
- A functional limit theorem for random graphs with applications to subgraph count statistics (Q3490034) (← links)
- Random subgraph counts and <i>U</i>-statistics: multivariate normal approximation via exchangeable pairs and embedding (Q3578671) (← links)
- Asymptotic distributions of graph statistics for colored graphs (Q3975011) (← links)
- Incomplete U -statistics of permanent design (Q4470116) (← links)
- Subgraph statistics in subcritical graph classes (Q4597604) (← links)
- Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges (Q5215024) (← 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)
- Moderate deviations for functionals over infinitely many Rademacher random variables (Q6634808) (← links)
