most citedCommunicability in complex networks

769 citations · 1.2k across the 6 of their papers we have counts for

collaborators

6 papers

physics.soc-ph200974 cited

Communicability Graph and Community Structures in Complex Networks

Ernesto Estrada, Naomichi Hatano

We use the concept of the network communicability (Phys. Rev. E 77 (2008) 036111) to define communities in a complex network. The communities are defined as the cliques of a commun…

physics.soc-ph2009136 cited

Communicability Betweenness in Complex Networks

Ernesto Estrada, Desmond J. Higham, Naomichi Hatano

Betweenness measures provide quantitative tools to pick out fine details from the massive amount of interaction data that is available from large complex networks. They allow us to…

physics.soc-ph200932 cited

Communicability and multipartite structures in complex networks at negative absolute temperatures

Ernesto Estrada, Desmond J. Higham, Naomichi Hatano

We here present a method of clearly identifying multi-partite subgraphs in a network. The method is based on a recently introduced concept of the communicability, which very clearl…

physics.chem-ph20095 cited

Tight-binding 'dihedral orbitals' approach to electronic communicability in macromolecular chains

Ernesto Estrada, Naomichi Hatano

An electronic orbital of a dihedral angle of a molecular chain is introduced. A tight-binding Hamiltonian on the basis of the dihedral orbitals is defined. This yields the Green's…

physics.soc-ph2009188 cited

Statistical-mechanical approach to subgraph centrality in complex networks

Ernesto Estrada, Naomichi Hatano

We interpret the subgraph centrality as the partition function of a network. The entropy, the internal energy and the Helmholtz free energy are defined for networks and molecular g…

physics.soc-ph2007769 cited

Communicability in complex networks

Ernesto Estrada, Naomichi Hatano

Many topological and dynamical properties of complex networks are defined by assuming that most of the transport on the network flows along the shortest paths. However, there are d…