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.91144OpenAlexW2146591355WikidataQ60309433 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




Related Items

Epidemic spreading driven by biased random walksStrong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamicsDiffusion inspires selection of pinning nodes in pinning controlControllable uncertain opinion diffusion under confidence bound and unpredicted diffusion probabilityOptimizing controllability of edge dynamics in complex networks by perturbing network structureEvolutionary vaccination dynamics with internal support mechanismsLeader nodes in communities for information spreadingSynwalk: community detection via random walk modellingParallel Maximum Clique Algorithms with Applications to Network AnalysisThe Small Community Phenomenon in Networks: Models, Algorithms and ApplicationsGraph Summarization with Latent Variable Probabilistic ModelsThe Directed Dominating Set Problem: Generalized Leaf Removal and Belief PropagationInformation spreading in complex networks with participation of independent spreadersCompressive sensing of high betweenness centrality nodes in networksOverlapping community detection based on conductance optimization in large-scale networksImmunization strategy based on the critical node in percolation transitionLocal community detection in dynamic graphs using personalized centralityFormalising and detecting community structures in real world complex networksPersonalized PageRank clustering: a graph clustering algorithm based on random walksOn the complexity of multi-parameterized cluster editingMean field conditions for coalescing random walksEdge instability: a critical parameter for the propagation and robustness analysis of large networksMixed Degree-Degree Correlations in Directed Social NetworksA study on scale free social network evolution model with degree exponent \(<2\)Higher order assortativity in complex networksThe Domination Number of On-line Social Networks and Random Geometric GraphsStatistical mechanics of the minimum dominating set problemSeeded PageRank solution pathsNonnegative matrix factorization with mixed hypergraph regularization for community detectionFinding Cliques in Social Networks: A New Distribution-Free ModelUnnamed ItemSufficient conditions for edit-optimal clustersMining blackhole and volcano patterns in directed graphs: a general approachKDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithmEfficient and effective influence maximization in social networks: a hybrid-approachFalse positive and false negative effects on network attacksInhibiting diffusion of complex contagions in social networks: theoretical and experimental resultsCrawISN: community-aware data acquisition with maximum willingness in online social networksGraph clustering based on modularity variation estimationsTwo faces of greedy leaf removal procedure on graphsData mining of social networks represented as graphsDense Subgraphs in Biological NetworksA testing based extraction algorithm for identifying significant communities in networksPreferential imitation can invalidate targeted subsidy policies on seasonal-influenza diseasesOn the Complexity of Sampling Vertices Uniformly from a GraphComputing the eccentricity distribution of large graphsEmergence of clustering in an acquaintance model without homophilyNetwork community detection on metric spaceLocalized eigenvectors of the non-backtracking matrixIdentifying influential spreaders in complex networks through local effective spreading pathsVariational perspective on local graph clusteringNonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear ModelTop-\(k\) overlapping densest subgraphsConfiguring Random Graph Models with Fixed Degree SequencesOptimal placement of wireless charging lanes in road networksA two-stage stochastic programming approach for influence maximization in social networksUnnamed ItemConnecting patterns inspire link prediction in complex networksClustering and community detection in directed networks: a surveyDeprecation based greedy strategy for target set selection in large scale social networksScaling laws for maximum coloring of random geometric graphsHeterogeneous node responses to multi-type epidemics on networksAnalysis of directed networks via partial singular value decomposition and Gauss quadratureThe DFS Fused Lasso: Linear-Time Denoising over General GraphsMean field analysis of personalized PageRank with implications for local graph clusteringEfficient discovery of overlapping communities in massive networksStagnation-aware breakout tabu search for the minimum conductance graph partitioning problemTop-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexityIdentifying and ranking influential spreaders in complex networks by neighborhood corenessThe rumor diffusion process with emerging independent spreaders in complex networksPotential links by neighbor communitiesTwo-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structureMinimum budget for misinformation blocking in online social networksLarge-scale influence maximization via maximal covering locationA state-space mixed membership blockmodel for dynamic network tomographyDecompositions of Triangle-Dense GraphsCombined neighborhood tabu search for community detection in complex networksDisk-based shortest path discovery using distance index over large dynamic graphsI/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphsConsistent structure estimation of exponential-family random graph models with block structureFast approximation of eccentricities and distances in hyperbolic graphsEfficient Network Dismantling via Node Explosive Percolation*Blocking adversarial influence in social networksMultiresolution Network ModelsComplex Network Partitioning Using Label PropagationCommunities, Random Walks, and Social Sybil DefenseExact Clustering of Weighted Graphs via Semidefinite ProgrammingStructural sparsity of complex networks: bounded expansion in random models and real-world graphsClustered Matrix ApproximationEstimating graph parameters with random walksAn immunization strategy based on propagation mechanismAn order-based algorithm for minimum dominating set with application in graph miningA balm: defend the clique-based attack from a fundamental aspectNonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted ImmunizationStatistical Clustering of a Random Network by Extremal PropertiesComputing the \(k\) densest subgraphs of a graphScalable Algorithms for Multiple Network AlignmentUnnamed ItemUnnamed ItemOn a Minimum Distance Procedure for Threshold Selection in Tail AnalysisFlow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and PerformanceCore-Periphery Structure in Networks (Revisited)Tempus volat, hora fugit: A survey of tie‐oriented dynamic network models in discrete and continuous timeIterated multilevel simulated annealing for large-scale graph conductance minimizationGenerating large scale‐free networks with the Chung–Lu random graph modelApproximating Probability Distributions by Using Wasserstein Generative Adversarial NetworksCovering a graph with densest subgraphsEfficient presolving methods for the influence maximization problemMath‐based reinforcement learning for the adaptive budgeted influence maximization problemBI-COMMUNITY DETECTION METHOD BASED ON BOTH INTRA- AND INTER-CORRELATION: AN APPLIED RESEARCH OF INTERNATIONAL RELATIONSDensity decompositions of networksTree decompositions and social graphsUnnamed ItemReHub


Uses Software