Physics Letters A

Acesso restrito: Texto completo. p. 5265-5269 Submitted by JURANDI DE SOUZA SILVA (jssufba@hotmail.com) on 2012-06-06T17:41:17Z No. of bitstreams: 1 __ac.els-cdn.com_S037596...c471b0794ad18aed68a88bbcb307e.pdf: 449087 bytes, checksum: c63d3a64b2c3c2513076b5daf3b4ef2b (MD5) Made available in DSpace on 2012-06-06T17:41:17Z (GMT). No. of bitstreams: 1 __ac.els-cdn.com_S037596...c471b0794ad18aed68a88bbcb307e.pdf: 449087 bytes, checksum: c63d3a64b2c3c2513076b5daf3b4ef2b (MD5) Previous issue date: 2008 A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade,J.G.V. Miranda, T.P. Lobão, Phys. Rev. E 73 (2006) 046101] is used to define a distance between networks with the same number of nodes. With such measure, expressed in terms of the matrix elements of the neighborhood matrices of each network, it is possible to compare, in a quantitative way, how far apart in the space of neighborhood matrices two networks are. The distance between these matrices depends on both the network topologies and the adopted node numberings. While the numbering of one network is fixed, a Monte Carlo algorithm is used to find the best numbering of the other network, in the sense that it minimizes the distance between the matrices. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise only from distinct topologies. This procedure ends up by providing a projection of the first network on the pattern of the second one. Examples are worked out allowing for a quantitative comparison for distances among distinct networks, as well as among distinct realizations of random networks.