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 “"expander graphs"”.
-
Expander graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
Bounds on k-Regular Ramanujan Graphs and Separator Theorems
Expander graphs are a family of graphs that are highly connected. Finding explicit examples of expander graphs which are also sparse is a difficult problem. The best type of expander graph in a. certain sense is a Ramanujan graph. Families of graphs that have separator theorems fail to be Ramanujan …
-
Compressive Sensing
… sampling will center on random matrices and expander graphs, while reconstruction will use multiple numerical optimization techniques. Although theoretical performance bounds for these techniques can be found scattered throughout the published literature, there are few practical rules for …
-
Sparse graph codes for compression, sensing, and secrecy
… concept we use extensively is the notion of an expander graph. Expander graphs have powerful properties that allow us to prove adversarial, rather than probabilistic, guarantees for message-passing algorithms. Expander graphs are also useful in the context of the wiretap channel because they …
-
Phase transition for cutoff for random walks on random graphs
… original edges of G. For various sequences of graphs Gn and corresponding weights εn, we establish if the (weighted) random walk on G*n has cutoff. In particular, we show a phase transition for two families of graphs, graphs with polynomial growth of balls, and graphs where the entropy of the …
-
Cubulating CAT(0) groups and Property (T) in random groups
… areas such as group theory, ergodic theory, and expander graphs. The aim is to cubulate some examples of groups known in the literature, and prove that many ‘generic’ groups have Property (T). Graphs will be central objects of study throughout this text, and so in Chapter 2 we provide some …
-
Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts
… the behaviour of the SDP on general families of graphs. As a quick corollary we establish that the SDP is exact for planar graphs. The second question is concerned with spectrum of label extended graphs of Unique Games instances. Such graphs have been extensively studied under the name of Graph …
-
Extremal, Probabilistic, and Infinitary Problems in Combinatorics
… extend these results to sufficiently dense host graphs in place of Kn. Our proofs combine saturation arguments for the existence of particular coloured substructures and analysis of conveniently defined local exchanges. Using similar methods, we investigate the existence of copies of a graph H …
-
Security in network games
Attacks on the Internet are characterized by several alarming trends: 1) increases in frequency; 2) increases in speed; and 3) increases in severity. Modern computer worms simply propagate too quickly for human detection. Since attacks are now occurring at a speed which prevents direct human …