Computation non-intensive estimation algorithm for counting cycles in random networks

Authors:
Ibrahim Sorkhoh;Khaled Mahdi;Maytham Safar
Affiliations:
Kuwait University, Safat;Kuwait University, Safat;Kuwait University, Safat
Venue:
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Year:
2010

Citing 3
Cited 2

Understanding belief propagation and its generalizations

Exploring artificial intelligence in the new millennium
A new way to enumerate cycles in graph

AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Analysis of temporal evolution of social networks

Journal of Mobile Multimedia

The Limitations of the BP Algorithm for Counting Cycles in Random Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Cyclic Entropy of Complex Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.