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 21 for “"expander graphs"”.
-
Expander Graphs and Coding Theory
Expander graphs are highly connected sparse graphs which lie at the interface of many different fields of study. For example, they play important roles in prime sieves, cryptography, compressive sensing, metric embedding, and coding theory to name a few. This thesis focuses on the connections between …
-
Expander graphs, randomness extractors and error correcting codes
… γενικότερα. Οι έννοιες αυτές είναι οι Expander Γράφοι, Εξαγωγή Τυχαιότητας και Κώδικες Διόρθωσης Λαθών με Λίστα. Οι expander γράφοι έχουν την ιδιότητα ότι αποτελούνται απο λίγες ακμές όμως οι κορυφές τους είναι πολύ καλά συνδεδεμένοι. Ένας αλγόριθμος εξάγει τυχαιότητα όταν παίρνει σαν …
-
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 …
-
Laplacians Of Cellular Sheaves: Theory And Applications
… as well as a generalization of the notion of expander graphs. Sheaf Laplacians allow development of various dynamical systems associated with sheaves, and their behavior is studied. Finally, applications to opinion dynamics, extracting network structure from data, linear control systems, and …
-
Geometric Property (T) for Box Spaces of Graphs and Sofic Approximations
… class of coarse spaces, that is box spaces of graphs, which are unions of finite undirected graphs of bounded degree. These graphs may or may not occur in the context of approximating a group, most notably as a sofic approximation. Of particular interest to us is the connection that geometric …
-
On the Spectrum and Density of States of Graphs and Groups
… periodic operators of finite order on G-periodic graphs). Several examples of computations of spectra and spectral measures of Cayley graphs are surveyed. Some well known theorems and applications of the theory to other areas of mathematics (Kesten’s theorem, Kadison-Kaplansky conjecture, Property …
-
Leveraging coding techniques and redundancy for speeding up distributed computing and robustifying distributed learning
… that leverages Latin squares and bipartite expander graphs to redundantly assign gradient computations to the servers. We consider optimal adversarial attacks where an adversary possesses complete knowledge of the system and show that if it mounts judicious attacks, previous techniques …
-
Higher Order Random Walks, Local Spectral Expansion, and Applications
The study of spectral expansion of graphs and expander graphs has been an extremely fruitful line of research in Mathematics and Computer Science, with applications ranging from random walks and fast sampling to optimization. In this dissertation, we study high dimensional local spectral expansion, …
-
Aspects of Mass Transportation in Discrete Concentration Inequalities
… setting. Such inequalities on n-fold products of graphs, equipped with product measures, have been well investigated using combinatorial and probabilistic techniques, the most notable being martingale techniques. The emphasis here, is instead on the analytic viewpoint, with the precise …
-
Algorithmic Tools for Network Analysis
… of the sandpile instance on various classes of graphs, solving the \textit{sandpile prediction} problem on: (1) general graphs, with further analyses on regular graphs, expander graphs, and hypercubes. (2) trees and paths, surpassing previous methods in time complexity. To analyze the structure …
-
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 …
-
Cops and Robber Game with a Fast Robber
… problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to several …
-
Expanding Horizons: A Comprehensive Exploration of Robustness, Performance and Programmable Data Plane Routing in Next Generation Data Centers
… researchers explored topologies based on Expander Graphs (EGs), such as Jellyfish, Xpander, and STRAT, where they exploited the sparse and incremental nature of these new topologies. This thesis focuses on investigating the STructured Re-Arranged Topology (STRAT) as a potentially robust …
-
Connectivity and related properties for graph classes
<p>There has been much recent interest in random graphs sampled uniformly from the set of (labelled) graphs on n vertices in a suitably structured class A. An important and well-studied example of such a suitable structure is bridge-addability, introduced in 2005 by McDiarmid et al. in the course …
-
Scalable and Reliable Searching in Unstructured Peer-to-peer Systems
The subject of this thesis is searching in unstructured peer-to-peer systems. Such systems have been used for a variety of different applications, including file-sharing, content distribution and video streaming. These applications have been very popular; they contribute to a large percentage of …
-
Randomness extractors for independent sources and applications
… examples of a single such object is non-trivial. Expander graphs, error correcting codes, hard functions, epsilon biased sets and Ramsey graphs are just a few examples of other such objects. Finding explicit examples of extractors is part of the bigger project in the area of derandomization of …
-
A Fully-Distributed Protocol for Constructing Byzantine-Resilient Peer-To-Peer Networks
… construct and maintain a sparse (bounded-degree) expander topology despite high churn and a large number of Byzantine nodes. We formalize a dynamic network model with two powerful adversaries. A stochastic churn adversary models continuous node arrivals and departures while maintaining a stable …
-
A statistical physics approach to probabilistic combinatorics
… 2, we consider the hard-core model on bipartite expander graphs. We give a refinement of Galvin’s graph container lemma, which allows us to prove that the cluster expansion of the hard-core model converges for a broader regime of activity parameters than previously known. As a corollary, we prove …
Page 1 of 2