Pages that link to "Item:Q4761357"
From MaRDI portal
The following pages link to Compound Poisson approximations of subgraph counts in random graphs (Q4761357):
Displaying 12 items.
- Concentration for Poisson functionals: component counts in random geometric graphs (Q265636) (← links)
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models (Q341136) (← links)
- Motif-based tests for bipartite networks (Q2136609) (← links)
- The bound on Poisson approximation for the number of induced copies of a fixed graph in a random graph (Q2811366) (← links)
- Poisson approximation for the number of isolated trees in a random intersection graph (Q2867709) (← links)
- Poisson approximation of subgraph counts in stochastic block models and a graphon model (Q2954228) (← links)
- (Q3518880) (← links)
- Inhomogeneous random graphs, isolated vertices, and Poisson approximation (Q4684930) (← links)
- Maximal full subspaces in random projective spaces—thresholds and Poisson approximation (Q4697819) (← links)
- Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges (Q5215024) (← links)
- POISSON APPROXIMATION FOR THE NUMBER OF OPIES OF A FIXED GRAPH IN A RANDOM d-REGULAR GRAPH (Q5416580) (← links)
- Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method (Q6103216) (← links)
