Motif based hierarchical random graphs: structural properties and critical points of an Ising model

A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824 – 827]. The construction scheme resembles that used in [Hinczewsk...

Повний опис

Збережено в:
Бібліографічні деталі
Дата:2011
Автори: Kotorowicz, Monika, Kozitsky, Yuri
Формат: Стаття
Мова:English
Опубліковано: Інститут фізики конденсованих систем НАН України 2011
Назва видання:Condensed Matter Physics
Онлайн доступ:http://dspace.nbuv.gov.ua/handle/123456789/119972
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати:Motif based hierarchical random graphs: structural properties and critical points of an Ising model / Monika Kotorowicz, Yuri Kozitsky // Condensed Matter Physics. — 2011. — Т. 14, № 1. — С. 13801: 1-18. — Бібліогр.: 30 назв. — англ.

Репозиторії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
Опис
Резюме:A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824 – 827]. The construction scheme resembles that used in [Hinczewski M., A. Nihat Berker, Phys. Rev. E, 2006, 73, 066126], according to which the short-range bonds are non-random, whereas the long-range bonds appear independently with the same probability. A number of structural properties of the graphs have been described, among which there are degree distributions, clustering, amenability, small-world property. For one of the motifs, the critical point of the Ising model defined on the corresponding graph has been studied.