no code implementations • 12 Dec 2018 • Mucong Ding, Kwok Yip Szeto
We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node.
no code implementations • 13 Dec 2014 • Ho Tat Lam, Kwok Yip Szeto
For a search in the space of all possible topologies of the connected network with N nodes and L links, genetic operators such as mutation and crossover are applied to the adjacency matrix through a string representation.
