A Multigraph Approach to Social Network Analysis

Cite This

Files in this item

Checksum: MD5:09911d64494da126792d3390498f1955

TABATABAEI SHAFIEI, Termeh, 2015. A Multigraph Approach to Social Network Analysis. In: Journal of Social Structure. Carnegie Mellon. 16(1), pp. 0-21. eISSN 1529-1227. Available under: doi: 10.21307/joss-2019-011

@article{TabatabaeiShafiei2015Multi-57396, title={A Multigraph Approach to Social Network Analysis}, year={2015}, doi={10.21307/joss-2019-011}, number={1}, volume={16}, journal={Journal of Social Structure}, pages={0--21}, author={Tabatabaei Shafiei, Termeh} }

<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/rdf/resource/123456789/57396"> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57396/3/Shafie_2-15kbvz6ld5j5g4.pdf"/> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/57396"/> <dcterms:title>A Multigraph Approach to Social Network Analysis</dcterms:title> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2015</dcterms:issued> <dcterms:abstract xml:lang="eng">Multigraphs are graphs where multiple edges and edge loops are permitted. The main purpose of this article is to show the versatility of a multigraph approach when analysing social networks. Multigraph data structures are described and it is exemplified how they naturally occur in many contexts but also how they can be constructed by different kinds of aggregation in graphs. Special attention is given to a random multigraph model based on independent edge assignments to sites of vertex pairs and some useful measures of the local and global structure under this model are presented. Further, it is shown how some general measures of simplicity and complexity of multigraphs are easily handled under the present model.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Tabatabaei Shafiei, Termeh</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-05-03T07:41:06Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/57396/3/Shafie_2-15kbvz6ld5j5g4.pdf"/> <dc:creator>Tabatabaei Shafiei, Termeh</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2022-05-03T07:41:06Z</dc:date> </rdf:Description> </rdf:RDF>

Downloads since May 3, 2022 (Information about access statistics)

Shafie_2-15kbvz6ld5j5g4.pdf 78

This item appears in the following Collection(s)

Search KOPS


Browse

My Account