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 22 for “"Random Graph Theory"”.
-
An introduction to the theory of random graphs
… provides an introduction to the fundamentals of random graph theory. The study starts introduces the two fundamental building blocks of random graph theory, namely discrete probability and graph theory. The study starts by introducing relevant concepts probability commonly used in random graph …
-
Resource Management for Real -Time Environments
We make connections with random graph theory and statistical physics and show specific instances where we can solve problems that were hitherto hard to solve or improve the results for some well-studied problems. The instances that we study are: phased-array radar dwell scheduling, multiprocessor …
-
On Heritability of Structural Connectomes
… to study the human brain, connectomes, or brain graphs, can be derived from neuroimaging data, such as diffusion (dMRI) and functional magnetic resonance imaging (fMRI). GraSPy, an open-source Python package, was developed in order to leverage recent advances in statistics and random graph theory …
-
When are random regular triangle-free graphs bipartite?
… T_{n,m}$ denote the set of triangle-free graphs on $n$ vertices with $m$ edges where $m = m(n)$. A natural and well-studied question in random graph theory is ``for large $n$, how large is $\mathcal T_{n,m}$?" This question has been answered when $m \le n^{3/2-\eps}$ for some $\eps>0$, or …
-
Jumping Connections: A Graph-Theoretic Model for Recommender Systems
… to products and services. This thesis presents a graph-theoretic model that casts recommendation as a process of 'jumping connections' in a graph. In addition to emphasizing the social network aspect, this viewpoint provides a novel evaluation criterion for recommender systems. Algorithms for …
-
Two Questions about Properties of Large Graphs: On Generalized Turán Numbers and the Chromatic Number of Random Lifts
… questions and results from two fields: extremal graph theory and random graph theory. First, I consider a generalization of the classic theorem of Turán that states that the maximum number of edges in a clique-free graph is uniquely obtained by a balanced complete r-partite graph. Following Alon …
-
Problems in Extremal and Probabilistic Combinatorics
… areas of modern combinatorics: Extremal Hypergraph Theory and Random Graph Theory. The results are presented in three parts. First, we resolve a longstanding open problem in the theory of random graphs known as the Kim-Vu Sandwich Conjecture (2004). This conjecture posits that a random …
-
Random geometric graphs and their applications in neuronal modelling
Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. We presentfour models which have in …
-
Randomly perturbed multipartite graphs
… we solve two tiling problems in the area of randomly perturbed graph theory. Tiling problems form a central part of both extremal and random graph theory. Many results in extremal graph theory concern minimum degree conditions that guarantee the existence of some spanning subgraph. The …
-
Problems in Combinatorial and Analytic Number Theory
We focus on three problems in number theory. The first problem studies the random Fibonacci tree, which is an infinite binary tree with non-negative integers at each node. The root consists of the number 1 with a single child, also the number 1. We define the tree recursively in the following way: …
-
RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS
… physics of disordered systems, such as random graph theory, the mean-field approximation, spin glasses and combinatorial optimization. The replica method will also be introduced and applied to the Sherrington-Kirkpatrick model, one of the simplest mean-field models of spin-glasses. The …
-
Stein's method for functional approximations
… are applied to examples coming from queuing theory, random-graph theory, statistics and combinatorics.</p> <p>We firstly look at the motivation for this thesis and an overview of Stein's method. Then we present our original work, contained in four articles. The first one is a collaboration …
-
GRAPH-BASED ANALYSIS FOR E-COMMERCE RECOMMENDATION
… on various types of data including customer demographics, product features, and, most importantly, previous interactions between customers and products (e.g., purchasing, rating, and catalog browsing). Despite significant research progress and growing acceptance in real-world applications, two …
-
Simplicial Data Analysis: theory, practice, and algorithms
… Coming from well established techniques in random graph theory, the first models for random simplicial complexes have been introduced in recent years, none of which though can be used effectively in a quantitative analysis of data. We introduce a model that can be successfully used as a null …
-
Uniform Generation of Graphical Realizations of Joint Degree Matrices
… an algorithm designed to uniformly generate graphical realizations of a given joint degree matrix. Amanatidis and Kleer previously employed an MCMC-based method to address this problem. Their method fully resolved the case of two degree classes, and showed that their switch Markov chain is …
-
Properties of random graphs
… describes new results for several problems in random graph theory. The first problem relates to the uniform random graph model in the supercritical phase; i.e. a graph, uniformly distributed, on $n$ vertices and $M=n/2+s$ edges for $s=s(n)$ satisfying $n^{2/3}=o(s)$ and $s=o(n)$. The property …
-
Models for Systemic Risk
Systemic risk is the risk that an economic shock may result in the breakdown of the fundamental functions of the financial system. It can involve multiple vectors of infection such as chains of losses or consecutive failures of financial institutions that may ultimately cause the failure of the …
-
Randomly-connected Non-Local Conditional Random Fields
… these relations such as Markov chain models or random field frameworks. Random fields specify the relations among random variables in the context of probability distributions. Markov random fields are generative models used to represent the prior distribution among random variables. On the other …
-
Throughput Limits of Wireless Networks With Fading Channels
… point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a threshold-based link activation strategy (TBLAS) is proposed and analyzed. The achieved throughput of TBLAS is by a factor of four larger than what was …
-
Colourings of random graphs
<p>We study graph parameters arising from different types of colourings of random graphs, defined broadly as an assignment of colours to either the vertices or the edges of a graph.</p> <p>The <em>chromatic number</em> X(G) of a graph is the minimum number of colours required for a vertex colouring …
Page 1 of 2