In r-neighbor bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expands by infecting all uninfected vertices that have at least r infected neighbors. We study the distribution of the time at which all vertices become infected. Given d ≥ r ≥ 2 and t = t(n) = o ( (log n/ log logn)1/(d−r+...

Graph-based semi-supervised learning (SSL) algorithms have been widely applied in large-scale machine learning. In this work, we show different graph-based SSL methods (modified adsorption, measure propagation, and prior-based measure propagation) and compare them to the standard label propagation algorithm on a phonetic classification task. In addition, we compare 4 different ways of construct...

(a) (i) Since T is a connected graph with ≥ 2 vertices, there are edges in T . Hence, any maximal path in T has length ≥ 1, and thus two distinct end vertices. Let v0, vk be the end vertices of such a path P = (v0, v1, . . . , vk). As T is acyclic, the only neighbor of v0 on P is v1 and the only neighbor of vk on P is vk−1. Because P was chosen to be maximal, both v0 and vk have no neighbors ou...

The path of an object in apparent motion depends on correspondence matching, the decision that images seen at different places and at different times represent the same object. One determinant of correspondence is proximity. Still debated, however, is whether proximity is defined in a two- or three-dimensional spatial representation. Observers judged the motion path taken by an object with two ...

In this article, we introduce a way to distribute an index database of XML documents on an unstructured peer-to-peer network with a flat topology (i.e. with no super-peer). We then show how to perform content path query routing in such networks. Nodes in the network maintain a set of Multi Level Bloom Filters that summarises structural properties of XML documents. They propagate part of this in...

In mobile ad hoc networks, common mobility during the communication of data causes route failure which results in path rediscovery. In this, we suggest strategic routing topology for route resurgence by congestion endurance in Mobile Ad hoc Networks. In this topology, every source and destination pair establishes manifold paths in the single route discovery and they are cached in their route ca...

In order to improve the Peer-to-Peer (P2P) network resource locating efficiency and isolate malicious peers, a topology adjustment algorithm for unstructured P2P networks is proposed. TTL (time-to-live) value for each neighbor has been set up and adjusted; specific information on the query path is recorded; a topology adjustment algorithm is given. The topology adjustment algorithm is evaluated...

HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optimally mapping the network to physical near neighbor nodes. We include a proof that a final state of HeteroSort (barren best trades of the Wren cycle) is always a detection of termination of sorting. By capturing global...