Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Distributed House-Hunting in Ant Colonies   We introduce the study of the ant colony house-hunting problem from a
distributed computing perspective. When an ant colony's nest becomes unsuitable
due to size constraints or damage, the colony must relocate to a new nest. The
task of identifying and evaluating the quality of potential new nests is
distributed among all ants. The ants must additionally reach consensus on a
final nest choice and the full colony must be transported to this single new
nest. Our goal is to use tools and techniques from distributed computing theory
in order to gain insight into the house-hunting process.
  We develop a formal model for the house-hunting problem inspired by the
behavior of the Temnothorax genus of ants. We then show a \Omega(log n) lower
bound on the time for all n ants to agree on one of k candidate nests. We also
present two algorithms that solve the house-hunting problem in our model. The
first algorithm solves the problem in optimal O(log n) time but exhibits some
features not characteristic of natural ant behavior. The second algorithm runs
in O(k log n) time and uses an extremely simple and natural rule for each ant
to decide on the new nest.

33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg
13
The categories of this paper are: quant-ph
11
The categories of this paper are: hep-lat
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex