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 27 for “"Random walks (Mathematics)"”.

  1. Ladder indices and other topics in random walk

    … thread the study of drift and extremes of a random walk. This is studied in a number of ways - in terms of the number of ladder steps and the expected size of these ladder steps, as well as directly. Many of the results achieved are more general versions of known results (e.g. the generating …

    anu Repository record for Ladder indices and other topics in random walk (opens in a new tab)

  2. Solving random walk problems using resistive analogues

    The classical method of solving random walk problems involves using Markov chain theory. When the particular random walk of interest is written in matrix form using Markov chain theory, the problem must then be solved using a digital computer. To solve all but the most trivial random walk problems …

    portland-state Repository record for Solving random walk problems using resistive analogues (opens in a new tab)

  3. A race toward the origin between n random walks

    … studies systems of "competing" discrete random walks as discrete and continuous time processes. A system is thought of as containing n imaginary particles performing random walks on lines parallel to the x-axis in Cartesian space. The particles act completely independently of each other …

    vt Repository record for A race toward the origin between n random walks (opens in a new tab)

  4. Quantum Walks and Pretty Good State transfer on Paths

    … one part of the computer to another. Quantum walks, the quantum analogues of classical random walks, provide one potential method for resolving this challenge. In this thesis, we use techniques from algebraic graph theory and number theory to analyze the mathematical model for continuous time …

    waterloo Repository record for Quantum Walks and Pretty Good State transfer on Paths (opens in a new tab)

  5. 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)

  6. Limit theorems for discrete parameter random evolutions

    Thesis (Ph. D.)--Michigan State University. Department of Statistics and Probability, 1982

    msu Repository record for Limit theorems for discrete parameter random evolutions (opens in a new tab)

  7. Branching interval partition diffusions, the on/off Brownian snake, and random walks on Coxeter interchange graphs

    … sequence can be rapidly sampled, via simple random walks on the interchange graphs of Brualdi and Li. These graphs are generated by the cyclically directed triangle, in the sense that traversing an edge corresponds to the reversal of such a triangle in a tournament. We study Coxeter …

    oxford Repository record for Branching interval partition diffusions, the on/off Brownian snake, and random walks on Coxeter interchange graphs (opens in a new tab)

  8. Inhomogeneous spatial branching processes

    … of branching Brownian in a high dimensional random environment. Here we show that the exponential number of particles produces a law of large numbers effect and that the first order of the speed of the front is linear and non-random. Thirdly, we study branching Brownian motion in …

    oxford Repository record for Inhomogeneous spatial branching processes (opens in a new tab)

  9. Markov Chains, Random Walks, and Card Shuffling

    A common question in the study of random processes pertains to card shuffling. Whether or not a deck of cards is random can have huge implications on any game being played with those particular cards. This thesis explores the question of randomness by using techniques established through analysis …

    ecu Repository record for Markov Chains, Random Walks, and Card Shuffling (opens in a new tab)

  10. Empirical analysis on random walk behavior of foreign exchange rates

    … conducts a comprehensive examination on the random walk behavior of 29 foreign exchange rates over the period of floating exchange regime, using variance-ratio tests. The cross-country and time-series test show that random walk model cannot be rejected on majority, and the random walk …

    gatech Repository record for Empirical analysis on random walk behavior of foreign exchange rates (opens in a new tab)

  11. Influence of Underlying Random Walk Types in Population Models on Resulting Social Network Types and Epidemiological Dynamics

    … constructed by incorporating different types of Random Walks and human rules of engagements. We explore the characteristics of the created network and compare them with the known theoretical and empirical graphs. The dependencies of epidemic dynamics and their outcomes on patterns and parameters …

    unt Repository record for Influence of Underlying Random Walk Types in Population Models on Resulting Social Network Types and Epidemiological Dynamics (opens in a new tab)

  12. Random Walks on Finite Fields and Heisenberg Groups

    … measure on H. This data determines an invariant random walk on H beginning from the identity element. The probability distribution for the state of the random walk after n steps is given by the n'th convolution power of the probability measure [mu]. The random walk and measure [mu] are said to be …

    ecu Repository record for Random Walks on Finite Fields and Heisenberg Groups (opens in a new tab)

  13. Complex question answering : minimizing the gaps and beyond

    … and semantic information in a graph-based random walk method for answering complex questions. Decomposing a complex question into a series of simple questions and then reusing the techniques developed for answering simple questions is an effective means of answering complex questions. We …

    lethbridge Repository record for Complex question answering : minimizing the gaps and beyond (opens in a new tab)

  14. On the weak convergence of stochastic integrals on Skorokhod space: From general theory to applications within the realm of continuous-time random walks

    … stochastic integrals driven by continuous-time random walks (CTRWs) and moving averages, both for the J1 and M1 topology. Building on this, we present weak approximation results for stochastic differential equations driven by time-changed Lévy processes, which are crucial for modeling anomalous …

    oxford Repository record for On the weak convergence of stochastic integrals on Skorokhod space: From general theory to applications within the realm of continuous-time random walks (opens in a new tab)

Page 1 of 2