Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Perecsényi, Attila"'
A new network evolution model is introduced in this paper. The model is based on co-operations of $N$ units. The units are the nodes of the network and the co-operations are indicated by directed links. At each evolution step $N$ units co-operate whi
Externí odkaz:
http://arxiv.org/abs/1905.12449
A random graph evolution rule is considered. The graph evolution is based on interactions of three vertices. The weight of a clique is the number of its interactions. The asymptotic behaviour of the weights is described. It is known that the weight d
Externí odkaz:
http://arxiv.org/abs/1412.6746
Publikováno v:
Journal of Applied Probability, 2019 Jun 01. 56(2), 416-440.
Externí odkaz:
https://www.jstor.org/stable/45277585
Autor:
Fazekas, István1 fazekas.istvan@inf.unideb.hu, Perecsényi, Attila1 perecsenyi.attila@inf.unideb.hu
Publikováno v:
Annales Mathematicae et Informaticae. 2018, Vol. 48, p15-22. 8p.
Autor:
Fazekas, István, Perecsényi, Attila
Publikováno v:
XXX. microCAD International Multidisciplinary Scientific Conference; 2016, p1-4, 4p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fazekas, István, Perecsényi, Attila
A new modification of the N interaction model [5], which based on the 3-interactions model of Backhausz-Móri [1]. This is a growing model, what evolves by weights. In every step N verticies will interact by form a star graph. We can choose vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3812::98b22cfda3339cb7f1c2fc2e9533cf47
http://publikacio.uni-eszterhazy.hu/3309/
http://publikacio.uni-eszterhazy.hu/3309/