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 20 of 290 for “"random walk"”.

  1. Guided random-walk based model checking

    … issue. This technique is based on the concept of random walks. A random walk is simply a `walk' through the model of the system, carried out by selecting states in the model randomly. Such a walk may encounter an error, or it may not. It is a non-exhaustive technique in the sense that only a …

    unsw Repository record for Guided random-walk based model checking (opens in a new tab)

  2. Thick points of random walk and multiplicative chaos

    … multifractal properties of Brownian motion and random walk. Specifically, we will be interested in the set of thick points, that is points where the trajectory goes back unusually often. The study of such points was initiated sixty years ago by Erdos and Taylor and has attracted a lot of …

    cambridge Repository record for Thick points of random walk and multiplicative chaos (opens in a new tab)

  3. Inequalities for Random Walk and Partially Observed Brownian Motion

    This thesis is divided into two parts. The first part studies the control of the maximal function of N-dimensional Brownian motion, B(,t), by the maximal function of partially observed Brownian motion. Let R denote a fixed open subset of (//R)('N), G an arbitrary open subset, and T the first exit …

    uiuc Repository record for Inequalities for Random Walk and Partially Observed Brownian Motion (opens in a new tab)

  4. Kac's random walk and coupon collector's process on posets

    … open problem on the mixing time of Kac's random walk on SO(n, R) by random rotations. We obtain an upper bound mix = O (n2.5 log n) for the weak convergence which is close to the trivial lower bound [Omega] (n2). This improves the upper bound O (n4 log n) by Diaconis and SaloffCoste 1131. …

    mit Repository record for Kac's random walk and coupon collector's process on posets (opens in a new tab)

  5. Continuous representations and models from random walk diffusion limits

    … representations through diffusion limits of random walks. We show that measureable quantities of discrete random walks with a latent metric structure have closed form diffusion limits. These diffusion limits allow us to approximate attributes of the discrete random walk such as the stationary …

    mit Repository record for Continuous representations and models from random walk diffusion limits (opens in a new tab)

  6. New Directions in Bandit Learning: Singularities and Random Walk Feedback

    … In Chapter 3, I will study bandit learning with random walk trajectories as feedback. In domains including online advertisement and social networks, user behaviors can be modeled as a random walk over a network. To this end, we study a novel bandit learning problem, where each arm is the starting …

    duke Repository record for New Directions in Bandit Learning: Singularities and Random Walk Feedback (opens in a new tab)

  7. Asymptotic Comparisons of Functionals of Brownian Motion and Random Walk

    Made available in DSpace on 2014-12-14T13:09:40Z (GMT). No. of bitstreams: 1 7913512.pdf: 998360 bytes, checksum: 4c89febd8640e2d1c634278e886724d9 (MD5) Previous issue date: 1978

    uiuc Repository record for Asymptotic Comparisons of Functionals of Brownian Motion and Random Walk (opens in a new tab)

  8. Energy efficient compressed sensing in wireless sensor networks via random walk

    … is compressive distributed sensing with random walk CDS(RW); an algorithm that combines the data gathering and projection generation process of CDS.CDS(RW) uses rateless encoding, graph algorithms, and belief propagation decoding to improve upon the communication cost associated with CDS. …

    utc Repository record for Energy efficient compressed sensing in wireless sensor networks via random walk (opens in a new tab)

  9. One-Dimensional Excited Random Walk with Unboundedly Many Excitations Per Site

    <p>We study a discrete time excited random walk on the integers lattice requiring a tail decay estimate on the number of excitations per site and extend the existing framework, methods, and results to a wider class of excited random walks.</p> <p>We give criteria for recurrence versus transience, …

    cuny-grad Repository record for One-Dimensional Excited Random Walk with Unboundedly Many Excitations Per Site (opens in a new tab)

  10. Simulation of estuary mixing using a two-dimensional random walk model

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1989.

    mit Repository record for Simulation of estuary mixing using a two-dimensional random walk model (opens in a new tab)

  11. An improved directed random walk framework for cancer classification using gene expression data

    … by introducing an improved directed random walk (DRW) framework. This improved DRW framework is proposed to identify risk pathway while correctly predict the significant genes. It is named as significant directed walk (SDW) because of its ability to identify significant genes for …

    uthm Repository record for An improved directed random walk framework for cancer classification using gene expression data (opens in a new tab)

  12. Enhancements and computational evaluation of the hit-and-run random walk on polyhedra

    … a point of high symmetry value a deep point. A random walk is a procedure that starts from a particular point in Rn and at each iteration, moves to a "neighboring" point according to some probability distribution that depends solely on the current point. The Hit-and-Run random walk on a convex …

    mit Repository record for Enhancements and computational evaluation of the hit-and-run random walk on polyhedra (opens in a new tab)

  13. Exchange rate forecasting with an artificial neural network model : can we beat a random walk model?

    Developing an understanding of exchange rate movements has long been an extremely important task because an ability to produce accurate forecasts of exchange rates has practical as well as theoretical value. The practical value lies in the ability of good forecasts to provide useful information for …

    lincoln Repository record for Exchange rate forecasting with an artificial neural network model : can we beat a random walk model? (opens in a new tab)

  14. Various Approximate Methods to Measure the Uniformity of Quasirandom Sequences

    … one can substitute the use of pseudorandom numbers with quasirandom numbers and achieve improved convergence. This is because quasirandom numbers are more uniform than pseudorandom numbers. The most common measure of that uniformity is the star discrepancy. In addition, the main error …

    fsu-retro

  15. The Torsion Angle of Random Walks

    … the torsion angle of an n-step<br />equilateral random walk in 3D. We consider the random walk is generated within a confining sphere or without a confining sphere: given three consecutive vectors <sup>→</sup><em>e</em><sub>1</sub> , <sup>→</sup><em>e</em><sub>2</sub> , and …

    wku-diss Repository record for The Torsion Angle of Random Walks (opens in a new tab)

  16. Phase transition for cutoff for random walks on random graphs

    … analyse the cutoff phenomenon on two different random graph models. First, we consider a variant of the configuration model with an embedded community structure and study the mixing properties of a simple random walk on it. Every vertex has a given number of internal, degint ≥ 3, and outgoing, …

    cambridge Repository record for Phase transition for cutoff for random walks on random graphs (opens in a new tab)

  17. Analysis of the Projective Re-Normalization method on semidefinite programming feasibility problems

    … the advantages and disadvantages of a Hit & Run random walk with Dikin ball dilation. We perform this procedure on an ill-conditioned two dimensional simplex to show the Dikin ball Hit & Run random walk mixes much faster than standard Hit & Run random walk. In the last part of this thesis, we …

    mit Repository record for Analysis of the Projective Re-Normalization method on semidefinite programming feasibility problems (opens in a new tab)

Page 1 of 15