European Physical Journal B

p. 247-256 Submitted by JURANDI DE SOUZA SILVA (jssufba@hotmail.com) on 2012-07-18T15:20:23Z No. of bitstreams: 1 __www.springerlink.com_c...m08tk08r56501v6n_fulltext.pdf: 481637 bytes, checksum: d870ac096ad1b250f8c10bd60dc62cc4 (MD5) Made available in DSpace on 2012-07-18T15:20:23Z (GMT). No. of bitstreams: 1 __www.springerlink.com_c...m08tk08r56501v6n_fulltext.pdf: 481637 bytes, checksum: d870ac096ad1b250f8c10bd60dc62cc4 (MD5) Previous issue date: 2008 A concept of higher order neighborhood in complex networks, introduced previously [Phys. Rev. E 73, 046101 (2006)], is systematically explored to investigate larger scale structures in complex networks. The basic idea is to consider each higher order neighborhood as a network in itself, represented by a corresponding adjacency matrix, and to settle a plenty of new parameters in order to obtain a best characterization of the whole network. Usual network indices are then used to evaluate the properties of each neighborhood. The identification of high order neighborhoods is also regarded as intermediary step towards the evaluation of global network properties, like the diameter, average shortest path between node, and network fractal dimension. Results for a large number of typical networks are presented and discussed.