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 106 for “"Random Walks"”.
-
Quantum random walks
… investigate the convergence of various quantum random walks to quantum stochastic cocycles defined on a Bosonic Fock space. We prove a quantum analogue of the Donsker invariance principle by invoking the so-called semigroup representation of quantum stochastic cocycles. In contrast to similar …
-
Random Walks with Pheromone
In this thesis we are interested in random walks on graphs where transition probabilities from each vertex depend on values of a function, f, at neighboring nodes. The work is motivated by applications that arise in bio-inspired models wherein questions of dynamics are effected by pheromone trails. …
-
Mixing of random walks on random graphs and intersections of branching random walks
… this thesis, we analyse the mixing properties of random walks on various random graph models, and we discuss a question about the intersection probabilities of branching random walks. We consider three different random graph models that each have some underlying structure and some additional …
-
Information dissemination via random walks
… unreliable conditions. In the past decades, randomised rumour spreading algorithms have addressed these challenges. In these algorithms, a message is initially placed at a source node of a network, and, at regular intervals, each node contacts a randomly selected neighbour. A message may be …
-
Random walks conditioned to stay positive
We consider a one-dimensional random walk S<sub>n</sub> with i.i.d. increments, zero mean and finite variance. Consider t<sub>x</sub> := inf{n ≥ 1 : x + S<sub>n</sub> ≤ 0} — the first passage times. For x ≥ 0 we study the asymptotic expansion for the tail distribution P(t<sub>x</sub> > n) under the …
-
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 …
-
Convex hulls of planar random walks
… the convex hull of the first n steps of a planar random walk, this thesis study n -> ∞ mean and variance asymptotics and establish distributional limits. The results apply to random walks both with drift (the mean of random walk increments) and with no drift under mild moments assumptions on the …
-
Evolving Network Representation Learning Based on Random Walks
… A family of these methods is based on performing random walks on a network to learn its structural features before feeding the sequence of random walks in a deep learning architecture to learn a network embedding. While these methods perform well, they can only operate on static networks. However, …
-
The Cover Time of Random Walks on Graph
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex. Central to this thesis is the cover time of the walk, that is, …
-
Protein-DNA interaction, random walks and polymer statistics
In Part I of the thesis, a general physical framework describing the kinetics of protein- DNA interaction is developed. Recognition and binding of specific sites on DNA by proteins is central for many cellular functions such as transcription, replication, and recombination. In the process of …
-
Generating Random Walks and Polygons with Thickness in Confinement
<p>Algorithms to generate walks (chains of unit-length, freely-jointed segments) and polygons (closed walks) in spherical confinements have been developed in the last few years. These algorithms generate polygons inside spherical confinement based on their mathematically derived probability …
-
Boundary Problems for One and Two Dimensional Random Walks
… boundary problems for one and two dimensional random walks. We first consider a one-dimensional random walk that starts at integer-valued height k > 0, with a lower boundary being the x-axis, and on each step moving downward with probability q being greater than or equal to the probability of …
-
Studies of random walks on groups and random graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.
-
Some aspects of time-dependent one-dimensional random walks
… topics connected with the one-dimensional random walk which proceeds by steps of ±1 occurring at random time intervals. In general it is assumed that these intervals are identically and independently distributed. This model may be specialized to the queuing process by inserting a reflecting …
-
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 …
-
Universality of Cutoff for Random Walks on Random Cayley Graphs
Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random. This draws a Cayley graph uniformly amongst all degree-k Cayley graphs of G. A conjecture of Aldous and Diaconis (1985) from the '80s asserts, for k ≫ log |G|, the following: • the random …
-
The Impact of Randomisation in Load Balancing and Random Walks
… too restricted. Hence it motivates us to add in randomness to make models similar to practical situations. In this thesis, we mainly study two network problems taken from the distributed computing world: iterative load balancing and random walks. An interesting observation is that the problems we …
Page 1 of 6