47 citations · 50 across the 3 of their papers we have counts for
3 papers
cond-mat.stat-mech1997★ 47 cited
Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches
F. Babalievski
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen-Kopelman multiple labeling technique for cluster statistics is red…
cond-mat.stat-mech1997
Comment on "Universal formulas for percolation thresholds. II. Extension to anisotropic and aperiodic lattices"
F. Babalievski
Recently S.Galam and A.Mauger [Phys.Rev.E 56, 322 (1997); cond-mat/9706304 ] proposed an approximant which relates the bond and the site percolation threshold for a particular latt…
cond-mat.stat-mech1997★ 3 cited
Rigidity percolation on aperiodic lattices
A. Losev, F. Babalievski
We studied the rigidity percolation (RP) model for aperiodic (quasi-crystal) lattices. The RP thresholds (for bond dilution) were obtained for several aperiodic lattices via comput…