stochastic block model
PulseAugur coverage of stochastic block model — every cluster mentioning stochastic block model across labs, papers, and developer communities, ranked by signal.
3 day(s) with sentiment data
-
New Spiking Neural Network Architectures Enhance Learning and Efficiency
Researchers are exploring new architectures for Spiking Neural Networks (SNNs) to improve their efficiency and capabilities. One approach introduces Community Recurrent SNNs (CoRe SNNs) that mimic biological modular and…
-
New research explores advanced community detection in complex networks · 2 sources tracked
Two new research papers explore advanced methods for community detection in complex networks. The first paper introduces three hierarchical frameworks that utilize node similarity, graph representation learning, and var…
-
New method recovers Bethe Hessian eigenvectors in stochastic block models
A new paper published on arXiv details a method for recovering outlier eigenvectors of the Bethe Hessian within the Kesten-Stigum regime of the stochastic block model. This technique extends previous recovery guarantees…
-
New DC^2SBM Model Enhances Community Detection in Attributed Networks
Researchers have introduced the Dual-Corrected Stochastic Block Model (DC^2SBM), a novel method for detecting structures in attributed networks. This model addresses limitations in existing approaches by independently m…
-
New T-ARC clustering method corrects k-means geometric bias using topology
Researchers have introduced T-ARC, a novel topology-aware randomized clustering method designed to overcome the geometric biases inherent in traditional k-means clustering. This new approach integrates topological infor…
-
New Research Explores Entropy Bounds in Graphon Models
Connor Loehde-Woolard has published a new paper on arXiv detailing explicit bounds for the entropy of piecewise Hölder continuous graphon models. The research presents a result on the convergence rate of normalized entr…
-
New algorithm simplifies graph node selection for large-scale network analysis
Researchers have developed a new algorithm for selecting representative nodes from large graphs, a crucial task in network analysis. This method, termed Scalable Graph Coreset Selection via Greedy Sampling, bypasses the…
-
New diffusion distance metric measures spatial clustering beyond local patterns
Researchers have introduced a new metric called diffusion distance to measure spatial clustering. This metric extends traditional spatial autocorrelation measures like Moran's I by considering global graph geometry rath…
-
New Convex Programming Method Finds Dense Submatrices in Complex Networks
Researchers have developed a new method using convex programming to identify dense submatrices within larger matrices that contain multiple such dense regions. This approach extends previous work, which typically focuse…
-
Evolutionary optimization reveals structural constraints in reservoir computing
Researchers have utilized evolutionary optimization to explore the structural constraints of reservoir computing architectures when tasked with predicting spatiotemporal chaos. By evolving reservoirs based on five hyper…
-
New research explores phase transition in Stochastic Block Model with many communities
A new research paper explores the phase transition for the Stochastic Block Model (SBM) when the number of communities exceeds the square root of the number of nodes. The study provides evidence supporting a new thresho…
-
New spectral sparsification methods enhance graphical model accuracy
Researchers have developed new methods, Spectral-LCGGM and Spectral-HR, to improve the accuracy and scalability of Laplacian-constrained Gaussian and Hüsler-Reiss graphical models. These models are used in areas like gr…
-
New algorithms improve community detection in hypergraphs
Researchers have developed new spectral algorithms for community detection in hypergraphs, improving upon existing methods for non-uniform models. One paper introduces a three-step spectral algorithm that achieves parti…