Abstract Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting probability, is often of considerable interest. In this work we determine hitting probabilities for stochastic search processes conditioned on being faster than a random short time. Such times have been used to model stochastic resetting or stochastic inactivation. These results apply to any search process, diffusive or otherwise, whose unconditional short-time behavior can be adequately approximated, which we characterize for broad classes of stochastic search. We illustrate these results in several examples and show that the conditional hitting probabilities depend predominantly on the relative geodesic lengths between the initial position of the searcher and the targets. Finally, we apply these results to a canonical evidence accumulation model for decision making.
more »
« less
Quantification of model uncertainty on path-space via goal-oriented relative entropy
Quantifying the impact of parametric and model-form uncertainty on the predictions of stochastic models is a key challenge in many applications. Previous work has shown that the relative entropy rate is an effective tool for deriving path-space uncertainty quantification (UQ) bounds on ergodic averages. In this work we identify appropriate information-theoretic objects for a wider range of quantities of interest on path-space, such as hitting times and exponentially discounted observables, and develop the corresponding UQ bounds. In addition, our method yields tighter UQ bounds, even in cases where previous relative-entropy-based methods also apply, e.g. , for ergodic averages. We illustrate these results with examples from option pricing, non-reversible diffusion processes, stochastic control, semi-Markov queueing models, and expectations and distributions of hitting times.
more »
« less
- Award ID(s):
- 2008970
- PAR ID:
- 10356229
- Date Published:
- Journal Name:
- ESAIM: Mathematical Modelling and Numerical Analysis
- Volume:
- 55
- Issue:
- 1
- ISSN:
- 0764-583X
- Page Range / eLocation ID:
- 131 to 169
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Uncertainty quantification (UQ) is an important part of mathematical modeling and simulations, which quantifies the impact of parametric uncertainty on model predictions. This paper presents an efficient approach for polynomial chaos expansion (PCE) based UQ method in biological systems. For PCE, the key step is the stochastic Galerkin (SG) projection, which yields a family of deterministic models of PCE coefficients to describe the original stochastic system. When dealing with systems that involve nonpolynomial terms and many uncertainties, the SG-based PCE is computationally prohibitive because it often involves high-dimensional integrals. To address this, a generalized dimension reduction method (gDRM) is coupled with quadrature rules to convert a high-dimensional integral in the SG into a few lower dimensional ones that can be rapidly solved. The performance of the algorithm is validated with two examples describing the dynamic behavior of cells. Compared to other UQ techniques (e.g., nonintrusive PCE), the results show the potential of the algorithm to tackle UQ in more complicated biological systems.more » « less
-
This article proposes a modified generative adversarial network (GAN)-based approach, namely Wasserstein GAN (WGAN), for the uncertainty quantification (UQ) in partial equivalent element circuit (PEEC) models. Initially, the stochastic PEEC is constructed to obtain the sample data of the quantities of interest (QoI). This sample data, along with the fake data from the generator, serves as input for the discriminator in WGAN. The loss function of the generator in WGAN is constructed using the Wasserstein distance to provide a more usable gradient than that in the traditional GAN. By estimating the distribution of sample data using the fake data in the discriminator, the stochastic properties of the QoI can be finally obtained. Notably, the proposed method can efficiently estimate the stochastic characteristics of the QoI without prior knowledge of its probability distribution. Two numerical examples are provided to validate the proposed method. It is demonstrated that the proposed WGAN method effectively quantifies uncertainty in PEEC models. Compared to traditional methods, the proposed WGAN achieves a remarkable 20-fold increase in computational speed. Consequently, our work offers a powerful machine learning tool for advanced UQ in complex electromagnetic simulations.more » « less
-
We revisit the variational characterization of conservative di↵usion as entropic gra- dient flow and provide for it a probabilistic interpretation based on stochastic calculus. It was shown by Jordan, Kinderlehrer, and Otto that, for diffusions of Langevin–Smoluchowski type, the Fokker–Planck probability density flow maximizes the rate of relative entropy dissipation, as mea- sured by the distance traveled in the ambient space of probability measures with finite second moments, in terms of the quadratic Wasserstein metric. We obtain novel, stochastic-process ver- sions of these features, valid along almost every trajectory of the dffusive motion in the backwards direction of time, using a very direct perturbation analysis. By averaging our trajectorial results with respect to the underlying measure on path space, we establish the maximal rate of entropy dissipation along the Fokker–Planck flow and measure exactly the deviation from this maximum that corresponds to any given perturbation. A bonus of our trajectorial approach is that it derives the HWI inequality relating relative entropy (H), Wasserstein distance (W), and relative Fisher information (I).more » « less
-
Abstract Relative entropy serves as a cornerstone concept in quantum information theory. In this work, we study relative entropy of random states from major generic state models of Hilbert–Schmidt (HS) and Bures–Hall ensembles. In particular, we derive exact yet explicit formulas of average relative entropy of two independent states of arbitrary dimensions from the same ensemble as well as from two different ensembles. One ingredient in obtaining the results is the observed factorization of ensemble averages after evaluating the required unitary integral. The derived exact formula in the case of HS ensemble complements the work by Kudler-Flam (2021 Phys Rev Lett126171603), where the corresponding asymptotic formula for states of equal dimensions was obtained based on the replica method.more » « less
An official website of the United States government

