logo Netzschleuder network catalogue, repository, and centrifuge

dawn — Drug Abuse Warning Network emergency visits (2004-2011)

Description

Bipartite networks of drugs and the hospital emergency department visits in which they were reported, from the Drug Abuse Warning Network (DAWN). DAWN was a public health surveillance system of the U.S. Substance Abuse and Mental Health Services Administration (SAMHSA) that collected, from a national sample of hospitals, records of emergency department visits related to drug use. For each visit, the data list the drugs the patient reported having used, which include illicit substances, prescription and over-the-counter medication, and dietary supplements. The data were assembled by A. R. Benson and collaborators from the public DAWN files, and cover the years 2004 to 2011.

  • visits: each visit is a node connected to the drugs reported in it. Visits are dated at the resolution of quarter-years. Distinct visits with the same drugs are kept as separate nodes.
  • dispositions: each distinct combination of drugs reported in some visit is a node connected to its drugs, and annotated with the most common patient disposition (where the patient went after the visit, e.g. sent home, surgery, or released to detox) among the visits with that combination.

The networks have the following properties:

  • Drug nodes: name, the name of the drug; code, the DAWN drug code (visits only).
  • visits: is_visit, whether the node is a visit (otherwise it is a drug); year and quarter (1 to 4) of the visit.
  • dispositions: is_combination, whether the node is a drug combination (otherwise it is a drug); disposition, the disposition category, numbered 1 to 10. The names of the categories are not included in the source data (its file of category names lists drug names instead), and the 375 combinations with a category number larger than 10 have disposition set to -1.
Tags
Public Health Unweighted Timestamps Metadata
Citation
  • A. R. Benson, R. Abebe, M. T. Schaub, A. Jadbabaie, J. Kleinberg, "Simplicial closure and higher-order link prediction." Proceedings of the National Academy of Sciences 115(48), E11221-E11230 (2018) 10.1073/pnas.1800683115 Sci-Hub
  • I. Amburg, N. Veldt, A. R. Benson, "Clustering in graphs and hypergraphs with categorical edge labels." Proceedings of The Web Conference 2020, 706-717 (2020) 10.1145/3366423.3380152 Sci-Hub
Upstream URL OK
https://www.cs.cornell.edu/~arb/data/DAWN/
https://www.cs.cornell.edu/~arb/data/cat-edge-DAWN/
Networks
Tip: click on a column header to sort the list, or hover over it for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
visits 2,274,991 3,596,794 3.16 504.64 527.94 197.36 -0.27 0.00 12 1.00 Undirected Bipartite is_visit name code year quarter 6.6 MiB 13.6 MiB 12.9 MiB 16.6 MiB
dispositions 89,213 342,835 7.69 108.19 118.44 23.77 -0.26 0.00 11 1.00 Undirected Bipartite is_combination name disposition 590 KiB 1.2 MiB 1.1 MiB 1.2 MiB