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 9 of 9 for “"Random geometric graph"”.
-
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. …
-
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 …
-
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]; …
-
Throughput and complexity tradeoffs in the multi-antenna downlink
… of the multi-user multi-antenna channel as a random packing of the unit sphere. As such, we provide refined estimates on the content of spherical caps so that they can be applied as a model for interference. We then employ recent developments in the area of random geometric graph theory to …
-
Intrinsically secure communication in large-scale wireless networks
… coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of digital communications systems. Motivated by recent developments in the field, this thesis aims at a characterization of the fundamental secrecy limits of large-scale …
-
Modeling, analysis, and control of interdependent networks
… networks of arbitrary topologies by layered graphs, where nodes in the demand layer depend on nodes in the supply layer. We study the supply node connectivity of the demand layer network: namely, the minimum number of supply node removals that would disconnect the demand network. We develop …
-
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 …
-
Computational and Statistical Detection of High-Dimensional Latent Space Structure in Random Networks
A probabilistic latent space graph PLSG (n, Ω, D, σ) is parametrized by its number of vertices n, a probability distribution D over some latent space Omega, and a connection function [mathematical function] such that [mathematical formula] almost surely with respect to D. To sample from …
-
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 …