Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/102343
DC FieldValueLanguage
dc.contributor經濟系
dc.creator陳心蘋zh_TW
dc.creatorChen, Hsin-Ping
dc.date2001-12
dc.date.accessioned2016-09-29T09:01:07Z-
dc.date.available2016-09-29T09:01:07Z-
dc.date.issued2016-09-29T09:01:07Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/102343-
dc.description.abstract本文的主要目的是以模擬方式分析最大熵概念為基礎所推導的都市交互與成長過程,是否會衍化出趨近普瑞夫定理(Zipf`s Law)的城市分配。模擬結果顯示:(一)動態交互模型在不同的參數值下可產生穩定或不穩定的成長型式。(二)在穩定的衍化過程中,本文的模型可產生決定性的與隨機的成長過程。(三)決定性的與隨機的成長型式都會趨近於普瑞夫定理的分配型態。
dc.description.abstractIt is well known that the size distribution of cities is surprisingly well described by Zipf`s law. It is considered the criterion for the local growth model. The purpose of this paper is to explain Zipf`s law through the use of a dynamic process based on a spatial interaction model derived from entropy. Empirical findings show that: (1) the purposed dynamic process can generate both stable and unstable patterns in accordance with the value of the parameters, (2) in the stable evolution, the model can generate both deterministic and stochastic growth processes, (3) both deterministic and stochastic growth processes converge in Zipf`s pattern, and (4) evidence from cities in Taiwan shows a diminishing estimated intercept and slope as the proposed model predicted. Size distribution in Taiwan converges to Zipf`s pattern.
dc.format.extent1665811 bytes-
dc.format.mimetypeapplication/pdf-
dc.relation國立政治大學學報, 83, 125-156
dc.subject普瑞夫定理 ; 最大熵 ; 城市分配
dc.subject
dc.title空間交互模型與普瑞夫定理zh_TW
dc.title.alternativeZipf`s Law and the Spatial Interaction Models
dc.typearticle
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypearticle-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
fb160923121324.pdf1.63 MBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.