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 3 of 3 for “"havel hakimi"”.

  1. Graphs of Classroom Networks

    In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the …

    gsu Repository record for Graphs of Classroom Networks (opens in a new tab)

  2. Spectral Analysis of Randomly Generated Networks With Prescribed Degree Sequences

    … models, we use a well-known graph algorithm, the Havel-Hakimi algorithm, to produce an initial non-random sample G_D. We then run a Monte Carlo Markov Chain (MCMC) on the sample space of graphs with this degree sequence beginning at G_D in order to produce a random graph in this space. Denote this …

    south-carolina Repository record for Spectral Analysis of Randomly Generated Networks With Prescribed Degree Sequences (opens in a new tab)

  3. Modelling conflicting individual preference: Target sequences and graph realization

    … related properties. We introduced the Reverse Havel Hakimi theorem/algorithm and considered examples of game simulations over the terminal set that reached it, and investigated the individual’s best strategy to maximise their payoff at every state using backwards induction. Together, these …

    city-london Download PDF for Modelling conflicting individual preference: Target sequences and graph realization (opens in a new tab)