Skip to content
Prev 4926 / 29559 Next

Different Moran's I correlograms using correlog{ncf} and sp.correlogram{spdep}

On Fri, 30 Jan 2009, Xingli Giam wrote:

            
No, because correlog{ncf} bins the distances, but sp.correlogram{spdep} 
adds higher order lags - here the second lag of i (with first order 
neighbours j) is the set of all points k that are neighbours of points j 
and neither i nor in j. It depends on graph edge counts, not distance as 
such. They aren't comparable, really. If you want to do it by hand, check 
the distances reported by correlog() (they may not be what you think), 
take the bin boundaries, plug them into multiple calls to dnearneigh(), 
and go from there.

Roger