In this chapter we study the access time on random walks, i.e., the expected time for a random walk starting at a node vi to reach a node vj, an index that can be easily calculated resorting to the powerful tools of positive systems. In particular, we argue that such an index can be the base for developing novel topological descriptors, namely access time eccentricity and diameter. While regular eccentricities and diameter are defined considering minimum paths, the indices defined in this chapter are related to random movements across the network, which may follow inefficient paths, and are thus a complementary measure to identify central and peripheral nodes and to set adequate time-to-live for the packets in a network of distributed agents, where few or no routing information is available. A simulation campaign aimed at showing the characteristics of the proposed indices concludes the chapter.
Access time eccentricity and diameter
Oliva G;Setola R;
2017-01-01
Abstract
In this chapter we study the access time on random walks, i.e., the expected time for a random walk starting at a node vi to reach a node vj, an index that can be easily calculated resorting to the powerful tools of positive systems. In particular, we argue that such an index can be the base for developing novel topological descriptors, namely access time eccentricity and diameter. While regular eccentricities and diameter are defined considering minimum paths, the indices defined in this chapter are related to random movements across the network, which may follow inefficient paths, and are thus a complementary measure to identify central and peripheral nodes and to set adequate time-to-live for the packets in a network of distributed agents, where few or no routing information is available. A simulation campaign aimed at showing the characteristics of the proposed indices concludes the chapter.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
