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 37485 for “"random"”.
-
Random walks in random media
… we study three RWIRE models. A RWIRE is simply a random walk where the transition rates are themselves random variables. The first model studied is a unit jump non directed RWIRE in discrete and continuous time. Results are presented for the "speed" of the RWIRE in discrete time. It is also shown …
-
Problems in random walks in random environments
… of the heat kernel for certain reversible random walks in random environments. In particular the work of Barlow(2004) showed that the heat kernel for the random walk on the infinite component of supercritical bond percolation behaves in a Gaussian fashion. This heat kernel control was then …
-
Random walks in a sparse random environment.
<p>We introduce random walks in a sparse random environment on the integer lattice Z and investigate such fundamental asymptotic property of this model as recurrence-transience criteria, the existence of the asymptotic speed and a phase transition for its value, limit theorems in both transient and …
-
Signal detection with random backgrounds and random signals
… (SKE) tasks, where signals are nonrandom, are employed. MCMC methods are extended to signal-known-statistically (SKS) tasks, where signals are random. Psychophysical studies for the SKE and SKS tasks using non-Gaussian and Gaussian distributed LBs are conducted. The performance of …
-
Anomalous diffusion and random walks on random fractals
… in porous media. Porous media are modelled by random Sierpinski carpets, each carpet is constructed by mixing two different generators with the same linear size. Diffusion on porous media is studied by performing random walks on random Sierpinski carpets and is characterized by the random walk …
-
Anomalous diffusion and random walks on random fractals
… in porous media. Porous media are modelled by random Sierpinski carpets, each carpet is constructed by mixing two different generators with the same linear size. Diffusion on porous media is studied by performing random walks on random Sierpinski carpets and is characterized by the random walk …
-
Modeling Diffusion As Random Walks in Random Environments
This dissertation explores the physics of the Random Walks in Random Environments (RWRE) model for diffusion which, until now, has only been of mathematical interest. I show how the statistics of extreme particles, those that move the furthest the fastest, in a large systems of diffusing particles, …
-
Random Sampling
The purpose of this study is to show the use of random sampling in solving certain mathematical problems. The origin of random numbers to be used in sampling is discussed and methods of sampling from known distributions are then given together with an indication that the sampling procedures are …
-
Random Acts
<p>Random Acts explores the various stages of a woman’s life, from adolescence through middle age, and the people who support her along the way, all of whom ultimately prepare her to face some of life’s most painful challenges with love, humor, and strength.</p>
-
Random recursion
… particle systems, the frog model and coalescing random walk. We work out transience and recurrence properties on various graphs. The last is an interval splitting algorithm, which is shown to be equidistributed in the limit. Many of the proofs hinge on recursive equations of random variables.
-
Thresholds for patterns in random compositions and random permutations
We explore how the asymptotic structure of a random permutation of [n] with minversions evolves, as m increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. Our investigation beginswith exploring how the asymptotic structure of a …
-
Random Sorting Networks, the Directed Landscape, and Random Polynomials
The first part of this thesis concerns random sorting networks. A sorting network is a shortest path from 12···n to n···21 in the Cayley graph of the symmetric group Sn generated by adjacent transpositions. We prove that in a uniform random n-element sorting network σn, all particle trajectories …
-
Random flow on random graphs: Amphibian Movements in the Playas
… for the drying out and filling of playas on a random basis depending on ecological variables. Based on the average number of time steps for propagation, a time estimate is then applied to the average number of time steps to determine an approximate time required for a trait or population to …
-
From the Elephant Random Walk to Step-Reinforced Random Walks
… University of Zurich, deals with step-reinforced random walks. A step-reinforced random walk is a random walk with complete memory of its past, where an underlying memory parameter p governs the likelihood of which steps in the past will be repeated (reinforced). Notably, this memory parameter …
-
Random observations on random observations: Sparse signal acquisition and processing
… via a small set of more general, often randomized, linear measurements. If properly chosen, the number of measurements can be much smaller than the number of Nyquist-rate samples. A common theme in this research is the use of randomness in signal acquisition, inspiring the design of …
Page 1 of 1875