Publikation:

Understanding the Mechanisms that Drive Relational Events Dynamics and Structure in Corruption Networks

Lade...
Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2025

Autor:innen

Diviák, Tomáš

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Deutsche Forschungsgemeinschaft (DFG): 321869138

Projekt

Open Access-Veröffentlichung
Open Access Hybrid
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Journal of Quantitative Criminology. Springer. ISSN 0748-4518. eISSN 1573-7799. Verfügbar unter: doi: 10.1007/s10940-025-09605-x

Zusammenfassung

Objectives Relational hyperevent data, i.e., time-stamped events comprising two or more actors, provide the most granular picture of network dynamics. Using hyperevent data on communication related to corruption, we answer two research questions related to corruption network structure and dynamics. First, we test core-periphery structure fit and measure temporal escalation. Second, we test the relational micro-mechanisms that bring about these structures and dynamics. We include attribute-related mechanisms (selection, heterophily), hyperevent-specific endogenous mechanisms (repeated interaction, repeated co-participation, subordination), and general endogenous mechanisms (triadic closure, reciprocity, tie accumulation) Methods Utilising publicly available data on three dynamic corporate corruption networks from Deferred Prosecution Agreements in the UK, we first measure each network’s core-periphery structure and temporal escalation. Then, we test the mechanisms that drive their evolution by modelling the sequence of relational hyperevents with relational hyper-event model (RHEM) recently developed to model such data. In RHEM, events are modelled as hyperedges in a hypergraph allowing to connect multiple nodes simultaneously. Results Two networks display strong signs of both core-periphery structures and temporal escalation, whereas the last one displays temporal escalation but a rather weak signs of a core-periphery structure. Using RHEM, we find evidence for the effects of repeated interaction and repeated co-participation in all the networks together with various forms hierarchical tendencies, yet little evidence for triadic closure. Conclusions We highlight the usefulness of RHEM for vast array of criminal network data that is frequently recorded as hyperevents (e.g., co-offending). We also discuss potential practical implications for prevention and disruption of corruption networks using descriptive and model-based evidence.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Corruption, Criminal networks, Relational hyperevent models, Network dynamics

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690DIVIÁK, Tomáš, Jürgen LERNER, 2025. Understanding the Mechanisms that Drive Relational Events Dynamics and Structure in Corruption Networks. In: Journal of Quantitative Criminology. Springer. ISSN 0748-4518. eISSN 1573-7799. Verfügbar unter: doi: 10.1007/s10940-025-09605-x
BibTex
@article{Diviak2025-03-25Under-72865,
  title={Understanding the Mechanisms that Drive Relational Events Dynamics and Structure in Corruption Networks},
  year={2025},
  doi={10.1007/s10940-025-09605-x},
  issn={0748-4518},
  journal={Journal of Quantitative Criminology},
  author={Diviák, Tomáš and Lerner, Jürgen}
}
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/72865">
    <dc:creator>Diviák, Tomáš</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Diviák, Tomáš</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-04-02T08:19:07Z</dc:date>
    <dcterms:issued>2025-03-25</dcterms:issued>
    <dc:creator>Lerner, Jürgen</dc:creator>
    <dc:language>eng</dc:language>
    <dc:contributor>Lerner, Jürgen</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/72865"/>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-04-02T08:19:07Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:title>Understanding the Mechanisms that Drive Relational Events Dynamics and Structure in Corruption Networks</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract>Objectives
Relational hyperevent data, i.e., time-stamped events comprising two or more actors, provide the most granular picture of network dynamics. Using hyperevent data on communication related to corruption, we answer two research questions related to corruption network structure and dynamics. First, we test core-periphery structure fit and measure temporal escalation. Second, we test the relational micro-mechanisms that bring about these structures and dynamics. We include attribute-related mechanisms (selection, heterophily), hyperevent-specific endogenous mechanisms (repeated interaction, repeated co-participation, subordination), and general endogenous mechanisms (triadic closure, reciprocity, tie accumulation)
Methods
Utilising publicly available data on three dynamic corporate corruption networks from Deferred Prosecution Agreements in the UK, we first measure each network’s core-periphery structure and temporal escalation. Then, we test the mechanisms that drive their evolution by modelling the sequence of relational hyperevents with relational hyper-event model (RHEM) recently developed to model such data. In RHEM, events are modelled as hyperedges in a hypergraph allowing to connect multiple nodes simultaneously.
Results
Two networks display strong signs of both core-periphery structures and temporal escalation, whereas the last one displays temporal escalation but a rather weak signs of a core-periphery structure. Using RHEM, we find evidence for the effects of repeated interaction and repeated co-participation in all the networks together with various forms hierarchical tendencies, yet little evidence for triadic closure.
Conclusions
We highlight the usefulness of RHEM for vast array of criminal network data that is frequently recorded as hyperevents (e.g., co-offending). We also discuss potential practical implications for prevention and disruption of corruption networks using descriptive and model-based evidence.</dcterms:abstract>
  </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
Ja
Begutachtet
Ja
Online First: Zeitschriftenartikel, die schon vor ihrer Zuordnung zu einem bestimmten Zeitschriftenheft (= Issue) online gestellt werden. Online First-Artikel werden auf der Homepage des Journals in der Verlagsfassung veröffentlicht.
Diese Publikation teilen