A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas

In several economical, statistical and geographical applications, a territory must be subdivided into functional regions. Such regions are not fixed and politically delimited, but should be identified by analyzing the interactions among all its constituent localities. This is a very delicate and important task, that often turns out to be computationally difficult. In this work we propose an innovative approach to this problem based on the solution of minimum cut problems over an undirected graph called here transitions graph. The proposed procedure guarantees that the obtained regions satisfy all the statistical conditions required when considering this type of problems. Results on real-world instances show the effectiveness of the proposed approach.

[1]  J. F. B. Goodman,et al.  THE DEFINITION AND ANALYSIS OF LOCAL LABOUR MARKETS: SOME EMPIRICAL PROBLEMS , 1970 .

[2]  Raúl Ramos Lobo,et al.  Supervised regionalization methods: A survey , 2006 .

[3]  Giovanni Fusco,et al.  Hierarchical Clustering through Spatial Interaction Data. The Case of Commuting Flows in South-Eastern France , 2011, ICCSA.

[4]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[5]  Manfred M. Fischer,et al.  Regional taxonomy: A comparison of some hierarchic and non-hierarchic strategies , 1980 .

[6]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[7]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .

[8]  M. Smart.  Labour market areas: Uses and definition , 1974 .

[9]  Fabio Sforzi,et al.  From Administrative Spatial Units to Local Labour Market Areas Some Remarks on the Unit of Investigation of Regional Economics with Particular Reference to the Applied Research in Italy , 2012 .

[10]  Hyun Kim,et al.  Delimitation of Functional Regions Using a p-Regions Problem Approach , 2015 .

[11]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Renato Bruni,et al.  Effective Classification Using a Small Training Set Based on Discretization and Statistical Analysis , 2015, IEEE Transactions on Knowledge and Data Engineering.

[13]  Michael Brinkmeier.  A Simple and Fast Min-cut Algorithm , 2005, FCT.

[14]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[15]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[16]  Andrea Scozzari,et al.  Political Districting: from classical models to recent approaches , 2013, Annals of Operations Research.

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[18]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[19]  Padhraic Smyth,et al.  A Spectral Clustering Approach To Finding Communities in Graph , 2005, SDM.

[20]  Valter Di Giacinto,et al.  Mapping Local Productivity Advantages in Italy: Industrial Districts, Cities or Both? , 2012 .

[21]  Ian Masser,et al.  Hierarchical Aggregation Procedures for Interaction Data , 1975 .

[22]  Bruce Hendrickson.  Graph Partitioning , 2011, Encyclopedia of Parallel Computing.

[23]  Mike Coombes,et al.  The delineation of 21st century local labour market areas: a critical review and a research agenda , 2011 .

[24]  Riccardo Mazzoni,et al.  I mercati locali del lavoro in Italia , 1992 .

[25]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[26]  C. Farmer,et al.  Network-Based Functional Regions , 2011 .

[27]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[28]  Stan Openshaw,et al.  The use and definition of travel-to-work areas in Great Britain: Some comments , 1982 .

[29]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[30]  José Manuel Casado-Díaz,et al.  An evolutionary approach to the delineation of functional areas based on travel-to-work flows , 2008, Int. J. Autom. Comput..

[31]  Francisco Flórez-Revuelta,et al.  Grouping genetic operators for the delineation of functional areas based on spatial interaction , 2012, Expert Syst. Appl..

[32]  Lambert Van Der Laan,et al.  Reality versus Policy: The Delineation and Testing of Local Labour Market and Spatial Policy Areas , 2001 .

[33]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[34]  Mike Coombes,et al.  Defining Locality Boundaries with Synthetic Data , 2000 .

[35]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[36]  Anne E. Green,et al.  An Efficient Algorithm to Generate Official Statistical Reporting Areas: The Case of the 1984 Travel-to-Work Areas Revision in Britain , 1986 .

[37]  James B. Orlin,et al.  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.

[38]  Paolo Pavone,et al.  Mapping the Multifaceted Patterns of Industrial Districts: A New Empirical Procedure with Application to Italian Data , 2016 .