Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
From MaRDI portal
Publication:3164211
DOI10.1080/15427951.2009.10129177zbMath1205.91144WikidataQ60309433 ScholiaQ60309433MaRDI QIDQ3164211
Kevin J. Lang, Michael W. Mahoney, Jure Leskovec, Anirban Dasgupta
Publication date: 27 October 2010
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1283973327
91D30: Social networks; opinion dynamics
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68M10: Network design and communication in computer systems
Related Items
Unnamed Item, Seeded PageRank solution paths, Configuring Random Graph Models with Fixed Degree Sequences, The DFS Fused Lasso: Linear-Time Denoising over General Graphs, Exact Clustering of Weighted Graphs via Semidefinite Programming, Unnamed Item, Unnamed Item, Fast approximation of eccentricities and distances in hyperbolic graphs, Communities, Random Walks, and Social Sybil Defense, Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization, Statistical Clustering of a Random Network by Extremal Properties, Scalable Algorithms for Multiple Network Alignment, Unnamed Item, On a Minimum Distance Procedure for Threshold Selection in Tail Analysis, Graph Summarization with Latent Variable Probabilistic Models, Finding Cliques in Social Networks: A New Distribution-Free Model, Two faces of greedy leaf removal procedure on graphs, On the Complexity of Sampling Vertices Uniformly from a Graph, Heterogeneous node responses to multi-type epidemics on networks, Efficient discovery of overlapping communities in massive networks, Immunization strategy based on the critical node in percolation transition, Mean field conditions for coalescing random walks, Data mining of social networks represented as graphs, A testing based extraction algorithm for identifying significant communities in networks, Clustering and community detection in directed networks: a survey, Scaling laws for maximum coloring of random geometric graphs, Connecting patterns inspire link prediction in complex networks, An order-based algorithm for minimum dominating set with application in graph mining, Leader nodes in communities for information spreading, Statistical mechanics of the minimum dominating set problem, Sufficient conditions for edit-optimal clusters, KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm, A state-space mixed membership blockmodel for dynamic network tomography, Epidemic spreading driven by biased random walks, Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics, Diffusion inspires selection of pinning nodes in pinning control, Controllable uncertain opinion diffusion under confidence bound and unpredicted diffusion probability, Optimizing controllability of edge dynamics in complex networks by perturbing network structure, Evolutionary vaccination dynamics with internal support mechanisms, Local community detection in dynamic graphs using personalized centrality, Personalized PageRank clustering: a graph clustering algorithm based on random walks, Higher order assortativity in complex networks, False positive and false negative effects on network attacks, Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results, Graph clustering based on modularity variation estimations, Preferential imitation can invalidate targeted subsidy policies on seasonal-influenza diseases, Computing the eccentricity distribution of large graphs, Network community detection on metric space, Variational perspective on local graph clustering, Top-\(k\) overlapping densest subgraphs, A two-stage stochastic programming approach for influence maximization in social networks, Deprecation based greedy strategy for target set selection in large scale social networks, Mean field analysis of personalized PageRank with implications for local graph clustering, Identifying and ranking influential spreaders in complex networks by neighborhood coreness, The rumor diffusion process with emerging independent spreaders in complex networks, Potential links by neighbor communities, Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure, Mining blackhole and volcano patterns in directed graphs: a general approach, Optimal placement of wireless charging lanes in road networks, Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity, Large-scale influence maximization via maximal covering location, Blocking adversarial influence in social networks, A balm: defend the clique-based attack from a fundamental aspect, Computing the \(k\) densest subgraphs of a graph, Synwalk: community detection via random walk modelling, Information spreading in complex networks with participation of independent spreaders, Compressive sensing of high betweenness centrality nodes in networks, Overlapping community detection based on conductance optimization in large-scale networks, A study on scale free social network evolution model with degree exponent \(<2\), Nonnegative matrix factorization with mixed hypergraph regularization for community detection, Efficient and effective influence maximization in social networks: a hybrid-approach, CrawISN: community-aware data acquisition with maximum willingness in online social networks, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem, Minimum budget for misinformation blocking in online social networks, Disk-based shortest path discovery using distance index over large dynamic graphs, I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs, Consistent structure estimation of exponential-family random graph models with block structure, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Estimating graph parameters with random walks, An immunization strategy based on propagation mechanism, On the complexity of multi-parameterized cluster editing, Formalising and detecting community structures in real world complex networks, Edge instability: a critical parameter for the propagation and robustness analysis of large networks, Decompositions of Triangle-Dense Graphs, Combined neighborhood tabu search for community detection in complex networks, Complex Network Partitioning Using Label Propagation, Clustered Matrix Approximation, The Small Community Phenomenon in Networks: Models, Algorithms and Applications, Mixed Degree-Degree Correlations in Directed Social Networks, The Domination Number of On-line Social Networks and Random Geometric Graphs, Dense Subgraphs in Biological Networks, Emergence of clustering in an acquaintance model without homophily, Localized eigenvectors of the non-backtracking matrix, Identifying influential spreaders in complex networks through local effective spreading paths, Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model, Efficient Network Dismantling via Node Explosive Percolation*, Multiresolution Network Models, Parallel Maximum Clique Algorithms with Applications to Network Analysis, The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation, Density decompositions of networks, ReHub, Core-Periphery Structure in Networks (Revisited), Unnamed Item, Tree decompositions and social graphs, Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous time, Iterated multilevel simulated annealing for large-scale graph conductance minimization, Generating large scale‐free networks with the Chung–Lu random graph model, Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks, Covering a graph with densest subgraphs, Efficient presolving methods for the influence maximization problem
Uses Software
