Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reducing Search Lengths with Locally Precomputed Partial Random Walks   Random walks can be used to search a complex networks for a desired resource.
To reduce the number of hops necessary to find the resource, we propose a
search mechanism based on building random walks connecting together partial
walks that have been precomputed at each network node in an initial stage. The
resources found in each partial walk are registered in its associated Bloom
filter. Searches can then jump over partial nodes in which the resource is not
located, significantly reducing search length. However, additional unnecessary
hops come from false positives at the Bloom filters. The analytic model
provided predicts the expected search length of this mechanism, the optimal
size of the partial walks and the corresponding optimal (shortest) expected
search length. Simulation experiments are used to validate these predictions
and to assess the impact of the number of partial walks precomputed in each
node.

10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
2
The categories of this paper are: math
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol