scientific article; zbMATH DE number 7370527
From MaRDI portal
Publication:4998875
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1811.02612
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov chain Monte Carloalgorithmic complexityBayesian computationstochastic block modelposterior strong consistency
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Minimax rates of community detection in stochastic block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- On the computational complexity of high-dimensional Bayesian variable selection
- Spectral clustering and the high-dimensional stochastic blockmodel
- Geometric bounds for eigenvalues of Markov chains
- Computable bounds for geometric convergence rates of Markov chains
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Geometric ergodicity and hybrid Markov chains
- Bayesian community detection
- Designing simple and efficient Markov chain Monte Carlo proposal kernels
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Convergence rate of Markov chain methods for genomic motif discovery
- A nonparametric view of network models and Newman–Girvan and other modularities
- Exact Recovery in the Stochastic Block Model
- Graph Partitioning via Adaptive Spectral Techniques
- Mathematical Aspects of Mixing Times in Markov Chains
- Mixture models and exploratory analysis in networks
- Markov Chains and Stochastic Stability
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Estimation and Prediction for Stochastic Blockstructures
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- A Survey of Statistical Network Models
- Probabilistic Community Detection With Unknown Number of Communities
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
- Networks
This page was built for publication:
