Publikation: Quad Census Computation : Simple, Efficient, and Orbit-Aware
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation algorithms. We present a new approach to count all induced and non-induced 4-node subgraphs (the quad census) on a per-node and per-edge basis, complete with a separation into their non-automorphic roles in these subgraphs. It is the first approach to do so in a unified manner, and is based on only a clique-listing subroutine. Computational experiments indicate that, despite its simplicity, the approach outperforms previous, less general approaches.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
ORTMANN, Mark, Ulrik BRANDES, 2016. Quad Census Computation : Simple, Efficient, and Orbit-Aware. 12th International Conference and School, NetSci-X 2016. Wroclaw, 11. Jan. 2016 - 13. Jan. 2016. In: WIERZBICKI, Adam, ed., Ulrik BRANDES, ed., Frank SCHWEITZER, ed., Dino PEDRESCHI, ed.. Advances in Network Science : 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016 ; Proceedings. Cham: Springer, 2016, pp. 1-13. Lecture Notes in Computer Science. 9564. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-28360-9. Available under: doi: 10.1007/978-3-319-28361-6_1BibTex
@inproceedings{Ortmann2016-01-05Censu-33682, year={2016}, doi={10.1007/978-3-319-28361-6_1}, title={Quad Census Computation : Simple, Efficient, and Orbit-Aware}, number={9564}, isbn={978-3-319-28360-9}, issn={0302-9743}, publisher={Springer}, address={Cham}, series={Lecture Notes in Computer Science}, booktitle={Advances in Network Science : 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016 ; Proceedings}, pages={1--13}, editor={Wierzbicki, Adam and Brandes, Ulrik and Schweitzer, Frank and Pedreschi, Dino}, author={Ortmann, Mark and Brandes, Ulrik} }
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/33682"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-04-26T11:57:45Z</dc:date> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:language>eng</dc:language> <dc:creator>Ortmann, Mark</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2016-04-26T11:57:45Z</dcterms:available> <dcterms:abstract xml:lang="eng">The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation algorithms. We present a new approach to count all induced and non-induced 4-node subgraphs (the quad census) on a per-node and per-edge basis, complete with a separation into their non-automorphic roles in these subgraphs. It is the first approach to do so in a unified manner, and is based on only a clique-listing subroutine. Computational experiments indicate that, despite its simplicity, the approach outperforms previous, less general approaches.</dcterms:abstract> <dcterms:issued>2016-01-05</dcterms:issued> <dc:creator>Brandes, Ulrik</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33682/1/Ortmann_0-324682.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dcterms:title>Quad Census Computation : Simple, Efficient, and Orbit-Aware</dcterms:title> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Ortmann, Mark</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:rights>terms-of-use</dc:rights> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/33682/1/Ortmann_0-324682.pdf"/> <dc:contributor>Brandes, Ulrik</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/33682"/> </rdf:Description> </rdf:RDF>