• Treffer 20 von 74
Zurück zur Trefferliste

From single-particle stochastic kinetics to macroscopic reaction rates

  • We consider the first-passage problem for N identical independent particles that are initially released uniformly in a finite domain Ω and then diffuse toward a reactive area Γ, which can be part of the outer boundary of Ω or a reaction centre in the interior of Ω. For both cases of perfect and partial reactions, we obtain the explicit formulas for the first two moments of the fastest first-passage time (fFPT), i.e., the time when the first out of the N particles reacts with Γ. Moreover, we investigate the full probability density of the fFPT. We discuss a significant role of the initial condition in the scaling of the average fFPT with the particle number N, namely, a much stronger dependence (1/N and 1/N² for partially and perfectly reactive targets, respectively), in contrast to the well known inverse-logarithmic behaviour found when all particles are released from the same fixed point. We combine analytic solutions with scaling arguments and stochastic simulations to rationalise our results, which open new perspectives forWe consider the first-passage problem for N identical independent particles that are initially released uniformly in a finite domain Ω and then diffuse toward a reactive area Γ, which can be part of the outer boundary of Ω or a reaction centre in the interior of Ω. For both cases of perfect and partial reactions, we obtain the explicit formulas for the first two moments of the fastest first-passage time (fFPT), i.e., the time when the first out of the N particles reacts with Γ. Moreover, we investigate the full probability density of the fFPT. We discuss a significant role of the initial condition in the scaling of the average fFPT with the particle number N, namely, a much stronger dependence (1/N and 1/N² for partially and perfectly reactive targets, respectively), in contrast to the well known inverse-logarithmic behaviour found when all particles are released from the same fixed point. We combine analytic solutions with scaling arguments and stochastic simulations to rationalise our results, which open new perspectives for studying the relevance of multiple searchers in various situations of molecular reactions, in particular, in living cells.zeige mehrzeige weniger

Volltext Dateien herunterladen

  • pmnr1018.pdfeng
    (3439KB)

    SHA-1: 78112907bd350e0c78506247b8a455b5a6682e29

Metadaten exportieren

Weitere Dienste

Suche bei Google Scholar Statistik - Anzahl der Zugriffe auf das Dokument
Metadaten
Verfasserangaben:Denis S. GrebenkovORCiD, Ralf MetzlerORCiDGND, Gleb OshaninORCiDGND
URN:urn:nbn:de:kobv:517-opus4-484059
DOI:https://doi.org/10.25932/publishup-48405
ISSN:1866-8372
Titel des übergeordneten Werks (Deutsch):Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe
Untertitel (Englisch):fastest first-passage time of N random walkers
Schriftenreihe (Bandnummer):Zweitveröffentlichungen der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe (1018)
Publikationstyp:Postprint
Sprache:Englisch
Datum der Erstveröffentlichung:24.11.2020
Erscheinungsjahr:2020
Veröffentlichende Institution:Universität Potsdam
Datum der Freischaltung:24.11.2020
Freies Schlagwort / Tag:diffusion; fastest first-passage time of N walkers; first-passage
Ausgabe:1018
Seitenanzahl:29
Quelle:New Journal of Physics 22 (2020) Art. 103004 DOI: 10.1088/1367-2630/abb1de
Organisationseinheiten:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Physik und Astronomie
DDC-Klassifikation:5 Naturwissenschaften und Mathematik / 53 Physik / 530 Physik
Peer Review:Referiert
Publikationsweg:Open Access / Green Open-Access
Lizenz (Deutsch):License LogoCC-BY - Namensnennung 4.0 International
Externe Anmerkung:Bibliographieeintrag der Originalveröffentlichung/Quelle
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.