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 369 for “"walks"”.
-
Quantum random walks
… 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 results …
-
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
… 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 randomness …
-
Sampling Using Controlled Quantum Walks
… optimal classical algorithm, which uses random walks with stopping rules. Efficient sampling is an important computational task used in simulations based on stochastic processes. This is the first quantum algorithm that achieves a quadratic speed-up for sampling from general probability …
-
Absorption phenomena in quantum walks
… general collection of one dimensional quantum walks and extend the method to consider d-dimensional walks in the presence of d-1 dimensional absorbing walls. However, these results are concerned only with local behavior at the boundary in the form of absorption probabilities. The main results …
-
Geographical Applications for Sound Walks
… type of exploration is through the use of sound walks: walks along a specified route accompanied by a soundtrack (on headphones or stationary speakers) that conveys information, enacts a story, produces an ambience or atmosphere, or illuminates certain aspects of the environment through which the …
-
Information dissemination via random walks
… a number of agents perform independent random walks in the network. An agent becomes informed when it visits a node that has a message, and later informs all future nodes it visits. Visit-Exchange shares many of the properties of randomised rumour spreading, namely, it is very simple and uses …
-
Random walks in the stringent response
Poomisvastus on võtmetähtsusega adaptiivsete mehhanismide regulatsioonil, mis aitavad bakteritel ebasoodsaid keskkonnatingimusi üle elada. Soolekepikeses (Escherichia coli) on selles protsessis oluliseks ensüümiks RelA, mis vastusena aminohappenäljale sünteesib signaalmolekuli (p)ppGpp. See …
-
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
… Algorithms are described to generate random walks which are used in a particular space (both without and with confinement). The torsion angle is expressed as a function of six variables for a random walk in both cases: without confinement and with confinement, respectively. Then we find the …
-
Simple Stationary Steps in Quantum Walks
… An−1 is given as a sum over a set of quantum walks in the quantum Bruhat graph, QBG(An−1). We establish bounds on the number of quantum steps and simple stationary steps in these quantum walks. By a result of Kato, we map this formula to the equivariant quantum K-theory of partial flag …
-
Convex hulls of planar random walks
… 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 increments. Assuming increments of the random walk have finite second moment and non-zero mean, Snyder and Steele showed that n−1Ln …
-
Movements of molecular motors : diffusion and directed walks
… Arbeit untersucht, indem sie als Random Walks auf einem Gitter modelliert werden. Ein weiterer Gegenstand der Untersuchung sind Effekte von Wechselwirkungen zwischen den Motoren auf diese Bewegungen. Im einzelnen werden vier Transportphänomene untersucht: (i) Random Walks von einzelnen …
-
Evolving Network Representation Learning Based on Random Walks
… 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, in …
-
The Cover Time of Random Walks on Graph
… independent interest. Finally, we explore random walks with weighted random edge choices. We present a weighting scheme that has a smaller worst case cover time than a simple random walk. We give an upper bound for a random graph of given degree sequence weighted according to our scheme. We …
-
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
… 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 going …
Page 1 of 19