Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"ruin problem"”.

  1. A simulation of random walks for use as an educational device.

    … modeling is often overshadowed by the problems that confront both students and instructors of probability. The counter-intuitive conclusions which arise produce both ambiguities and misunderstandings. In this thesis, the techniques of computer simulation have been combined with the …

    nps Repository record for A simulation of random walks for use as an educational device. (opens in a new tab)

  2. On the distribution of the time to ruin and related topics

    … has been made on the analysis of various ruin-related quantities in risk theory. As we know, the discounted penalty function not only provides a systematic platform to jointly analyze various quantities of interest, but also offers the convenience to extract key pieces of information from …

    waterloo Repository record for On the distribution of the time to ruin and related topics (opens in a new tab)

  3. Topological and synchronicity effects in reaction efficiency

    … An analytical method based on the classical ruin problem is developed to compute the mean reaction time between two walkers undergoing a generalized random walk on a 1d lattice. At each time step, either both walkers diffuse simultaneously with probability p (synchronous event) or one of them …

    iastate Repository record for Topological and synchronicity effects in reaction efficiency (opens in a new tab)

  4. A Framework for Computing Discrete-Time Systems and Functions using DNA

    … We demonstrate our method for the Gambler’s Ruin problem as an instance of the Markov chain process. We analyze the method according to both the stochastic chemical kinetics and the mass-action kinetics model. Additionally, we propose a novel {\em unipolar molecular encoding} approach to …

    umn Repository record for A Framework for Computing Discrete-Time Systems and Functions using DNA (opens in a new tab)

  5. A Generalized Acceptance Urn Model

    … the expected gain under various conditions. The problem of minimal gain is then considered, which is a version of the ballot problem. We then consider a Bayesian approach for the general urn, for which the number of balls n is known while the number of "+t" balls, p, is unknown. We find formulas …

    usf Repository record for A Generalized Acceptance Urn Model (opens in a new tab)