Publikation:

Random multigraphs and aggregated triads with fixed degrees

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2018

Autor:innen

Frank, Ove
Shafie, Termeh

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1017/nws.2017.31
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Network Science. Cambridge University Press (CUP). 2018, 6(2), pp. 232-250. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2017.31

Zusammenfassung

Random multigraphs with fixed degrees are obtained by the configuration model or by so called random stub matching. New combinatorial results are given for the global probability distribution of edge multiplicities and its marginal local distributions of loops and edges. The number of multigraphs on triads is determined for arbitrary degrees, and aggregated triads are shown to be useful for analyzing regular and almost regular multigraphs. Relationships between entropy and complexity are given and numerically illustrated for multigraphs with different number of vertices and specified average and variance for the degrees.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
310 Statistik

Schlagwörter

multigraph, fixed degrees, edge multiplicity, configuration model, random stub matching, complexity and simplicity, entropy, aggregated triad

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690FRANK, Ove, Termeh SHAFIE, 2018. Random multigraphs and aggregated triads with fixed degrees. In: Network Science. Cambridge University Press (CUP). 2018, 6(2), pp. 232-250. ISSN 2050-1242. eISSN 2050-1250. Available under: doi: 10.1017/nws.2017.31
BibTex
@article{Frank2018Rando-66694,
  year={2018},
  doi={10.1017/nws.2017.31},
  title={Random multigraphs and aggregated triads with fixed degrees},
  number={2},
  volume={6},
  issn={2050-1242},
  journal={Network Science},
  pages={232--250},
  author={Frank, Ove and Shafie, Termeh}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/66694">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-20T10:52:27Z</dcterms:available>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Shafie, Termeh</dc:contributor>
    <dc:contributor>Frank, Ove</dc:contributor>
    <dc:creator>Shafie, Termeh</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2023-04-20T10:52:27Z</dc:date>
    <dcterms:abstract>Random multigraphs with fixed degrees are obtained by the configuration model or by so called random stub matching. New combinatorial results are given for the global probability distribution of edge multiplicities and its marginal local distributions of loops and edges. The number of multigraphs on triads is determined for arbitrary degrees, and aggregated triads are shown to be useful for analyzing regular and almost regular multigraphs. Relationships between entropy and complexity are given and numerically illustrated for multigraphs with different number of vertices and specified average and variance for the degrees.</dcterms:abstract>
    <dcterms:title>Random multigraphs and aggregated triads with fixed degrees</dcterms:title>
    <dc:creator>Frank, Ove</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/66694"/>
    <dcterms:issued>2018</dcterms:issued>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
Diese Publikation teilen