4 citations · 6 across the 3 of their papers we have counts for
3 papers
math.PR2014
Weights of Cliques in a Random Graph Model Based on Three-Interactions
István Fazekas, Csaba Noszály, Attila Perecsényi
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 asymptoti…
math.PR2014★ 4 cited
On a General Approach to the Strong Laws of Large Numbers
István Fazekas
A general method to obtain strong laws of large numbers is studied. The method is based on abstract Hájek-Rényi type maximal inequalities. The rate of convergence in the law of lar…
math.PR2014★ 2 cited
The asymptotic behaviour of the weights and the degrees in an N-interactions random graph model
István Fazekas, Bettina Porvázsnyik
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are all…