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

Authors:
Ibrahim Sorkhoh;Khaled Mahdi;Maytham Safar
Affiliations:
-;-;-
Venue:
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Year:
2012

Citing 3
Cited 0

Enumeration of the Elementary Circuits of a Directed Graph

Enumeration of the Elementary Circuits of a Directed Graph
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
Computation non-intensive estimation algorithm for counting cycles in random networks

Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computation capability of the BP cycles counting algorithm in random networks by estimating the required convergence error to find the maximum number of points in the cycles distribution which helps to interpolate accurately the cycles counts for different sizes. The algorithm shows that the convergence error required to get all possible points is almost constant through all possible connection probability values. The number of points possible can not reach the maximum even with high convergence error values.