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 15 of 15 for “"Random Geometric Graph"”.
-
Initial Solution Improvements to a Tethered Robotic Path Planner using Random Geometric Graph Configurations and Biased Sampling
… The second re-configures the underlying Random Geometric Graph to form edges using a $k$-nearest neighbor approach, allowing longer edges to be evaluated. Both of these methods are thoroughly tested on a series of five maps, three of which are generated using a pipeline involving Blender …
-
Topics in Stochastic Combinatorial Optimization and Extremal Graph Theory
We consider a random geometric graph, G(n, r ), constructed by placing points randomly in a square S n of area n according to a Poisson process of intensity 1, and adding an edge joining any pair of points at most distance r=r(n) apart according to the ℓinfinity -metric. We show that w.h.p. …
-
Data Transmission in Quantized Consensus
… average. Besides, it works on all types of graphs (star, complete, ring, random geometric graph). My other algorithm, distributing averaging algorithm (PQDA) with probabilistic quantization also works on random geometric graph, star, ring and slow co-herency graph. It shows significant …
-
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 …
-
Bootstrap Percolation on Random Geometric Graphs
… or disease across the vertex set of a graph. It was introduced in 1979 by Chalupa, Leith and Reich as a simple model of dynamics of ferromagnetism. We consider the following version of this process:Initially, each vertex of the graph is set active with probability p or inactive …
-
On non-stationary Wishart matrices and functional Gaussian approximations in Hilbert spaces
… matrices d−1YY^T , where Y is a n×d Gaussian random matrix with correlated and non-stationary entries. We provide quantitative bounds in the Wasserstein distance for the cases of central convergence and non-central convergence, verify such convergences hold in the weak topology of C([a; b]; …
-
Random graphs with additional structure evolving in time
This thesis comprises three projects concerning random graphs and random processes on graphs.<br><br>In Chapter 2 we prove that if the offspring distribution of a Bienaymé tree is critical and admits a finite third moment, then under a suitable tail condition on the displacements, any globally …
-
Isolation and Connectivity in Networks of Autonomous Entities
… network model called a one-dimensional hard Random Geometric Graph (RGG). Using a Poisson point process to represent the vehicles in the network, pairs of points are connected if their mutual distance is less than a speci ed radius. We analyse an extension of this model which incorporates the …
-
Connectivity and Mobility in Wireless Networks
… the location of devices/base stations by random sets, tools from stochastic geometry can be leveraged creating a framework which is far more tractable than previous lattice models. As such there has been significant progress into the fundamental capabilities of wireless networks, including …
-
Random rectangular networks : theory and applications
… For example, wireless sensor networks in a geographical region such as a city where the flow of information is essential, or plant populations in a crop field where it is important to understand and try to limit the spread of diseases. Another example is the rocks found deep underground in the …
-
Μελέτη αποδοτικών αλγορίθμων για τον έλεγχο τοπολογίας και τη διάχυση / συλλογή πληροφοριών σε μεγάλου εύρους ασύρματα δίκτυα αισθητήρων
… Based (DBB) and Directed Budget Based with Random Delays (DBB-RD) algorithms have their basis on two previously published algorithms for distributed clustering of nodes in wireless networks, called Rapid and Persistent. The algorithms begin the distributed clustering process by distributing …
-
Tighter Bidirectional Heuristic Search and Lazy Optimal Sampling-Based Motion Planning
… space or incrementally approximating it using randomized sampling techniques to find feasible collision-free paths. However, computing high-quality solutions in high-dimensional continuous spaces remains challenging because of the computational cost of collision checks and the ``curse of …
-
Dynamics on and of Complex Networks
… their neighbors, or to rewire their ties to some randomly chosen voter of (i) the same, or (ii) any, opinion. </p><p>We examine how the probability of rewiring, and the initial fraction $\rho_{\textrm{i}}$ in the minority, </p><p>determine the final minority fraction $\rho_{\textrm{f}}$, when the …
-
Convergence Rates of Spectral Distribution of Random Inner Product Kernel Matrices
… has two parts. In the first part, we focus on random inner product kernel matrices. Under various assumptions, many authors have proved that the limiting empirical spectral distribution (ESD) of such matrices A converges to the Marchenko- Pastur distribution. Here, we establish the …