Urban Studies

 

Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here for more information

Click here for more information

Sign In to gain access to subscriptions and/or personal tools.
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by McMillen, D. P.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?
Urban Studies, Vol. 40, No. 1, 57-69 (2003)
DOI: 10.1080/00420980220080161
© 2003 Urban Studies Journal Limited

Identifying Sub-centres Using Contiguity Matrices

Daniel P. McMillen

Department of Economics, University of Illinois at Chicago, 601 S. Morgan Street, Chicago, IL 60607, USA, mcmillen{at}uic.edu

This paper presents a simple algorithm for identifying sub-centres using standard properties of contiguity matrices to simplify the identification procedure. Sub-centres are identified for Atlanta, Baltimore-Washington, Boston, New York and Philadelphia. A sub-centre is defined to be a set of contiguous tracts that each have significantly positive residuals in a first-stage non-parametric regression and that together have at least 10 000 employees. The algorithm is also applicable when potential sub-centre sites are identified by other methods, such as minimum employment density cut-offs.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?