| Presentation | 2018-10-26 Hyperfiniteness of hieralchical models for complex networks Kazuki Higashizono, Hiro Ito, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Big networks such as the WWW and the protein-protein interaction network (PIN) are called complex networks. Some common properties have been found among complex networks. Many models that produce networks having such properties have been proposed, e.g., Watts-Strogatz model achieves the small-world property, and Barabasi-Albert model achieves the scale-free property. However, the properties of complex networks are not revealed completely yet, and hence many new models that sutisfy such properties are still being proposed for interpreting complex networks. One of the attentional properties that complex networks may have is hyperfiniteness. In 2005, Newman and Sohler presented a universal tester, which can test any property, for bounded-degree hyperfinite graphs. It is important to make clear which model of complex networks satisfy hyperfiniteness. In this report, we prove that the three well-known models that have hierarchy proposed by Dorogovtsev, Barabasi, and Ravasz are hyperfinite. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | complex networks / hyperfinite / constant-time algorithms |
| Paper # | COMP2018-24 |
| Date of Issue | 2018-10-19 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2018/10/26(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyoto University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
| Vice Chair | Shinichi Nakano(Gunma Univ.) |
| Secretary | Shinichi Nakano(Kyoto Univ.) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Hyperfiniteness of hieralchical models for complex networks |
| Sub Title (in English) | |
| Keyword(1) | complex networks |
| Keyword(2) | hyperfinite |
| Keyword(3) | constant-time algorithms |
| 1st Author's Name | Kazuki Higashizono |
| 1st Author's Affiliation | The University of Electro-Communications(UEC) |
| 2nd Author's Name | Hiro Ito |
| 2nd Author's Affiliation | The University of Electro-Communications(UEC) |
| Date | 2018-10-26 |
| Paper # | COMP2018-24 |
| Volume (vol) | vol.118 |
| Number (no) | COMP-268 |
| Page | pp.pp.25-31(COMP), |
| #Pages | 7 |
| Date of Issue | 2018-10-19 (COMP) |