{"paper":{"title":"Optimal recruitment strategies for groups of interacting walkers with leaders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.bio-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Cristobal Lopez, Federico Vazquez, Ricardo Martinez-Garcia","submitted_at":"2014-09-09T17:18:28Z","abstract_excerpt":"We introduce a model of interacting random walkers on a finite one dimensional chain with absorbing boundaries or targets at the ends. Walkers are of two types: informed particles that move ballistically towards a given target, and diffusing uninformed particles that are biased towards close informed particles. This model mimics the dynamics of hierarchical groups of animals, where an informed individual tries to persuade and lead the movement of its conspecifics. We characterize the success of the persuasion by the first-passage probability of the uninformed particle to the target, and we int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2822","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}