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 66 for “"Random Graphs"”.
-
Structures & algorithms in hyperbolic random graphs
… of such networks, they are often modeled as random graphs. Many of the popular models like inhomogeneous random graphs or Preferential Attachment excel at producing a power law degree distribution. Clustering, on the other hand, is in these models either not present or artificially enforced. …
-
Graph coloring algorithms on random graphs
… algorithms have been programmed and applied to random graphs. This dissertation will present several variations of the Korman algorithm, Korw2, Pactual, and Pactmaxw2, which produce exact colorings quicker than the Korman algorithm in the average for some classes of graphs. In addition to exact …
-
Generating Random Graphs with Tunable Clustering Coefficient
… at a node) as input and generate a random graph with a tunable clustering coefficient. We analyze them theoretically and empirically for the case of a regular graph. CONF-1 and CONF-2 generate a random graph with the degree sequence and the clustering coefficient anticipated from the …
-
Data Procurement for Shortest Paths on Random Graphs
… we approach the shortest paths problem for graphs with random edge weights described by known probability distributions. We introduce the idea of a budget of size k which allows us to replace k random edges with numbers drawn from the edges' distributions. Our problem is to determine which …
-
Exponential Random Graphs and a Generalization of Parking Functions
<p>Random graphs are a powerful tool in the analysis of modern networks. Exponential random graph models provide a framework that allows one to encode desirable subgraph features directly into the probability measure. Using the theory of graph limits pioneered by Borgs et. al. as a foundation, we …
-
Extremal problems in pseudo-random graphs and asymptotic enumeration
… in extremal graph theory and the theory of random graphs. It consists of three more or less independent parts that all fit into one bigger picture -- the meta-problem of describing the structure and properties of large random and pseudo-random graphs. Given a positive constant c, we call an …
-
Studies of random walks on groups and random graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1992.
-
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, …
-
Expressivity and Structure in Networks: Ising Models, Random Graphs, and Neural Networks.
… models such as a) Ising Model b) Exponential Random Graph Model (ERGM) c) Random Geometric Graphs (RGG) d) Neural Networks, where for each a version of this question is posed and solved. For the case of Ising Model, ERGM, and RGG, we establish statistical tests which can distinguish them from …
-
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 …
-
The Effects of Geography and Proximity on Board of Directors: An Exponential Random Graphs Approach
<p>This dissertation aims at exploring how physical proximity, among other geographical elements, affects the synthesis of boards of directors, the decisions executives make, and, in general, organizations. Drawing on the rich literature in economic geography, these studies focus on re-evaluating …
-
Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms
Networks (or graphs) are an effective abstraction for representing many real-world complex systems. Analyzing various structural properties of and dynamics on such networks reveal valuable insights about the behavior of such systems. In today's data-rich world, we are deluged by the massive amount …
-
Average-case complexity of detecting cliques
… number of gates, and the input distributions are random graphs with an appropriate density of edges. Such random graphs (the well-studied Erdos-Renyi random graphs) are widely believed to be a source of computationally hard instances for clique problems (as Karp suggested in 1976). Our results are …
-
Enhancing network robustness via shielding
… region is small. To mitigate the effect of random link failures on network connectivity, we consider increasing the effective min-cut of the network by shielding, where shielded links cannot be contained in effective cuts. For a single SD pair, we develop an efficient algorithm to increase …
-
Algorithms for string and graph layout
… bound on the value of an optimal solution for random graphs. This is the first relaxation that improves on the trivial "all edges" bound for random graphs.
-
ℓ-CTP: Utilizing Multiple Agents to Find Efficient Routes in Disrupted Networks
… destination. Second, we carry out simulations on random graphs to determine the impact of the addition of agents on the path cost found. Through statistical analysis of graphs of multiple sizes, we validate our technique against prior work and demonstrate that path cost can be modeled as an …
-
Fractional Chromatic Numbers and Spectra of Graphs
… recent study of fractional chromatic numbers of graphs, spectra of edge-independent random graphs, Laplacian spectra of hypergraphs, and loose Laplacian spectra of random hypergraphs.</p> <p>For a graph $G$, let $\chi_f(G)$ be the fractional chromatic number of $G$. Based on the study of …
-
Analysis of approximation and uncertainty in optimization
… of greedy algorithms for online matching on random graphs. In online matching problems, vertices arrive sequentially and reveal their neighboring edges. Vertices may be matched upon arrival and matches are irrevocable. We determine asymptotic matching sizes obtained by a variety of greedy …
-
ΤΕΧΝΙΚΕΣ ΣΧΕΔΙΑΣΜΟΥ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΕ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… OF A PLANAR DIGRAPH INTO SPECIAL OUTERPLANAR SUBGRAPHS CALLED HAMMOCKS. 2. WE PRESENT A PROBABILISTIC TECHNIQUE FOR FINDING PARALLEL APPROXIMATION SOLUTIONS FOR NP-HARD PROBLEMS.3. NEW "ADAPTIVE" PROBABILISTIC TECHNIQUES ARE PRESENTED FOR THE AVERAGE-CASE ANALYSIS OF PARALLEL ALGORITHMS. WE USE …
Page 1 of 4