Pages that link to "Item:Q3164211"
From MaRDI portal
The following pages link to Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (Q3164211):
Displaying 50 items.
- Immunization strategy based on the critical node in percolation transition (Q341283) (← links)
- Mean field conditions for coalescing random walks (Q378808) (← links)
- Data mining of social networks represented as graphs (Q465703) (← links)
- A testing based extraction algorithm for identifying significant communities in networks (Q484064) (← links)
- Clustering and community detection in directed networks: a survey (Q514409) (← links)
- Scaling laws for maximum coloring of random geometric graphs (Q516873) (← links)
- Connecting patterns inspire link prediction in complex networks (Q680810) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Leader nodes in communities for information spreading (Q832130) (← links)
- Statistical mechanics of the minimum dominating set problem (Q888266) (← links)
- Sufficient conditions for edit-optimal clusters (Q903364) (← links)
- KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm (Q904120) (← links)
- A state-space mixed membership blockmodel for dynamic network tomography (Q993232) (← links)
- Epidemic spreading driven by biased random walks (Q1618499) (← links)
- Strong ties promote the epidemic prevalence in susceptible-infected-susceptible spreading dynamics (Q1619122) (← links)
- Diffusion inspires selection of pinning nodes in pinning control (Q1619138) (← links)
- Controllable uncertain opinion diffusion under confidence bound and unpredicted diffusion probability (Q1619248) (← links)
- Optimizing controllability of edge dynamics in complex networks by perturbing network structure (Q1620431) (← links)
- Evolutionary vaccination dynamics with internal support mechanisms (Q1620532) (← links)
- Local community detection in dynamic graphs using personalized centrality (Q1657082) (← links)
- Personalized PageRank clustering: a graph clustering algorithm based on random walks (Q1673321) (← links)
- Higher order assortativity in complex networks (Q1683104) (← links)
- False positive and false negative effects on network attacks (Q1706315) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- Graph clustering based on modularity variation estimations (Q1717412) (← links)
- Preferential imitation can invalidate targeted subsidy policies on seasonal-influenza diseases (Q1734328) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Network community detection on metric space (Q1736703) (← links)
- Variational perspective on local graph clustering (Q1739051) (← links)
- Top-\(k\) overlapping densest subgraphs (Q1741274) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Deprecation based greedy strategy for target set selection in large scale social networks (Q1749822) (← links)
- Mean field analysis of personalized PageRank with implications for local graph clustering (Q1756549) (← links)
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness (Q1782576) (← links)
- The rumor diffusion process with emerging independent spreaders in complex networks (Q1782601) (← links)
- Potential links by neighbor communities (Q1782859) (← links)
- Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure (Q1782915) (← links)
- Mining blackhole and volcano patterns in directed graphs: a general approach (Q1945010) (← links)
- Optimal placement of wireless charging lanes in road networks (Q1983692) (← links)
- Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity (Q2025099) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- Blocking adversarial influence in social networks (Q2056948) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- Computing the \(k\) densest subgraphs of a graph (Q2094387) (← links)
- Synwalk: community detection via random walk modelling (Q2134053) (← links)
- Information spreading in complex networks with participation of independent spreaders (Q2148161) (← links)
- Compressive sensing of high betweenness centrality nodes in networks (Q2150293) (← links)
- Overlapping community detection based on conductance optimization in large-scale networks (Q2157547) (← links)
- A study on scale free social network evolution model with degree exponent \(<2\) (Q2179649) (← links)
- Nonnegative matrix factorization with mixed hypergraph regularization for community detection (Q2195421) (← links)
