WEKO3
アイテム
{"_buckets": {"deposit": "52b154f7-78f2-4b01-afae-f8d6bf50afbc"}, "_deposit": {"created_by": 3, "id": "6087", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "6087"}, "status": "published"}, "_oai": {"id": "oai:nitech.repo.nii.ac.jp:00006087", "sets": ["31"]}, "author_link": ["8695", "22069"], "item_10001_biblio_info_28": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2014-12-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "12", "bibliographicPageEnd": "2324", "bibliographicPageStart": "2317", "bibliographicVolumeNumber": "97", "bibliographic_titles": [{"bibliographic_title": "IEICE transactions on fundamentals of electronics, communications and computer sciences"}]}]}, "item_10001_description_36": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "The capacity (i.e., maximum flow) of a unicast network is known to be equal to the minimum \u003ci\u003es-t\u003c/i\u003e cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not so trivial to predict statistical properties on the maximum flow of the network. In this paper, we present a probabilistic analysis for evaluating the accumulate distribution of the minimum \u003ci\u003es-t\u003c/i\u003e cut capacity on random graphs. The graph ensemble treated in this paper consists of undirected graphs with arbitrary specified degree distribution. The main contribution of our work is a lower bound for the accumulate distribution of the minimum \u003ci\u003es-t\u003c/i\u003e cut capacity. The feature of our approach is to utilize the correspondence between the cut space of an undirected graph and a binary LDGM (low-density generator-matrix) code. From some computer experiments, it is observed that the lower bound derived here reflects the actual statistical behavior of the minimum \u003ci\u003es-t\u003c/i\u003e cut capacity of random graphs with specified degrees.", "subitem_description_type": "Other"}]}, "item_10001_description_38": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_10001_full_name_27": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "8695", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000020275374", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "http://rns.nii.ac.jp/nr/1000020275374"}], "names": [{"name": "和田山, 正"}]}]}, "item_10001_publisher_29": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers"}]}, "item_10001_relation_34": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "10.1587/transfun.E97.A.2317"}], "subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://doi.org/10.1587/transfun.E97.A.2317", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_35": {"attribute_name": "論文ID(NAID)", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "130004706390"}], "subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://ci.nii.ac.jp/naid/130004706390", "subitem_relation_type_select": "NAID"}}]}, "item_10001_relation_37": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "http://www.ieice.org/jpn/books/transaction.html"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/books/transaction.html", "subitem_relation_type_select": "URI"}}]}, "item_10001_source_id_30": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09168508", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_source_id_32": {"attribute_name": "書誌レコードID(NCID)", "attribute_value_mlt": [{"subitem_source_identifier": "AA11510296", "subitem_source_identifier_type": "NCID"}]}, "item_10001_version_type_33": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Fujii, Yuki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "22069", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Wadayama, Tadashi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "8695", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000020275374", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "http://rns.nii.ac.jp/nr/1000020275374"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2017-07-28"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "WadayamaTadashi_2014_P2.pdf", "filesize": [{"value": "586.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensefree": "copyright(C)2014 IEICE", "licensetype": "license_free", "mimetype": "application/pdf", "size": 586500.0, "url": {"label": "本文_fulltext", "url": "https://nitech.repo.nii.ac.jp/record/6087/files/WadayamaTadashi_2014_P2.pdf"}, "version_id": "a592bc08-1048-42ed-880c-e21ae4649f21"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "minimum cut", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "random graphs", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "LDGM code", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "3", "path": ["31"], "permalink_uri": "https://nitech.repo.nii.ac.jp/records/6087", "pubdate": {"attribute_name": "公開日", "attribute_value": "2017-07-28"}, "publish_date": "2017-07-28", "publish_status": "0", "recid": "6087", "relation": {}, "relation_version_is_last": true, "title": ["Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution"], "weko_shared_id": 3}
Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution
https://nitech.repo.nii.ac.jp/records/6087
https://nitech.repo.nii.ac.jp/records/60879a794b47-deed-4293-95e5-2060e5daa93c
名前 / ファイル | ライセンス | アクション |
---|---|---|
本文_fulltext (586.5 kB)
|
copyright(C)2014 IEICE
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2017-07-28 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Probabilistic Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | minimum cut | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | random graphs | |||||
キーワード | ||||||
言語 | en | |||||
主題Scheme | Other | |||||
主題 | LDGM code | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
Fujii, Yuki
× Fujii, Yuki× Wadayama, Tadashi |
|||||
著者別名 | ||||||
姓名 | 和田山, 正 | |||||
書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 97, 号 12, p. 2317-2324, 発行日 2014-12-01 |
|||||
出版者 | ||||||
出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168508 | |||||
書誌レコードID(NCID) | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA11510296 | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | http://doi.org/10.1587/transfun.E97.A.2317 | |||||
関連名称 | 10.1587/transfun.E97.A.2317 | |||||
論文ID(NAID) | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | NAID | |||||
関連識別子 | http://ci.nii.ac.jp/naid/130004706390 | |||||
関連名称 | 130004706390 | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | The capacity (i.e., maximum flow) of a unicast network is known to be equal to the minimum <i>s-t</i> cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not so trivial to predict statistical properties on the maximum flow of the network. In this paper, we present a probabilistic analysis for evaluating the accumulate distribution of the minimum <i>s-t</i> cut capacity on random graphs. The graph ensemble treated in this paper consists of undirected graphs with arbitrary specified degree distribution. The main contribution of our work is a lower bound for the accumulate distribution of the minimum <i>s-t</i> cut capacity. The feature of our approach is to utilize the correspondence between the cut space of an undirected graph and a binary LDGM (low-density generator-matrix) code. From some computer experiments, it is observed that the lower bound derived here reflects the actual statistical behavior of the minimum <i>s-t</i> cut capacity of random graphs with specified degrees. | |||||
関連サイト | ||||||
識別子タイプ | URI | |||||
関連識別子 | http://www.ieice.org/jpn/books/transaction.html | |||||
関連名称 | http://www.ieice.org/jpn/books/transaction.html | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf |