Ephemeral networks with random availability of links: The case of fast networks ?
We define the Temporal Diameter (TD) and the expected TD of temporal networks with random availabilities of links. We define fast and slow random temporal networks, according to their expected TD. Random temporal networks on instances of dense (directed) random graphs Gn,p G n , p are fast. We introduce the critical availability as a measure of periodic availability of links. We give a lower and an upper bound on the critical availability.
availability diameter temporal networks random input