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 346 for “"random graph"”.
-
Tailored random graph ensembles
Tailored graph ensembles are a developing bridge between statistical mechanics and biological<br/>networks. In this thesis, this concept is used to generate a suite of rigorous mathematical tools<br/>to quantify and compare the topology of cellular signalling networks.<br/><br/>Earlier published …
-
Random Graph Modeling and Discovery
… thesis, we present a general class of models for random graphs that is applicable to a broad range of problems, including those in which graphs have complicated edge structures. These models need not be conditioned on a fixed number of vertices, as is often the case in the literature, and can be …
-
Random graph processes with dependencies
<p>Random graph processes are basic mathematical models for large-scale networks evolving over time. Their systematic study was pioneered by Erdös and Rényi around 1960, and one key feature of many 'classical' models is that the edges appear independently. While this makes them amenable to a …
-
Random graph models and their applications
This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them preferentially to the previous vertices with a large number of connections. We introduce on top of this model the …
-
Penalized Bayesian exponential random graph models.
… spread of diseases and information. Exponential random graph models (ERGM) are one of the popular statistical methods for analyzing network data. ERGM, however, struggle with computational challenges and degeneracy issues, further exacerbated by their inability to handle high-dimensional network …
-
The Random Graph and Reciprocity Laws
The theory of random graphs, that is graphs generated by some prescribed random process, gained popularity in the late 1950s and the level of interest has only increased since then. Random graphs on a countably infinite set of vertices is the subject of this thesis. We show that almost all graphs …
-
Self-organised criticality in random graph processes
<p>In the first half of this thesis, we study the random forest obtained by conditioning the Erdős--Rényi random graph <em>G(N,p)</em> to include no cycles. We focus on the <em>critical window</em>, in which, as studied by Aldous for G(N,p): </p> <br/> <p><table align="center"> <tr> <td …
-
Random Graph Generation in Hyperedge Replacement Languages
We present a novel approach for the random generation of graphs in context-free hypergraph languages. It is obtained by adapting both of Mairson's generation algorithms for context-free string grammars to the setting of hyperedge replacement grammars. It provides a concrete instrument for the …
-
Inferring network structures using hierarchical exponential random graph models
… structural patterns across networks. Exponential random graph models (ERGMs) provide a highly flexible way to study the complex dependency structures within networks. We aim to develop novel methodologies that utilise ERGMs to infer the underlying structures of ensembles of networks from the …
-
Multi-directional Rapidly Exploring Random Graph (mRRG) for Motion Planning
… in complex environments. These planners build a graph (roadmap) by generating robot configurations (vertices), and connecting nearby pairs of configurations according to their transition feasibility. Tree-based sampling-based planners (e.g., Rapidly-Exploring Random Tree, or RRT) start growing a …
-
k-Connectedness and k-Factors in the Semi-Random Graph Process
The semi-random graph process is a single-player graph game where the player is initially presented an edgeless graph with n vertices. In each round, the player is offered a vertex u uniformly at random and subsequently chooses a second vertex v deterministically ac- cording to some strategy, and …
-
RANDOM GRAPH MODELING OF KEY DISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKS
… surreptitious use by an adversary. Thus, cryptographic protection will be needed to ensure secure communications, as well as to support sensor-capture detection, key revocation and sensor disabling. Recently, random key predistribution schemes have been introduced to address these issues, and …
-
Handling Missing data in Eponential Random Graph Models: A Comparison of Approaches
… for single-mode networks, also known as graphs, that are missing tie information due to a variety of potential causes unrelated to network properties, such as illness or technology failure. Additionally, in social network measurement designs that ask subjects to nominate other people in …
-
Typical case behaviour of spin systems in random graph and composite ensembles
This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound …
Page 1 of 18