Large scale distributed Web crawling system using voluntarily contributed personal computing resources allows small companies to build their own search engines with very low cost. The biggest challenge for such system is how to implement the functionalities equivalent to that of the traditional search engines under a fluctuating distributed environment. One of the functionalities is incremental...

The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion of mixing of a random walk on a (undirected) graph, called local mixing. Informally, the local mixing with respect to a given node s, is the mixing of a rando...

The synchronization problem of new discrete-time complex networks with randomly occurring coupling and distributed time-varying delay is investigated. Compared with the previous work, the distributed delay is assumed to be timevarying. Moreover, the effects of both variation range and probability distribution of distributed time-varying delay are taken into consideration. The randomly occurring...