Simulation of content networks
DOI:
https://doi.org/10.18372/2073-4751.1.7259Abstract
The analysis of complex networks and their basic model. Proposed model of the content network, which contains one essential pіdgonku - a prior assumption of power-degree distribution of nodesReferences
Newman M.E.J. The structure and function of complex networks // SIAM Rev. – 2003. – 45. – P. 167-256.
Dorogovtsev S.N., Mendes J.F.F. Evolution of networks: from biological networks to the Internet and WWW. – Oxford University Press, 2003. – P. 180-182.
Watts D.J., Strogatz S.H. Collective dynamics of «smallworld» networks // Nature.— 1998. – 393. – P. 440-442.
Zhou S., Mondragon R.J. The rich-club phenomenon in the internet topology // Commun. Lett. IEEE. – 2004. – 8. – P. 180-182.
Newman M.E.J. Assortative mixing in networks // Phys. Rev. Lett. – 2002. – 89 (208701).
Barabasi A., Albert R. Emergence of scaling in random networks // Science.– 1997. – 286. – P. 509-512.
Broder A., Kumar R., Maghoul F., Raghavan P., Rajagopalan S., Stata R., Tomkins A., Wiener J. Graph structure in the web // Computer Networks, 2000. – 33. P 309–320.
Albert R., Jeong H., Barabasi A.-L. Diameter of the world wide web // Nature (London). – 1999. – Р. 401, 130.
Пасічник В.В., Іванущак Н.М. Дослідження та моделювання складних мереж // Східно-Європейський журнал передових технологій. – 2010. – 2/3 (44). – С. 43-48.
Головач Ю., Пальчиков В. Лис Микита і мережі мови // Журн. Фіз. Досл., 2006. – 10. – С. 247-291.
Ferrer-i-Cancho, R., Sole R.V. The small world of human language // Proc. R. Soc. Lond., 2001. – B 268. – Р. 2261-2265.
Dorogovtsev S.N., Mendes J. F. F. Language as an evolving word web // Proc. R. Soc. Lond., 2001. – B 268. – Р. 2603.
Caldeira S. M. G., Petit Lobao T. C., Andrade R. F. S., Neme A., Miranda J. G. V. The network of concepts in written texts // Preprint physics/0508066 (2005).
Ferrer-i-Cancho R., Sole R.V., Kohler R. Patterns in syntactic dependency networks // hys. Rev., 2004. – E 69. – Р. 051915.
Ferrer-i-Cancho, R. The variation of Zipf's law in human language. // Phys. Rev., 2005. – E 70. – Р. 056135.
Motter A. E., de Moura A. P. S., Lai Y.-C., Dasgupta P. Topology of the conceptual network of language // Phys. Rev., 2002. – E 65. – Р. 065102(R).
Sigman M., Cecchi G A. Global Properties of the Wordnet Lexicon // Proc. Natl. Acad. Sci. USA, 2002. – 99. – Р. 1742.
Erdős P., Rényi A. The Evolution of Random Graphs // Magyar Tud. Akad. Mat. Kutató Int. Közl., 1960. – 5. – Р. 17–61.
Milgram S. The small world problem // Psychology Today. – 1967. – 2. – P. 60-67.
Watts D.J., Strogatz S.H. Collective dynamics of «smallworld» networks // Nature. – 1998. – 393. – P. 440-442.
Albert R., Barabási A.-L. Statistical mechanics of complex networks // Review of Modern Physics, 2002. – 74. – P. 47-97.
Bekessy A., Bekessy P., Komlos J. Asymptotic enumeration of regular matrices // Studia Scientiarum Mathematicarum Hungarica. – 1972. – 7. – P. 343–353.
Bender E.A., Canfield E.R. The asymptotic number of labeled graphs with given degree sequences // Journal of Combinatorial Theory A. – 1978. – 24. – P. 296–307.
Molloy M., Reed B. A critical point for random graphs with a given degree sequence // Random Structures Algorithms. – 1995. – 6. – P. 161–179.
Емеличев В.А., Мельников О.И., Сарванов В.И. и др. Лекции по теории графов. – М.: Наука, 1990. – 384 с.
Иванов С.В., Колыхматов И.И., Бухановский А.В. Параллельные алгоритмы моделирования комплексных сетей // Известия высших учебных заведений. Приборостроение. – № 10. – 2008. – C. 5-12.
Blitzstein J. K., Diaconis P. A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees // Preprint. Internet Mathematics. – Vol. 6, Issue 4, 2011. – P. 489-522.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.
