Random–Walk–Based Segregation Measures
In this paper, we propose an intuitive way of how to measure residential segregation. Individuals are located in different nodes on a network that are interconnected through links. Each period, an individual either advances to an adjacent node or she stops moving. In this setting, the segregation index is then defined as the probability that a randomly chosen individual meets an individual of the same social group in the neighborhood where her random-walk terminates. It is shown in a dual theorem that the segregation index is as a natural generalization of the isolation index to networks and that it is proportional to the PageRank index applied by Google in order to determine the importance of web-pages. Finally, the segregation index is applied to the Spanish 2009 census tract data and compared with other prominent measures.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Federico Echenique & Roland G. Fryer, 2007.
"A Measure of Segregation Based on Social Interactions,"
The Quarterly Journal of Economics,
Oxford University Press, vol. 122(2), pages 441-485.
- Fryer, Roland & Echenique, Federico, 2007. "A Measure of Segregation Based on Social Interactions," Scholarly Articles 2958220, Harvard University Department of Economics.
- David M. Cutler & Edward L. Glaeser, 1997. "Are Ghettos Good or Bad?," The Quarterly Journal of Economics, Oxford University Press, vol. 112(3), pages 827-872. Full references (including those not matched with items on IDEAS)