Pages that link to "Item:Q661156"
From MaRDI portal
The following pages link to The method of moments and degree distributions for network models (Q661156):
Displaying 50 items.
- Pseudo-likelihood methods for community detection in large sparse networks (Q90059) (← links)
- Adjusted chi-square test for degree-corrected block models (Q90068) (← links)
- A limit theorem for scaled eigenvectors of random dot product graphs (Q288255) (← links)
- Directed weighted random graphs with an increasing bi-degree sequence (Q334049) (← links)
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models (Q341136) (← links)
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels (Q385773) (← links)
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters (Q476218) (← links)
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
- Large-scale estimation of random graph models with local dependence (Q830532) (← links)
- Subsampling bootstrap of count features of networks (Q892240) (← links)
- Detection thresholds for the \(\beta\)-model on sparse graphs (Q1650079) (← links)
- Consistency of maximum-likelihood and variational estimators in the stochastic block model (Q1950883) (← links)
- Classification and estimation in the stochastic blockmodel based on the empirical degrees (Q1950919) (← links)
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations (Q1996765) (← links)
- A weak law for moments of pairwise stable networks (Q2000830) (← links)
- Additive and multiplicative effects network models (Q2038284) (← links)
- Network representation using graph root distributions (Q2039784) (← links)
- Empirical process results for exchangeable arrays (Q2039790) (← links)
- Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
- Weighted stochastic block model (Q2066716) (← links)
- Community detection on mixture multilayer networks via regularized tensor decomposition (Q2073701) (← links)
- Optimal adaptivity of signed-polygon statistics for network testing (Q2073714) (← links)
- Limit theorems for distributions invariant under groups of transformations (Q2091824) (← links)
- Affiliation weighted networks with a differentially private degree sequence (Q2122819) (← links)
- Edgeworth expansions for network moments (Q2131253) (← links)
- Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263) (← links)
- Bootstrapping exchangeable random graphs (Q2136635) (← links)
- Uniform estimation in stochastic block models is slow (Q2137819) (← links)
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence (Q2153141) (← links)
- Asymptotic in the ordered networks with a noisy degree sequence (Q2165451) (← links)
- Bivariate gamma model (Q2201556) (← links)
- Theoretical and computational guarantees of mean field variational inference for community detection (Q2215750) (← links)
- Bootstrap estimators for the tail-index and for the count statistics of graphex processes (Q2219229) (← links)
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios (Q2225321) (← links)
- A motif building process for simulating random networks (Q2242037) (← links)
- Consistent structure estimation of exponential-family random graph models with block structure (Q2295031) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Matrix estimation by universal singular value thresholding (Q2338924) (← links)
- Co-clustering separately exchangeable network data (Q2448722) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- Testing for high-dimensional geometry in random graphs (Q2830237) (← links)
- Sparse Graphs Using Exchangeable Random Measures (Q4603788) (← links)
- Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
- Using the bootstrap for statistical inference on random graphs (Q5507344) (← links)
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon (Q6049917) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- Learning sparse graphons and the generalized Kesten-Stigum threshold (Q6172190) (← links)
- On sparsity, power-law, and clustering properties of graphex processes (Q6198068) (← links)
- Non-representative sampled networks: estimation of network structural properties by weighting (Q6199630) (← links)
- Kernel density estimation for undirected dyadic data (Q6199653) (← links)
