2022
DOI: 10.48550/arxiv.2201.01994
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Optimal Resetting Brownian Bridges

Abstract: We introduce a resetting Brownian bridge as a simple model to study search processes where the total search time t f is finite and the searcher returns to its starting point at t f . This is simply a Brownian motion with a Poissonian resetting rate r to the origin which is constrained to start and end at the origin at time t f . We first provide a rejection-free algorithm to generate such resetting bridges in all dimensions by deriving an effective Langevin equation with an explicit space-time dependent drift … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
4
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 77 publications
(98 reference statements)
0
4
0
Order By: Relevance
“…In most cases, this quantity is not known analytically but when it is at our disposal, Doob's technique has been successfully applied to various kinds of conditioned processes [1,11,[15][16][17]. This approach continues to attract intense research efforts, mostly aimed at extending the range of applicability of the Doob theory, for instance towards discrete-time constrained random walks and Lévy flights [18,19], run-and-tumble trajectories [20], processes with resetting [21], or non-intersecting Brownian bridges [22].…”
Section: Introductionmentioning
confidence: 99%
“…In most cases, this quantity is not known analytically but when it is at our disposal, Doob's technique has been successfully applied to various kinds of conditioned processes [1,11,[15][16][17]. This approach continues to attract intense research efforts, mostly aimed at extending the range of applicability of the Doob theory, for instance towards discrete-time constrained random walks and Lévy flights [18,19], run-and-tumble trajectories [20], processes with resetting [21], or non-intersecting Brownian bridges [22].…”
Section: Introductionmentioning
confidence: 99%
“…Let us also mention the conditioning in the presence of killing rates [3,[21][22][23][24][25][26][27][28] or when the killing occurs only via an absorbing boundary condition [29][30][31][32]. Note that stochastic bridges have been studied for many other Markov processes, including various diffusions processes [33][34][35], discretetime random walks and Lévy flights [36][37][38], continuous-time Markov jump processes [38], run-and-tumble trajectories [39], or processes with resetting [40].…”
Section: Introductionmentioning
confidence: 99%
“…In the field of diffusion processes, the basic example of the Brownian bridge has been extended to many other conditioning constraints, including the Brownian excursion [12,13], the Brownian meander [14], the taboo process [15][16][17][18][19][20], or non-intersecting Brownian bridges [21]. Besides diffusion processes, the stochastic bridges have been studied for many other Markov processes, including discrete-time random walks and Lévy flights [22][23][24], continuous-time Markov jump processes [24], run-and-tumble trajectories [25], or processes with resetting [26].…”
Section: Introductionmentioning
confidence: 99%