<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Nick Solomon</title>
    <link>/</link>
    <description>Recent content on Nick Solomon</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <copyright>© This post is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License，please give source if you likes to quote or reproduce.</copyright>
    <lastBuildDate>Mon, 12 Feb 2018 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>Street trees and tidycensus</title>
      <link>/post/street-trees-and-tidycensus/</link>
      <pubDate>Mon, 12 Feb 2018 00:00:00 +0000</pubDate>
      
      <guid>/post/street-trees-and-tidycensus/</guid>
      <description>One of my favorite data sources is the NYC OpenData site. A while back I noticed a really interesting data set on that site, and I’ve been mulling over what exactly to do with it for a while. The data set in question is the 2015 Street Tree Census. I knew there was some interesting question that this data could answer, I just had to think of it (or ask my girlfriend to think of it for me.</description>
    </item>
    
    <item>
      <title>Learn Metropolis-Hastings Sampling with R</title>
      <link>/post/learn-metropolis-hastings-sampling-with-r/</link>
      <pubDate>Tue, 06 Feb 2018 00:00:00 +0000</pubDate>
      
      <guid>/post/learn-metropolis-hastings-sampling-with-r/</guid>
      <description>In this blog post I hope to introduce you to the powerful and simple Metropolis-Hastings algorithm. This is a common algorithm for generating samples from a complicated distribution using Markov chain Monte Carlo, or MCMC.
By way of motivation, remember that Bayes’ theorem says that given a prior \(\pi(\theta)\) and a likelihood that depends on the data, \(f(\theta | x)\), we can calculate \[ \pi(\theta | x) = \frac{f(\theta | x) \pi(\theta)}{\int f(\theta | x) \pi(\theta) \; \mathrm{d}\theta}.</description>
    </item>
    
    <item>
      <title>How is Oregon Motor Voter affecting different counties?</title>
      <link>/post/2017-03-01-how-is-oregon-motor-voter-affecting-different-counties/</link>
      <pubDate>Wed, 01 Mar 2017 00:00:00 +0000</pubDate>
      
      <guid>/post/2017-03-01-how-is-oregon-motor-voter-affecting-different-counties/</guid>
      <description>(This is a companion to my post on Paul Gronke’s earlyvoting.net)
One of the first assignments we had in my Election Sciences course was to take a look at registration data from the Oregon Motor Voter program and try to find interesting patterns. For those who don’t know, Oregon Motor Voter is an automatic voter registration program in Oregon. Whenever someone interacts with the Oregon DMV, their voter eligibility is automatically checked, and if they are eligible to vote but not registered, they are automatically added to the rolls.</description>
    </item>
    
    <item>
      <title>Cases handled by Legal Aid of Southeastern PA</title>
      <link>/pages/lasp/</link>
      <pubDate>Tue, 07 Feb 2017 21:51:44 -0800</pubDate>
      
      <guid>/pages/lasp/</guid>
      <description> For this project, I worked with Legal Aid of Southeastern PA to help them find patterns in the types of services they provide to different geographic areas in the four counties they serve. Here is an anonymized version of the interactive maps I produced for them. Points were jittered randomly by a small amount, so while exact locations are inaccurate, any overall trends should still be apparent.
Bucks county  Chester county  Delaware county  Montgomery county  </description>
    </item>
    
    <item>
      <title>Networks and disease</title>
      <link>/post/2017-01-23-networks-and-disease/</link>
      <pubDate>Mon, 06 Feb 2017 00:00:00 +0000</pubDate>
      
      <guid>/post/2017-01-23-networks-and-disease/</guid>
      <description>In 1861 the small town of Hagelloch, Germany experienced a measles outbreak. A doctor very carefully recorded the time of infection and symptoms for each patient.1 In the 1990’s, another German doctor went through all this data and was able to deduce the source of infection of each child.2 This data set gives us a wealth of information about the spread of disease, but it also allows us the rare opportunity to view disease as spreading over a network.</description>
    </item>
    
    <item>
      <title>About</title>
      <link>/pages/about/</link>
      <pubDate>Tue, 17 Jan 2017 16:03:55 -0800</pubDate>
      
      <guid>/pages/about/</guid>
      <description>I like statistics, R, and Python.
I wrote a thesis about asymptotic properties of network models.
All the photos were taken by me with a Minolta X-370 in various places in Oregon, Washington, and Maine.</description>
    </item>
    
    <item>
      <title>Projects</title>
      <link>/pages/projects/</link>
      <pubDate>Tue, 17 Jan 2017 16:03:51 -0800</pubDate>
      
      <guid>/pages/projects/</guid>
      <description>Local Dependence in Exponential Random Network Models For my undergraduate thesis project at Reed College, I worked with random graph models used in social network analysis. I extended results about the existence and consistency of MLEs and the asymptotic distribution of statistics to a new class of model.

Crime in Northwest Philadelphia An exploration of the locations of violent crime in northwest Philadelphia from 2006 to 2016 using shiny and leaflet.</description>
    </item>
    
  </channel>
</rss>