{"paper":{"title":"Hitting and Trapping Times on Branched Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Davide Cassi, Elena Agliari, Fabio Sartori, Luca Cattivelli","submitted_at":"2014-12-18T15:08:27Z","abstract_excerpt":"In this work we consider a simple random walk embedded in a generic branched structure and we find a close-form formula to calculate the hitting time $H\\left(i,f\\right)$ between two arbitrary nodes $i$ and $j$. We then use this formula to obtain the set of hitting times $\\left\\{ H\\left(i,f\\right)\\right\\} $ for combs and their expectation values, namely the mean-first passage time $\\left( \\mbox{MFPT}_{f} \\right)$, where the average is performed over the initial node while the final node $f$ is given, and the global mean-first passage time $\\left( \\mbox{GMFPT} \\right)$, where the average is perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5883","kind":"arxiv","version":2},"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"}