In this paper, a new topological approach for studying a sufficiently long random number sequence is proposed. By segmenting the sequence into groups of digits which represent the node identities while the undirected edges symbolize the adjacency between them, a network is constructed for...

Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph...