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 299 for “"Random graphs"”.

  1. 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 …

    waterloo Repository record for Properties of random graphs (opens in a new tab)

  2. (Sparse) Exchangeable Random Graphs

    … of the requirement that the labels of a random graph carry no information about its structure. This seemingly innocuous assumption implies that the corresponding networks are densely connected: a property that rarely holds for real-world networks of practical interest. This thesis …

    toronto-retro Repository record for (Sparse) Exchangeable Random Graphs (opens in a new tab)

  3. Colourings of random graphs

    … 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 where no two adjacent …

    oxford Repository record for Colourings of random graphs (opens in a new tab)

  4. Assortative Configuration Random Graphs

    A random graph model is introduced, which is supposed to capture the assortativity effect in various real-world networks. An effect that appears when different types of vertices have non-uniform tendencies to connect to each other. Therefore, given the node- and edge-type distributions P, Q a …

    mcmaster Repository record for Assortative Configuration Random Graphs (opens in a new tab)

  5. Pattern Recognition on Random Graphs

    … significantly in the 1960s, and the field of random graph inference has enjoyed much recent progress in both theory and application. This dissertation focuses on pattern recognition in the context of a particular family of random graphs, namely the stochastic blockmodels, from the two main …

    jhu Repository record for Pattern Recognition on Random Graphs (opens in a new tab)

  6. QUANTUM SEARCH ON RANDOM GRAPHS

    … what information do the properties of a random graph contain about the performance of a quantum search acting on it? To investigate this problem, we define a notion of search time to quantify the behavior of a quantum search, and find strong evidence of a relation between its distribution …

    temple Repository record for QUANTUM SEARCH ON RANDOM GRAPHS (opens in a new tab)

  7. Hamiltonicity problems in random graphs

    … a very recent development about Hamiltonicity in random subgraphs of the hypercube, where we have resolved a long standing conjecture dating back to the 1980s. Second, we present some original results about correlations between the appearance of edges in random regular hypergraphs, which have many …

    birmingham Download PDF for Hamiltonicity problems in random graphs (opens in a new tab)

  8. Random graphs with correlation structure.

    In this thesis we consider models of random graphs where, unlike in the classical models G (n, p) the probability of an edge arising can be correlated with that of other edges arising. Attention focuses on graphs whose vertices are each assigned a colour (type) at random and where edges between …

    whiterose Download PDF for Random graphs with correlation structure. (opens in a new tab)

  9. Vertex Models on Random Graphs

    Diese Arbeit befaßt sich mit der Koppelung von Vertex-Modellen an die planaren $\phi^4$-Zufallsgraphen des Zugangs zur Quantengravitation über dynamische Polygonifizierungen. Das betrachtete System hat eine doppelte Bedeutung, einerseits als die Koppelung einer konformen Feldtheorie mit zentraler …

    qucosa-diss

  10. Efficient Distributed Algorithms on Random Graphs

    … Hamiltonian cycles and detecting communities in graphs. Both of them are NP-hard problems on general graphs but can admit efficient solutions in {\em random graphs}. In this dissertation, we present efficient distributed algorithms for the above two problems in random graphs. First, we present …

    houston Repository record for Efficient Distributed Algorithms on Random Graphs (opens in a new tab)

  11. On two models of random graphs /

    … the first part several asymptotic properties of random intersection graphs are studied. They include birth thresholds for small complete subgraphs in the binomial random intersection graph, the clique number in sparse random intersection graphs and the chromatic index of random uniform …

    vilnius Repository record for On two models of random graphs / (opens in a new tab)

Page 1 of 15