Pages that link to "Item:Q4556226"
From MaRDI portal
The following pages link to Community Detection and Stochastic Block Models (Q4556226):
Displaying 50 items.
- Minimax rates of community detection in stochastic block models (Q342688) (← links)
- Overlapping stochastic block models with application to the French political blogosphere (Q542476) (← links)
- Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering (Q822870) (← links)
- Graphical models based hierarchical probabilistic community discovery in large-scale social networks (Q969186) (← links)
- Bayesian community detection (Q1631576) (← links)
- Community detection in degree-corrected block models (Q1800797) (← links)
- Stochastic block models are a discrete surface tension (Q2022738) (← links)
- Weighted stochastic block model (Q2066716) (← links)
- A comparison of statistical relational learning and graph neural networks for aggregate graph queries (Q2071328) (← links)
- Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
- Overlapping community detection in networks via sparse spectral decomposition (Q2121698) (← links)
- The hierarchy of block models (Q2121701) (← links)
- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model (Q2136643) (← links)
- Hypothesis testing in sparse weighted stochastic block model (Q2165832) (← links)
- Concentration of multi-overlaps for random dilute ferromagnetic spin models (Q2194166) (← links)
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging (Q2194484) (← links)
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure (Q2329743) (← links)
- Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks (Q2658079) (← links)
- Concentration and stability of community-detecting functions on random networks (Q2808834) (← links)
- Disentangling group and link persistence in dynamic stochastic block models (Q3303275) (← links)
- Identifying Community Structures from Network Data via Maximum Likelihood Methods (Q3573081) (← links)
- Generic Sample Splitting for Refined Community Recovery in Degree Corrected Stochastic Block Models (Q4601244) (← links)
- Asymptotic mutual information for the balanced binary stochastic block model (Q4603702) (← links)
- A Block Model for Node Popularity in Networks with Community Structure (Q4607214) (← links)
- (Q4633045) (← links)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (Q4633061) (← links)
- Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942) (← links)
- Oriented and degree-generated block models: generating and inferring communities with inhomogeneous degree distributions (Q4689340) (← links)
- Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs (Q4689361) (← links)
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness (Q4967226) (← links)
- Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information (Q4969043) (← links)
- Bayesian consensus clustering in multiplex networks (Q4973016) (← links)
- (Q4998875) (← links)
- A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities (Q4999367) (← links)
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models (Q5002849) (← links)
- Graph Powering and Spectral Robustness (Q5027021) (← links)
- Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions (Q5041776) (← links)
- (Q5053171) (← links)
- Aligning random graphs with a sub-tree similarity message-passing algorithm (Q5093855) (← links)
- (Q5111755) (← links)
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION (Q5122141) (← links)
- Chain-referral sampling on stochastic block models (Q5140339) (← links)
- Probabilistic Community Detection With Unknown Number of Communities (Q5231515) (← links)
- A spectral method for community detection in moderately sparse degree-corrected stochastic block models (Q5233186) (← links)
- Community detection and percolation of information in a geometric setting (Q5886352) (← links)
- Mixture models and networks: The stochastic blockmodel (Q6078169) (← links)
- Respondent-driven sampling on sparse Erdös-Rényi graphs (Q6081631) (← links)
- A compressed sensing based least squares approach to semi-supervised local cluster extraction (Q6158985) (← links)
- Social disruption games in signed networks (Q6199710) (← links)
- Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method (Q6595781) (← links)