{"created":"2022-01-24T13:19:20.721560+00:00","id":2000879,"links":{},"metadata":{"_buckets":{"deposit":"c86b5cc7-232f-4a41-9dc3-abba14fc6f29"},"_deposit":{"id":"2000879","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"2000879"},"status":"published"},"_oai":{"id":"oai:u-ryukyu.repo.nii.ac.jp:02000879","sets":["1642838163960:1642838338003","1642838403551:1642838405037"]},"author_link":[],"control_number":"2000879","item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"The length of the shortest edge of a graph on a sphere","subitem_1551255648112":"en"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Maehara, Hiroshi","creatorNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_1522299639480":"open access","subitem_1600958577026":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"Let $S^d$ denote a unit sphere in the $(d+1)$-dimensional Euclidean space $\\bold R^{d+1} (d\\geq 1)$. For a simple graph $G_{\\scr E}$ with edge set $\\scr E$, take independent random points $x_k, k\\in V(G_{\\scr E})$, on $S^d$, and let $D_{\\scr E}$ be the minimum value of the spherical distance between $x_i,x_j$ for $\\{i,j\\}\\in\\scr E$. We prove that $","subitem_description_type":"Other"},{"subitem_description":"\\scr E","subitem_description_type":"Other"},{"subitem_description":"D^d_{\\scr E}$ is asymptotically (as $","subitem_description_type":"Other"},{"subitem_description":"\\scr E","subitem_description_type":"Other"},{"subitem_description":"\\to\\infty$) distributed to the exponential distribution with mean $dB(\\frac 12,\\frac d2)$, where $B(p,q)$ is the beta function.","subitem_description_type":"Other"},{"subitem_description":"論文","subitem_description_type":"Other"}]},"item_1617186643794":{"attribute_name":"Publisher","attribute_value_mlt":[{"subitem_1522300295150":"en","subitem_1522300316516":"Elsevier Science B.V."}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_1551255818386":"eng"}]},"item_1617186783814":{"attribute_name":"Identifier","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/20.500.12000/152"}]},"item_1617186920753":{"attribute_name":"Source Identifier","attribute_value_mlt":[{"subitem_1522646500366":"ISSN","subitem_1522646572813":"01956698"},{"subitem_1522646500366":"NCID","subitem_1522646572813":"AA00695859"}]},"item_1617186941041":{"attribute_name":"Source Title","attribute_value_mlt":[{"subitem_1522650068558":"en","subitem_1522650091861":"European Journal of Combinatorics"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicPageEnd":"717","bibliographicPageStart":"713","bibliographicVolumeNumber":"23"}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_1522305645492":"AM","subitem_1600292170262":"http://purl.org/coar/version/c_ab4af688f83e57aa"}]},"item_1617353299429":{"attribute_name":"Relation","attribute_value_mlt":[{"subitem_1522306287251":{"subitem_1522306382014":"URI","subitem_1522306436033":"http://www.sciencedirect.com/science/journal/01956698"}},{"subitem_1522306287251":{"subitem_1522306382014":"DOI","subitem_1522306436033":"10.1006/eujc.2002.0598"}}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","filename":"maehara_h02.pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://u-ryukyu.repo.nii.ac.jp/record/2000879/files/maehara_h02.pdf"},"version_id":"ef9392a5-1a7e-4598-9d99-65b5aa39d04c"}]},"item_title":"The length of the shortest edge of a graph on a sphere","item_type_id":"15","owner":"1","path":["1642838338003","1642838405037"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-03-01"},"publish_date":"2007-03-01","publish_status":"0","recid":"2000879","relation_version_is_last":true,"title":["The length of the shortest edge of a graph on a sphere"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-08-03T05:37:57.233427+00:00"}