A network based approach towards industry clustering
| dc.contributor.affiliation | Universidad EAFIT. Escuela de Economía y Finanzas. Research in Spatial Economics (RiSE), Carrera 49 7 Sur-50, Medellín, Colombia. | spa |
| dc.contributor.author | Duque, Juan C. | spa |
| dc.contributor.author | Rey, S. J. | spa |
| dc.contributor.department | Escuela de Economía y Finanzas | spa |
| dc.contributor.eafitauthor | Duque, Juan C. (jduquec1@eafit.edu.co) | spa |
| dc.contributor.program | Research in Spatial Economics (RiSE) | eng |
| dc.creator.email | Duque, Juan C. (jduquec1@eafit.edu.co) | |
| dc.creator.email | Rey, S. J. (rey@asu.edu) | |
| dc.date | 2008 | |
| dc.date.accessioned | 2015-05-15T21:18:26Z | |
| dc.date.available | 2015-05-15T21:18:26Z | |
| dc.date.issued | 2008 | |
| dc.description | Industry cluster identification has become an important research topic in regional science, partly as a response to the growing demand by policymakers for analytical tools that provide a better understanding of a regional economy. The main objective of this paper is to provide a detailed description of a new approach to identify industry clusters and interindustry networks, based on input-output tables. The goal is to outline and efficient algorithm using readily available data so that the method can be replicated in any region, thereby allowing for comparative studies of industrial clusters over space and time. This new method draws on concepts from network analysis theory. It can be divided into two main block: data reduction and network partitioning. Data reduction begins by representing industries and products/services flows as a directed graph, where the links are represented as arrows indicating the direction of the flows. Based on several assumptions about how industries are related into a supply chain, the initial graph is then concerted into an undirected graph by transforming products/services flows into relative weights. The second reduction is formulated as a minimization problem, resulting in a minimum spanning tree (MST) for a subset of the initial graph edges. The final clusters are obtained by selectively deleting edges in the MST, such that each cluster contains a core industry. | eng |
| dc.identifier.isbn | 9781847205155 | |
| dc.identifier.uri | http://hdl.handle.net/10784/5338 | |
| dc.language.iso | eng | eng |
| dc.publisher | Edward Elgar Publishing Ltd | eng |
| dc.rights.accessrights | info:eu-repo/semantics/openAccess | |
| dc.source | instname:Universidad EAFIT | spa |
| dc.source | reponame:Repositorio Institucional Universidad EAFIT | spa |
| dc.subject.keyword | industry clusters | eng |
| dc.subject.keyword | graph theory | eng |
| dc.subject.keyword | inputoutput | eng |
| dc.subject.keyword | impact analysis | eng |
| dc.title | A network based approach towards industry clustering | |
| dc.type | bookPart | eng |
| dc.type | info:eu-repo/semantics/bookPart | eng |
| dc.type | info:eu-repo/semantics/publishedVersion | eng |
| dc.type.hasVersion | publishedVersion | eng |
| dc.type.local | Capítulo o parte de un libro |