Abstract – Many problems of practical interest can be represented by graphs, in fact the World Wide Web is an example of directed graph. Graph theory is a burgeoning field being subjected to considerable active research, especially in the study of random graphs. Since the problem involves random graphs and random walks, certain bounds have to be set to acc
ommodate the finitely true theoretical results. This project is aimed at building a system to provide a framework for exploring random walks on graphs. The existing theorems are verified and an
attempt is made to find limiting constraints as well as new results. The approach involves generation of graphs randomly, simulating random traversal on them and
analysing the data obtained for verification with the theoretical results. The simulation is done using Omnetpp.
Post a Comment