{"paper":{"title":"Number of Common Sites Visited by N Random Walkers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Mikhail V. Tamm, Satya N. Majumdar","submitted_at":"2012-06-27T06:43:26Z","abstract_excerpt":"We compute analytically the mean number of common sites, W_N(t), visited by N independent random walkers each of length t and all starting at the origin at t=0 in d dimensions. We show that in the (N-d) plane, there are three distinct regimes for the asymptotic large t growth of W_N(t). These three regimes are separated by two critical lines d=2 and d=d_c(N)=2N/(N-1) in the (N-d) plane. For d<2, W_N(t)\\sim t^{d/2} for large t (the N dependence is only in the prefactor). For 2<d<d_c(N), W_N(t)\\sim t^{\\nu} where the exponent \\nu= N-d(N-1)/2 varies with N and d. For d>d_c(N), W_N(t) approaches a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6184","kind":"arxiv","version":1},"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"}