{"created":"2025-09-09T04:11:08.030316+00:00","id":2000495,"links":{},"metadata":{"_buckets":{"deposit":"fe7d5613-0740-40c7-870a-736bf2ec8081"},"_deposit":{"created_by":13,"id":"2000495","owners":[13],"pid":{"revision_id":0,"type":"depid","value":"2000495"},"status":"published"},"_oai":{"id":"oai:kit.repo.nii.ac.jp:02000495","sets":["1753684612213:1753927614588:1753928025029"]},"author_link":[],"item_30002_access_rights4":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_30002_alternative_title1":{"attribute_name":"Alternative Title","attribute_value_mlt":[{"subitem_alternative_title":"Theoretical study on threshold-function nlogn for the urban network connectivity","subitem_alternative_title_language":"en"}]},"item_30002_creator2":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorAlternatives":[{"creatorAlternative":"Furuyama, Masao","creatorAlternativeLang":"en"}],"creatorNames":[{"creatorName":"古山, 正雄","creatorNameLang":"ja"}]}]},"item_30002_date11":{"attribute_name":"Date","attribute_value_mlt":[{"subitem_date_issued_datetime":"2002","subitem_date_issued_type":"Issued"}]},"item_30002_description9":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_language":"en","subitem_description_type":"Abstract"},{"subitem_description":"都市計画学会論文集「学術研究論文発表会論文」Vol. 37 (2002) 23 pp.133-138","subitem_description_language":"ja","subitem_description_type":"Other"},{"subitem_description":"Made available in DSpace on 2008-04-09T09:23:03Z (GMT). No. of bitstreams: 0   Previous issue date: 2008-04-09","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_30002_file35":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","displaytype":"detail","filename":"2002-37-23-133_地域結合.pdf","filesize":[{"value":"589.4 KB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://kit.repo.nii.ac.jp/record/2000495/files/2002-37-23-133_地域結合.pdf"},"version_id":"cc211939-fdd6-4257-93f4-464f94ab9ffd"}]},"item_30002_language12":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_30002_page_end28":{"attribute_name":"Page End","attribute_value_mlt":[{"subitem_end_page":"138"}]},"item_30002_page_start27":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"133"}]},"item_30002_publisher10":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_publisher":"日本都市計画学会","subitem_publisher_language":"ja"}]},"item_30002_resource_type13":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_30002_rights6":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_rights":"本著作物の著作権は（社）日本都市計画学会に帰属します。","subitem_rights_language":"ja"}]},"item_30002_source_title23":{"attribute_name":"Source Title","attribute_value_mlt":[{"subitem_source_title":"都市計画学会論文集「学術研究論文発表会論文」","subitem_source_title_language":"ja"}]},"item_30002_subject8":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"Random-graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Connectivity","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Threshold-function","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"nlogn","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Network-facilities","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"ランダムグラフ理論","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"結合度","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"閾値関数","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"線的施設","subitem_subject_language":"ja","subitem_subject_scheme":"Other"}]},"item_30002_title0":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"地域結合過程における　ｎlogｎ　の意味について","subitem_title_language":"ja"}]},"item_30002_version_type15":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_30002_volume_number24":{"attribute_name":"Volume Number","attribute_value_mlt":[{"subitem_volume":"37"}]},"item_title":"地域結合過程における　ｎlogｎ　の意味について","item_type_id":"40001","owner":"13","path":["1753928025029"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2009-08-19"},"publish_date":"2009-08-19","publish_status":"0","recid":"2000495","relation_version_is_last":true,"title":["地域結合過程における　ｎlogｎ　の意味について"],"weko_creator_id":"13","weko_shared_id":-1},"updated":"2026-01-23T03:15:36.575863+00:00"}