skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Markov jump processes with finite variance on bounded domains.


Abstract not provided.

; ; ; ; ; ; ;
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the Brownian Motion in Confined Geometries held March 16-21, 2014 in Dresden, Germany.
Country of Publication:
United States

Citation Formats

Lehoucq, Richard B., Bond, Stephen D, D'Elia, Marta, Du, QIang, Gunzburger, Max Donald, Burch, Nate, McKinley, Scott, and Rowe, Stephen. Markov jump processes with finite variance on bounded domains.. United States: N. p., 2014. Web.
Lehoucq, Richard B., Bond, Stephen D, D'Elia, Marta, Du, QIang, Gunzburger, Max Donald, Burch, Nate, McKinley, Scott, & Rowe, Stephen. Markov jump processes with finite variance on bounded domains.. United States.
Lehoucq, Richard B., Bond, Stephen D, D'Elia, Marta, Du, QIang, Gunzburger, Max Donald, Burch, Nate, McKinley, Scott, and Rowe, Stephen. Sat . "Markov jump processes with finite variance on bounded domains.". United States. doi:.
title = {Markov jump processes with finite variance on bounded domains.},
author = {Lehoucq, Richard B. and Bond, Stephen D and D'Elia, Marta and Du, QIang and Gunzburger, Max Donald and Burch, Nate and McKinley, Scott and Rowe, Stephen},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Sat Mar 01 00:00:00 EST 2014},
month = {Sat Mar 01 00:00:00 EST 2014}

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • We provide a new approach for analyzing both static and dynamic randomized load balancing strategies. We demonstrate the approach by providing the first analysis of the following model: customers arrive as a Poisson stream of rate {lambda}n, {lambda} < 1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers, and waits for service at the one with the fewest customers. Customers are served according to the first-in first-out (FIFO) protocol, and the service time for a customer is exponentially distributed with mean 1. We call this problemmore » the supermarket model. We wish to know how the system behaves, and in particular we are interested the expected time a customer spends in the system in equilibrium. The model provides a good abstraction of a simple, efficient load balancing scheme in the setting where jobs arrive at a large system of parallel processors. This model appears more realistic than similar models studied previously, in that it is both dynamic and open: that is, customers arrive over time, and the number of customers is not fixed. Our approach consists of two distinct stages: we first develop a limiting, deterministic model representing the behavior as n {r_arrow} {infinity}, and then show how to translate results from this model to results for large, but finite, values of n. The analysis of the deterministic model is interesting in its own right. This methodology proves effective for studying a number of similar problems, and simulations demonstrate that the method accurately predicts system behavior even for relatively small systems.« less
  • Abstract not provided.
  • We introduce singular perturbation methods for constructing asymptotic approximations to the mean first passage time for Markov jump processes. Our methods are applied directly to the integral equation for the mean first passage time and do not involve the use of diffusion approximations. An absorbing interval condition is used to properly account for the possible jumps of the process over the boundary which leads to a Wiener-Hopf problem in the neighborhood of the boundary. A model of unimolecular dissociation is considered to illiustrate our method.
  • Consider a non-symmetric generalized diffusion X( Dot-Operator ) in Double-Struck-Capital-R {sup d} determined by the differential operator A(x) = -{Sigma}{sub ij} {partial_derivative}{sub i}a{sub ij}(x){partial_derivative}{sub j} + {Sigma}{sub i} b{sub i}(x){partial_derivative}{sub i}. In this paper the diffusion process is approximated by Markov jump processes X{sub n}( Dot-Operator ), in homogeneous and isotropic grids G{sub n} Subset-Of Double-Struck-Capital-R {sup d}, which converge in distribution in the Skorokhod space D([0,{infinity}), Double-Struck-Capital-R {sup d}) to the diffusion X( Dot-Operator ). The generators of X{sub n}( Dot-Operator ) are constructed explicitly. Due to the homogeneity and isotropy of grids, the proposed method for d{>=}3 canmore » be applied to processes for which the diffusion tensor {l_brace}a{sub ij}(x){r_brace}{sub 11}{sup dd} fulfills an additional condition. The proposed construction offers a simple method for simulation of sample paths of non-symmetric generalized diffusion. Simulations are carried out in terms of jump processes X{sub n}( Dot-Operator ). For piece-wise constant functions a{sub ij} on Double-Struck-Capital-R {sup d} and piece-wise continuous functions a{sub ij} on Double-Struck-Capital-R {sup 2} the construction and principal algorithm are described enabling an easy implementation into a computer code.« less
  • A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze itsmore » properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.« less