The Mean Escape Time for a Narrow Escape Problem with Multiple Switching Gates | Zendy

Josselin Garnier | Zendy; H. Ammari | Zendy; H. Kang | Zendy; H. Lee | Zendy; K. Solna | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Mean Escape Time for a Narrow Escape Problem with Multiple Switching Gates

Author(s) -

Josselin Garnier,

H. Ammari,

H. Kang,

H. Lee,

K. Solna

Publication year - 2011

Publication title -

multiscale modeling and simulation

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.037

H-Index - 70

eISSN - 1540-3467

pISSN - 1540-3459

DOI - 10.1137/100817103

Subject(s) - mathematics , brownian motion , set (abstract data type) , domain (mathematical analysis) , topology (electrical circuits) , statistical physics , computer science , mathematical analysis , combinatorics , physics , statistics , programming language

This article deals with the narrow escape problem when there are two gates which open alternatively in a random way. We set up the problem and carry out a rigorous asymptotic analysis to derive the mean escape time (MET) for a Brownian particle inside a domain to exit the domain through the switching gates. We show that the MET decreases as the switching rate between the gates increases, and we give upper and lower bounds for the decay rate. We then consider the case when there are multiple switching gates and derive the leading-order term of the asymptotic expansion of the MET.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research