| Presentation | 2017-10-06 Derivation of Global Clustering Coefficient Maximizing Graphs in the Case Where the Size is Close to the Order Ryoka Kuriki, Norikazu Takahashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The clustering coefficient is a measure of the tendency of vertices in a network to form clusters. It is known that many networks in the real world have higher clustering coefficients than random networks. However, in order to evaluate how high the clustering coefficient of the network under consideration, we need to find a graph that maximizes the clustering coefficient among all graphs with the same scale as the network, and compare these two values. In this report, we consider the problem of finding a graph that maximizes the global clustering coefficient among all graphs with the given size and order, and give solutions for the case where the size is less than or equal to the order plus four. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | network science / graph theory / global clustering coefficient / maximization |
| Paper # | CAS2017-37,NLP2017-62 |
| Date of Issue | 2017-09-28 (CAS, NLP) |
| Conference Information | |
| Committee | NLP / CAS |
|---|---|
| Conference Date | 2017/10/5(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Machinaka Campus Nagaoka |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | etc. |
| Chair | Masaharu Adachi(Tokyo Denki Univ.) / Mitsuru Hiraki(Renesas) |
| Vice Chair | Norikazu Takahashi(Okayama Univ.) / Hideaki Okazaki(Shonan Inst. of Tech.) |
| Secretary | Norikazu Takahashi(Nagaoka Univ. of Tech.) / Hideaki Okazaki(Hiroshima Inst. of Tech.) |
| Assistant | Toshihiro Tachibana(Shonan Inst. of Tech.) / Masayuki Kimura(Kyoto Univ.) / Yohei Nakamura(Hitachi) |
| Paper Information | |
| Registration To | Technical Committee on Nonlinear Problems / Technical Committee on Circuits and Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Derivation of Global Clustering Coefficient Maximizing Graphs in the Case Where the Size is Close to the Order |
| Sub Title (in English) | |
| Keyword(1) | network science |
| Keyword(2) | graph theory |
| Keyword(3) | global clustering coefficient |
| Keyword(4) | maximization |
| 1st Author's Name | Ryoka Kuriki |
| 1st Author's Affiliation | Okayama University(Okayama Univ.) |
| 2nd Author's Name | Norikazu Takahashi |
| 2nd Author's Affiliation | Okayama University(Okayama Univ.) |
| Date | 2017-10-06 |
| Paper # | CAS2017-37,NLP2017-62 |
| Volume (vol) | vol.117 |
| Number (no) | CAS-225,NLP-226 |
| Page | pp.pp.69-74(CAS), pp.69-74(NLP), |
| #Pages | 6 |
| Date of Issue | 2017-09-28 (CAS, NLP) |