地域結合過程における　ｎlogｎ　の意味について

Theoretical study on threshold-function nlogn for the urban network connectivity

日本都市計画学会

2008-04-09T09:23:03Z

2008-04-09T09:23:03Z

2002

The main theme of this paper is to clarify the moment when the network with distinction-members will be generated. Especially, we analyze the process such that the most important global structure in which every point is totally connected, is going to appear. In order to do this, we use the random graph theory that is the combination of the graph theory with mathematical probability theory. First of all, we have to show that nlogn is the threshold function for connecting every n members, so that nlogn is the necessary number of edges as well as sufficient number for spanning n vertices. From here we can get the more precise probability for network connectivity. Finally we would like to discuss the conclusions of comparing this theoretical result with the computational result.

Made available in DSpace on 2008-04-09T09:23:03Z (GMT). No. of bitstreams: 0 Previous issue date: 2008-04-09

都市計画学会論文集「学術研究論文発表会論文」Vol. 37 (2002) 23 pp.133-138

http://hdl.handle.net/10212/1628

ja

本著作物の著作権は（社）日本都市計画学会に帰属します。

Journal Article

Article