Sublinear algorithms aim to decide a graph property in much less than \(n\)  time, \(n\)  being the number of nodes [1]}. It is possible to check if one graph has noticeably more substructures such as cliques, cycles, or even minors than another graph in constant time [2]}, [3]}, [4]}. It is also possible to estimate counts of such substructures in sublinear time [5]}, [6]}, [7]}. All of this can be achieved by either by performing random walks [6]}, [7]} or by investigating local neighborhoods of random nodes [2]}, [3]}, [4]}. We will show that AgentNet can do both, local investigations and random walks.
