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 9694 for “"random"”.
-
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 …
-
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> search
… racial profiling and discrimination in both the "random" selection and the actual pat-down procedure, but are often reluctant to resist or file official complaints. Expensive, intrusive technologies at security officials' disposal reinforce an inherent power imbalance between authorities and …
-
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 …
-
Studies of random walks on groups and random graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.
-
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 …
-
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 …
-
Phase transition for cutoff for random walks on random graphs
… analyse the cutoff phenomenon on two different random graph models. First, we consider a variant of the configuration model with an embedded community structure and study the mixing properties of a simple random walk on it. Every vertex has a given number of internal, degint ≥ 3, and outgoing, …
-
Random Number Generators
This paper is about pseudo-random number generators. In particular it is about pseudo-random number generators for the 16 bit computers. These machines include the IBM PC, XT, and AT. Thus this class comprises a large share of the PC market. The aim of the paper is to find a fast implementation of …
-
Streaming Random Forests
… ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving …
-
Random combinatorial processes
… in combinatorial probability, namely: activated random walk, an interacting particle process; a phase transition for Wishart matrices, a model of a random geometric graph; the Boolean intersection model, an intersection of random sets in $\mathbb{R}^d$; and rumor spreading algorithms on the …
-
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 Interval Graphs
… is supervised by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform distribution on $[0,1]$. We then say that the $i$th of the $n$ vertices is the interval …
-
Directed random testing
Random testing can quickly generate many tests, is easy to implement, scales to large software applications, and reveals software errors. But it tends to generate many tests that are illegal or that exercise the same parts of the code as other tests, thus limiting its effectiveness. Directed random …
-
Physical random functions
… Teller Machines. To address this issue, Physical Random Functions are introduced. These are Random Functions that are physically tied to a particular device. To show that Physical Random Functions solve the initial problem, it must be shown that they can be made, and that it is possible to use …
-
Homogenization of Random Media: Random Walks, Diffusions and Stochastic Interface Models
… scaling limits and heat kernel estimates, for random processes moving in random environments and for stochastic interface models. The first chapter will survey recent research and introduce three models of interest: the random conductance model, the Ginzburg-Landau ∇φ model, and the symmetric …
-
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. …
-
Dimensions in Random Constructions.
We consider random fractals generated by random recursive constructions, prove zero-one laws concerning their dimensions and find their packing and Minkowski dimensions. Also we investigate the packing measure in corresponding dimension. For a class of random distribution functions we prove that …
-
Polarimetry Of Random Fields
On temporal, spatial and spectral scales which are small enough, all fields are fully polarized. In the optical regime, however, instantaneous fields can rarely be examined, and, instead, only average quantities are accessible. The study of polarimetry is concerned with both the description of …
Page 1 of 485