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 1101 for “"random walk"”.
-
Two Random Walk Problems
Among numerous probabilistic objects, random walk is one of the most fundamental but most favourable. This dissertation concerns two problems related to random walk theory. The first problem regards $d$ independent Bernoulli random walks. We investigate the first “rencontre-time” (i.e. the first …
-
Estimating Random walk Centrality
… networks. For strongly connected networks, the random walk centrality measures how easy it is to reach a given state from another randomly chosen state. This measure requires calculating a generalized group inverse for the transition matrix, which can be computationally difficult for large state …
-
QUANTUM RANDOM WALK ON FRACTALS
Quantum walks are the quantum mechanical analogue of classical random walks. Discrete-time quantum walks have been introduced and studied mostly on the line Z or higher dimensional space Z d but rarely defined on graphs with fractal dimensions because the coin operator depends on the position and …
-
A Random Walk in Representations
… the Markov chain on $S_n$ formed by applying a random $n$-cycle to a deck of $n$ cards and following with repeated random transpositions. This process can be viewed as a Markov chain on the partitions of $n$ that starts at $(n)$, making it a natural counterpart to the random transposition walk, …
-
Universality of Activated Random Walk
Activated random walk is an interacting particle system proposed as a tractable model of self-organized criticality. Particles are active or sleeping: active particles move by random walk and may fall asleep when isolated, while sleeping particles are reactivated by incoming active particles. A …
-
Random walk model applicable to rivers
… who wish to design such disposal systems. A random walk model has been developed which is geared towards use in rivers. The model only performs mid-field calculations, however the potential exists to accept the results from a near-field model as input. The model attempts to account for the …
-
Trading cookies with a random walk
… a jargon borrowed from the theory of excited random walks) a “cookie” which is used to increase the probability of moving forward in the next step. The generalized gambler’s ruin scenario considers an excited random walk on a finite interval of integer line with two “cookie store” locations …
-
Continuous time random walk limit processes
Continuous Time Random Walks (CTRWs) provide stochastic models for the random movement of any entity, e.g. a particle, a derivative price, etc. They are given by a sequence of random waiting times, each of which is followed by a random jump. The distribution of a jump possibly depends on the …
-
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 …
-
Heaps, graphical models, and random walk representations
… could be expressed in terms of the behaviour of random walks. This thesis contributes to the understanding of these connections by developing and analyzing random walk representations of graphical models arising in statistical mechanics. Concretely, the results of this thesis can be divided into …
-
Asymptotic properties of the branching random walk
<p>The branching random walk is a Galton-Watson process with the additional feature that people have positions. The initial ancestor is at the origin. Let {3<sup>(1)</sup><sub style="position: relative; left: -.8em;">r</sub>} be the positions on the real line of his children. The people in the nth …
-
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 …
-
A Random Walk Version of Robbins' Problem
… observations among all observations. We examine random walk analogs to Robbins' problem in both discrete and continuous time. In discrete time, we consider full information and relative ranks versions of this problem. For three step walks, we give the optimal stopping rule and the expected rank …
-
Random Walk Approaches to Clustering Directed Networks
… find clusters in undirected networks is based on random processes whose state space is the network's set of vertices, moving in each time step to a randomly chosen neighboring vertex. A close correspondence between network substructures and properties of such a random walk process has been …
-
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 …
-
Higher-order Random Walk Methods for Data Analysis
Markov random walk models are powerful analytical tools for multiple areas in machine learning, numerical optimizations and data mining tasks. The key assumption of a frst-order Markov chain is memorylessness, which restricts the dependence of the transition distribution to the current state only. …
Page 1 of 56