Computation non-intensive estimation algorithm for counting cycles in random networks
Ibrahim Sorkhoh, Khaled A. Mahdi, Maytham H. Safar · 2010
We modify the statistical mechanical based Belief Propagation (BP) algorithm to compute cycles in random networks using a phenomenological Gaussian distribution of cycles. The modified BP algorithm tested over any random network improves cycles computational time. CPU time is reduced up to 60% compared to the original BP algorithm.