Haji Ali, Abdul Lateef; Nobile, Fabio; Tamellini, Lorenzo; Tempone, Raul(2016-01-06)[Poster]
In this work we introduce the Multi-Index Stochastic Collocation method (MISC) for computing statistics of the solution of a PDE with random data. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the space of random data. We propose an optimization procedure to select the most effective mixed differences to include in the MISC estimator: such optimization is a crucial step and allows us to build a method that, provided with sufficient solution regularity, is potentially more effective than other multi-level collocation methods already available in literature. We then provide a complexity analysis that assumes decay rates of product type for such mixed differences, showing that in the optimal case the convergence rate of MISC is only dictated by the convergence of the deterministic solver applied to a one dimensional problem. We show the effectiveness of MISC with some computational tests, comparing it with other related methods available in the literature, such as the Multi-Index and Multilevel Monte Carlo, Multilevel Stochastic Collocation, Quasi Optimal Stochastic Collocation and Sparse Composite Collocation methods.
Markovian pure jump processes can model many phenomena, e.g. chemical reactions at molecular level, protein transcription and translation, spread of epidemics diseases in small populations and in wireless communication networks among many others. In this work we present a novel hybrid algorithm for simulating individual trajectories which adaptively switches between the SSA and the Chernoff tauleap methods. This allows us to: (a) control the global exit probability of any simulated trajectory, (b) obtain accurate and computable estimates for the expected value of any smooth observable of the process with minimal computational work.
Haji Ali, Abdul Lateef; Nobile, Fabio; Tempone, Raul(2016-01-06)[Poster]
We propose and analyze a novel Multi-Index Monte Carlo (MIMC) method for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The MIMC method is both a stochastic version of the combination technique introduced by Zenger, Griebel and collaborators and an extension of the Multilevel Monte Carlo (MLMC) method first described by Heinrich and Giles. Inspired by Giles s seminal work, instead of using first-order differences as in MLMC, we use in MIMC high-order mixed differences to reduce the variance of the hierarchical differences dramatically. Under standard assumptions on the convergence rates of the weak error, variance and work per sample, the optimal index set turns out to be of Total Degree (TD) type. When using such sets, MIMC yields new and improved complexity results, which are natural generalizations of Giles s MLMC analysis, and which increase the domain of problem parameters for which we achieve the optimal convergence, O(TOL-2).
Ben Hammouda, Chiheb; Moraes, Alvaro; Tempone, Raul(2016-01-06)[Poster]
The dynamics of biochemical reactive systems with small copy numbers of one or more reactant molecules is dominated by stochastic effects. For those systems, discrete state-space and stochastic simulation approaches were proved to be more relevant than continuous state-space and deterministic ones. In systems characterized by having simultaneously fast and slowtimescales, the existing discrete space-state stochastic path simulation methods such as the stochastic simulation algorithm (SSA) and the explicit tauleap method can be very slow. Implicit approximations were developed in the literature to improve numerical stability and provide efficient simulation algorithms
for those systems. In this work, we propose an efficient Multilevel Monte Carlo method in the spirit of the work by Anderson and Higham (2012) that uses drift-implicit tau-leap approximations at levels where the explicit tauleap method is not applicable due to numerical stability issues. We present numerical examples that illustrate the performance of the proposed method.
In , we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks (SRNs) specifically designed for systems in which the set of reaction channels can be adaptively partitioned into two subsets characterized by either high or low activity. To estimate expected values of observables of the system, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This is achieved with a computational complexity of order O(TOL-2). We also present a novel control variate technique which may dramatically reduce the variance of the coarsest level at a negligible computational cost.
Markovian pure jump processes can model many phenomena, e.g. chemical reactions at molecular level, protein transcription and translation, spread of epidemics diseases in small populations and in wireless communication networks, among many others. In this work  we present a novel multilevel algorithm for the Chernoff-based hybrid tauleap algorithm. This variance reduction technique allows us to: (a) control the global exit probability of any simulated trajectory, (b) obtain accurate and computable estimates for the expected value of any smooth observable of the process with minimal computational work.
The export option will allow you to export the current search results of the entered query to a file. Different
formats are available for download. To export the items, click on the button corresponding with the preferred download format.
By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.
For anonymous users the allowed maximum amount is 50 search results.
To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export.
The amount of items that can be exported at once is similarly restricted as the full export.
After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.