Investigating the relationship between \(k\)-core and \(s\)-core network decompositions
From MaRDI portal
Publication:1619251
DOI10.1016/j.physa.2015.12.115zbMath1400.05223OpenAlexW2226272845MaRDI QIDQ1619251
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2015.12.115
complex networksweighted networksnetwork decomposition\(k\)-core analysis\(k\)-shell analysis\(s\)-core analysis
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying the node spreading influence with largest \(k\)-core values
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Complex networks: structure and dynamics
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- A critical point for random graphs with a given degree sequence
- Ak-shell decomposition method for weighted networks
- Random Graphs
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Networks