Complex Networks: Spectral properties, transport, diffusion and dynamics
By R. Cohen, Shlomo Havlin. 2010
715 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/48be1402799fb99d45cbe68ddd7d76ce30ee1053
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Santo Fortunato
- H. Eugene Stanley
- Sergey V. Buldyrev
- Marc Barthelemy
- Andrea Lancichinetti
- Albert-László Barabási
- Darko Hric
- Naoki Masuda
In Geometry and Topology
- Linyuan Lu
- Tao Zhou
- H. Eugene Stanley
- Sergey V. Buldyrev
- Santo Fortunato
- Marc Barthelemy
- Andrea Lancichinetti
- Jianxi Gao
In Statistical and Nonlinear Physics
- Santo Fortunato
- M. A. Porter
- Darko Hric
- Mark Newman
- Olaf Sporns
- Marc Barthelemy
- Albert-László Barabási
- Renaud Lambiotte
Citations in the corpus
- Vital nodes identification in complex networks (2016, methodology): “ourse, if we do not care the approximation guarantee, we can use the greedy algorithms anyway. 6.4. Percolation methods Network percolation can be classified into bond percolation and site percolation [265]. Given an undirected network G(V,E), in bond percolation, each edge is preserved (i.e., occupi”
- Catastrophic cascade of failures in interdependent networks (2009, methodology): “The implications are dramatic – the current methods applied to the design of robust networks need to be modified to include the findings about interdependent networks.”
- Consensus clustering in complex networks (2012, background): “Network systems [1–8] typically display a modular organization, reflecting the existence of special affinities among vertices in the same module, which may be a consequence of their having similar features or the same roles in the network.”
- Spatial Networks (2010, background): “From road networks to air transport More flows and statistical physics • David Aldous, “Spatial Transportation Networks with Transfer Costs: Asymptotic Optimality of Hub and Spoke Models” • Marc Barthélemy, “Spatial networks” Physics Reports 499 (1), 2011.”
- Limits of modularity maximization in community detection (2011, background): “Limits of modularity maximization in community detection Andrea Lancichinetti1, 2 and Santo Fortunato3, 1 1Complex Networks and Systems Lagrange Lab, Institute for Scientific Interchange, Torino, Italy 2Physics Department, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy 3Depa”
- Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network (2013, background): “Indeed, many complex systems can be represented as networks, ranging from biochemical systems, through the Internet and the World Wide Web, to various social systems [1–7].”
- Robustness of a Network of Networks (2010, background): “In recent years dramatic advances in the field of complex networks have occurred [1–13].”
- Community detection in networks: A user guide (2016, background): “The science of networks is a modern discipline spanning the natural, social and computer sciences, as well as engineering (Barrat et al., 2008; Caldarelli, 2007; Cohen and Havlin, 2010; Dorogovtsev and Mendes, 2013; Estrada, 2011; Estrada and Knight, 2015; Newman, 2010).”
- Random walks and diffusion on networks (2016, background): “ article. The spectral gap (and thus 2) governs the relaxation time. The corresponding eigenvector u 2 is called the \Fiedler vector". For details of spectral properties of networks, see Refs. [44, 51, 54, 93, 137, 139, 140, 224, 225]. When a network is undirected, one can also construct Eq. (”
- The extreme vulnerability of interdependent spatially embedded networks (2012, background): “The size of the giant component at the transition is P ∞ = P∞(x), where x is the solution of equation (3) together with its tangential condition equation (4).”