Computing Communities in Large Networks Using Random Walks
From MaRDI portal
Publication:5301388
DOI10.7155/jgaa.00124zbMath1161.68694arXivcond-mat/0412368OpenAlexW2033590892WikidataQ62072911 ScholiaQ62072911MaRDI QIDQ5301388
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0412368
Related Items (63)
On the reliable and efficient numerical integration of the Kuramoto model and related dynamical systems on graphs ⋮ Complex systems: features, similarity and connectivity ⋮ Impact of the Soai-autocatalysis on natural sciences ⋮ Comparison of algorithms in graph partitioning ⋮ Two sample tests for high-dimensional autocovariances ⋮ An analysis of shipping agreements: the cooperative container network ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Clustering as a dual problem to colouring ⋮ Modeling latent topics in social media using dynamic exploratory graph analysis: the case of the right-wing and left-wing trolls in the 2016 US elections ⋮ Fast approximation for computing the fractional arboricity and extraction of communities of a graph ⋮ Bayesian degree-corrected stochastic blockmodels for community detection ⋮ On community structure validation in real networks ⋮ Length of clustering algorithms based on random walks with an application to neuroscience ⋮ Fuzzy random walkers with second order bounds: an asymmetric analysis ⋮ Estimating large covariance matrix with network topology for high-dimensional biomedical data ⋮ The interplay between population stability and food-web topology predicts the occurrence of motifs in complex food-webs ⋮ Modularity maximization to design contiguous policy zones for pandemic response ⋮ Gravitational community detection by predicting diameter ⋮ An effective and scalable overlapping community detection approach: integrating social identity model and game theory ⋮ Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ A bag-of-paths framework for network data analysis ⋮ Random walks and diffusion on networks ⋮ A link-based similarity for improving community detection based on label propagation algorithm ⋮ Community detection in networks via a spectral heuristic based on the clustering coefficient ⋮ Detection of core–periphery structure in networks using spectral methods and geodesic paths ⋮ Complex networks for community detection of basketball players ⋮ EAMCD: an efficient algorithm based on minimum coupling distance for community identification in complex networks ⋮ Post-processing hierarchical community structures: quality improvements and multi-scale view ⋮ Inference with non-probability samples and survey data integration: a science mapping study ⋮ Blind subgrouping of task-based fMRI ⋮ Clustering large attributed information networks: an efficient incremental computing approach ⋮ A graph clustering algorithm based on a clustering coefficient for weighted graphs ⋮ Probability distributions for Markov chain based quantum walks ⋮ Discovering subjectively interesting multigraph patterns ⋮ Network refinement: denoising complex networks for better community detection ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Stationary subspace analysis of nonstationary covariance processes: eigenstructure description and testing ⋮ Generalization of clustering agreements and distances for overlapping clusters and network communities ⋮ Graph clustering based on modularity variation estimations ⋮ A multidimensional and multimembership clustering method for social networks and its application in customer relationship management ⋮ A DC Programming Approach for Finding Communities in Networks ⋮ Structure Detection in Mixed-Integer Programs ⋮ Clustering via the modified Petford-Welsh algorithm ⋮ Network community detection on metric space ⋮ Robustness of community structure to node removal ⋮ Top-\(k\) overlapping densest subgraphs ⋮ The interconnectedness of the economic content in the speeches of the US presidents ⋮ Two local dissimilarity measures for weighted graphs with application to protein interaction networks ⋮ Dense community detection in multi-valued attributed networks ⋮ Clustering and community detection in directed networks: a survey ⋮ Sparse Matrix Graphical Models ⋮ Unnamed Item ⋮ Big networks: a survey ⋮ Detection of structurally homogeneous subsets in graphs ⋮ Modeling acquaintance networks based on balance theory ⋮ Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science ⋮ A classification for community discovery methods in complex networks ⋮ Modeling community structure and topics in dynamic text networks ⋮ Weighted stochastic block model ⋮ Fast unfolding of communities in large networks ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis ⋮ An improved spectral clustering community detection algorithm based on probability matrix ⋮ Unnamed Item
This page was built for publication: Computing Communities in Large Networks Using Random Walks
