Measuring Diversity and Segregation with Convex Functions

Philip S. Chodrow

Home/Archive/arXiv

arXiv · 2610.02446

Measuring Diversity and Segregation with Convex Functions

Philip S. Chodrow

View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem of segregation measurement is to quantitatively describe the interaction of a population's attributes (such as race, ethnicity, education level, or income) with a separating distinction (such as organizational rank, school district, or spatial location). This primarily expository article gives an opinionated tour of one mathematical approach to measuring segregation. We begin with some basic intuitions about diversity and unify these through the framework of convex functions on the probability simplex. Formalizing segregation as a local-to-global comparison of diversity measures, resulting in the general class of Jensen informations as segregation measurements. We describe and computationally illustrate three ways to incorporate spatial structure into segregation measurements: spatial smoothing, aggregation, and local Jensen information. We close with several suggestions for future work.

Explore related subjects

physics.soc-ph cs.SI physics.data-an

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Philip S. Chodrow. 2026-10-01. Measuring Diversity and Segregation with Convex Functions. https://arxiv.org/abs/2610.02446

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Human mobility shapes how urban policy effects spread across cities

Urban policies are often evaluated assuming their effects decay with geographic distance. However, cities are systems of human movement, and policy effects propagate through individual mobility rather than spatial proximity alone. This study demonstrates that neglecting mobility can systematically distort estimates of how urban policies affect activity. Using large-scale mobility data, we estimate the causal effects of three transportation interventions in Boston and New York City using both conventional geographic and mobility-based definitions of exposure. Geographic designs detect no effects, or even negative ones. When exposure is defined through mobility networks, the same interventions reveal substantial behavioral change. Boston's free-fare program increases overall activity by approximately 16%, with more pronounced effects among lower-income communities. Open Streets programs significantly increase visits to nearby businesses, particularly food establishments. For congestion pricing, geographic approaches suggest a decline in activity in Manhattan, while a mobility-based perspective indicates no net reduction but a shift away from shopping and grocery destinations. Analysis across 138 metropolitan areas in eight countries further reveals that geographic and mobility-network distances diverge locally in every city, indicating that this discrepancy is a general characteristic of urban mobility. Collectively, these findings show that urban policies operate not only where they are implemented but where and how people move, so their impact must be measured through mobility rather than through space.

physics.soc-ph↗

arXiv2026

Performance of Zero-determinant Strategies in Repeated Games without Discounting

Zero-determinant (ZD) strategies are a class of strategies in repeated games, which unilaterally control payoffs. It has been shown that several ZD strategies promote cooperation in social dilemma games. It has been widely believed that the performance of ZD strategies is expressed as ``unilaterally enforce linear relations between payoffs''. However, in order to interpret properties of ZD strategies in repeated games without discounting, previous studies assumed that the limit of the Cesaro average of the probability distribution of the action profile exists. Here, we explain the performance of ZD strategies without this assumption, which leads to a stronger result than previous ones.

physics.soc-ph↗

arXiv2026

Disentangling epidemics and percolation

Non-recurrent epidemics on complex networks, such as the paradigmatic susceptible-infected-recovered (SIR) model, are often studied by mapping the model to bond percolation. However, the conditions under which this identification is justified have not been fully understood, except in specific cases. Here, we systematically determine when this mapping can be applied, starting from minimal assumptions on the epidemic model and the underlying network. Specifically, we discuss the conditions for three different forms of equivalence between a general non-recurrent epidemic model and Bernoulli bond percolation: isomorphism, equality of marginal infection probabilities, and equality of expected epidemic size. We numerically demonstrate the validity of our findings and examine how epidemiological outcomes are affected when these equivalences are not upheld. Our results establish the methodological basis and limitations of a common tool for analyzing epidemic processes on networks.

physics.soc-ph↗