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 6 of 6 for “"Random intersection graphs"”.

  1. Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία και εξελικτικά δίκτυα

    … let ${\cal M}$ be a finite set of $m$ labels. An intersection graph is then constructed by assigning to each vertex $v \in V$ a subset $S_v$ of ${\cal M}$ and then connecting every pair of vertices that have common labels in their corresponding label sets. This thesis concerns the study of …

    greece Repository record for Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία και εξελικτικά δίκτυα (opens in a new tab)

  2. Sankirtų grafų viršūnių laipsnių asimptotika /

    Random intersection graphs audits vertex degree distributions are viewed. Its proved, vertex degree has Binomial distribution. Probability p that two vertex of graph chooses common object is find.

    vilnius Repository record for Sankirtų grafų viršūnių laipsnių asimptotika / (opens in a new tab)

  3. Du atsitiktinių grafų modeliai /

    … the doctoral dissertation \"On two models of random graphs\" (in English) by V. Kurauskas. We introduce the random graph models (random intersection graphs, graphs with disjoint excluded minors) studied in the thesis, overview the problems and state the main results.

    vilnius Repository record for Du atsitiktinių grafų modeliai / (opens in a new tab)

  4. 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)

  5. Losowe grafy przecięć. Modelowanie sieci i ich analiza

    Przedmiotem rozprawy jest badanie sieci przy pomocy ich teoretycznych modeli grafowych. W tym celu analizowane były interesujące własności grafu losowego zwanego losowym grafem przecięć. Pod kątem analizy sieci złożonych (np. sieci stron WWW i sieci internetowych) badany był stopień wierzchołków. …

    amu-pl Repository record for Losowe grafy przecięć. Modelowanie sieci i ich analiza (opens in a new tab)