Amends errors, augments data and aids analysis of John Snow's map of the 1854 London cholera outbreak.
John Snow's map of the 1854 cholera outbreak in London is one of the best known examples of data visualization and information design.
By plotting the number and location of fatalities on a map, Snow was able to do something that is easily taken for granted today: the ability to create and disseminate a visualization of a spatial distribution. To our modern eye, the pattern is unmistakable. It seems self-evident that the map elegantly supports Snow's claims that cholera is a waterborne disease and that the pump on Broad Street is the source of the outbreak. And yet, despite its virtues, the map failed to convince both the authorities and Snow's colleagues in the medical and scientific communities.
Beyond considerations of time and place, there are "scientific" reasons for this failure. The map shows a concentration of cases around the Broad Street pump, but that alone should not convince us that Snow is right. The map doesn't refute the primary rival explanation, miasma theory: the pattern we se is not unlike what airborne transmission might look like. And while the presence of a pump near or at the epicenter of the distribution of fatalities is strong circumstantial evidence, it is still circumstantial. There are a host of rival explanations that the map doesn't consider and cannot rule out: location of sewer grates, elevation, weather patterns, etc..
Arguably, this may be one reason why Snow added a graphical annotation in the second, lesser-known version of the map that was published in the official report on the outbreak (Report On The Cholera Outbreak In The Parish Of St. James, Westminster, During The Autumn Of 1854):
The annotation outlines what we might call the Broad Street pump neighborhood: the set of addresses that are, according to Snow, within "close" walking distance to the pump. The notion of a pump neighborhood is important because it provides a prediction about where we should and should not expect to find cases. If water is cholera's mode of transmission and if water pumps are the primary source of drinking water, then most, if not all, fatalities should be found within the pump neighborhood. The disease should stop at the neighborhood's borders.
Creating this annotation is not a trivial matter. To identify the neighborhood of the Broad Street pump, you actually need to identify the neighborhoods of surrounding pumps. Snow writes: "The inner dotted line on the map shews [sic] the various points which have been found by careful measurement to be at an equal distance by the nearest road from the pump in Broad Street and the surrounding pumps ..." (Ibid., p. 109.).
I build on Snow's efforts by writing functions that allow you to compute two flavors of pump neighborhoods. The first is based on Voronoi tessellation. It works by computing the Euclidean distances between pumps. It's easy to compute and has been a popular choice for analysts of Snow's map. However, it has two drawbacks: 1) roads and buildings play no role in determining neighborhoods (it assumes that people walk directly, "as the crow flies", to their preferred pump); and 2) it's not what Snow has in mind. For that, you'll need to consider the second type of neighborhood.
The second flavor is based on the walking distance along the roads on the map. While more accurate, it's computationally more demanding. To compute these distances, I transform the roads on the map into a network graph and turn the computation of walking distance into a graph theory problem. For each case (observed or simulated), I compute the shortest path, weighted by the length of roads, to the nearest pump. Then, "rinse and repeat" and the different pump neighborhoods emerge:
To explore the data, you can consider a variety of scenarios by computing neighborhoods based on any subset of pumps. Here's the result excluding the Broad Street pump.
You can also explore "expected" neighborhoods. Currently, you can do so in three ways. The first colors roads.
plot(neighborhoodWalking(case.set = "expected"))
The second and third color each neighborhood's area by using either points or polygons. The polygon implementation is shown below. For exploration, the first two options are faster.
plot(neighborhoodWalking(case.set = "expected"), type = "area.polygons")
The main virtue of the polygon approach is that it better lends itself to building graphs at different scales:
streetNameLocator("marshall street", zoom = TRUE, highlight = FALSE,add.title = FALSE, radius = 0.5)addNeighborhood()
To install 'cholera' from CRAN:
To install the development version of 'cholera' from GitHub:
# Note that you may need to install the 'devtools' package:# install.packages("devtools")devtools::install_github("lindbrook/cholera", build_vignettes = TRUE)
Read the package vignettes (and the lab notes, if interested). They expand on the concept of a "pump neighborhood", and go into greater detail on how the data was "fixed" and on the methods used to compute walking distances and pump neighborhoods.
They are also available online at the links below:
neighborhoodWalking() is computationally intensive. Using R version 3.5.1 on a single core of a 2.3 GHz Intel i7, plotting observed paths to PDF takes about 5 seconds; doing the same for expected paths takes about 28 seconds. Using the functions' parallel implementation on 4 physical (8 logical) cores, the times fall to about 4 and 11 seconds.
Note that parallelization is currently only available on Linux and Mac.
Also, note that although some precautions are taken in R.app on macOS, the developers of the 'parallel' package, which
neighborhoodWalking() uses, strongly discourage against using parallelization within a GUI or embedded environment. See
vignette("parallel") for details.
Contributions to the 'cholera' package are welcome. If interested, please see the suggested guidelines.
"alpha.level" argument to control path transparency addEuclideanPath() and addWalkingPath()
distance and time based "mileposts" addEuclideanPath() and addWalkingPath(). plot.euclidean_path() and plot.walking_path(). addMilePosts().
"pump.subset" and "pump.select" arguments addCases(), addKernelDensity(), addMilePosts(), addNeighborhood(), neighborhoodEuclidean(), neighborhoodWalking()
"walking.speed" argument added to: addMilePosts(), nearestPump(), addEuclideanPath(), euclideanDistance(), euclideanPath(), addWalkingPath(), walkingDistance(), walkingPath()
euclideanDistance() no longer S3. generic S3 functionality moved to euclideanPath().
multiCore() moved to multiCore.R.
neighborhoodVoronoi() plot.voronoi() adds "euclidean.paths" argument for star graph.
neighborhoodWalking() "area.polygons" related functions for plot_walking() moved to pearlString.R.
simulateFatalities(): default is now 20K observations. use proximate in addition to orthogonal distances to find "addresses".
snowMap() new arguments: "add.cases", "add.pumps", "add.roads".
unitMeter() default unit of measurement is now "meter".
walkingAuxillaryFunctions.R: location of walking related helper functions.
walkingDistance() no longer S3. generic S3 functionality moved to walkingPath().
ortho.proj.pump and ortho.proj.pump.vestry now include node ID.
roads and road.segments amend street names: "Unknown-B" to "Tent Court" (Edmund Cooper's map). "Unknown-D" to "St James's Market" (https://maps.nls.uk). "Unknown-E" to "Market Street (II)" (https://maps.nls.uk).
addKernelDensity() uses "pump.subset" and "pump.select" arguments.
addLandmarks() add landmarks from Edmund Cooper's map.
classifierAudit() can return coordinates of address.
nearestPump() now incorporates nearestPath().
neighborhoodWalking() segment and sub-segment implementation.
pumpData() returns node ID.
timeSeries() includes day of the week.
walkingDistance() add "simulated" expected cases.
plot.walking type = "area.points" and type = "area-polygons". type = "area-polygons" via pearlString() replaces alphahull::ashape().
print.walking() uses expectedCount().
addSnow() "area", "street" and "boundary" graphical annotation.
caseLocator() highlight home road segment.
neighborhoodWalking() "case-set" argument: "observed", "expected" and "snow". updated implementation and improved performance. pre-computed configurations from version 0.2.1 removed.
segmentLocator(), streetNameLocator() and streetNumberLocator() highlight segment or street cases. option to plot all cases, anchor cases or no cases.