The problem faced in this paper is related to the comparison between two undirected networks on
actors. Actors are in two different configurations
=1,2). Comparison is based on the evaluation of the how the relational node distances evolve in the passage from the first net (
) to the second net (
). The procedure consists of two steps: (
) define an appropriate relational distance among nodes of the two networks; (
) compare the corresponding distance matrices. The first step is based on the so-called Euclidean Commute-Time Distance among the
nodes computed from a random walk on the graph and Laplacian matrix. The second step concerns the comparison between the obtained distance matrices by using Multidimensional Scaling techniques. The procedure has a wide range of application, especially for experimental purposes in social network applications where this issue has not been treated systematically.