In this work, we are studying web searching methods. The methods we studied are based on finding the eigenvector of a matrix. In chapter one we presented the power method, which is the starting point for all the three presented web searching methods. Chapter one also considers Perron-Frobenius theory and gives the Perron-Frobenius theorem which is the main factor in discussing uniqueness of the solution provided by the web searching methods. The following three chapters present each of the studied methods. Chapter two describes the HITS method which defines so called hubs and authorities. We also defined the adjacency matrix which is used for acquiring page ranking in searching the web, by using the power method. Chapter three portrays the PageRank method. The method assigns a PageRank score for every page which serves as a measurement of relativity. The basis of the PageRank method is the idea that links with higher relativity pages carry more weight than those less relevant. This chapter also provides the Markov web model which shows the direct link between the Google matrix’s PageRank and the transition matrix of a Markov chain. Chapter four introduces the SALSA method which tries to hold advantages of both the HITS method and the PageRank method while combining the two. The SALSA method is based on building the bipartite undirected graph which is used for building two Markov chains. Using the transition matrices of the two Markov chains and the power method, we can get the page ranking for the requested searching of the web. Every chapter provides information about the method’s convergence, strengths, and faults, as well as a simple example that displays how does the method work. The final chapter offers a further example of all the methods combined. We concluded that the SALSA method achieved to fix the main disadvantages of the HITS method. Nevertheless, the dual ranking of the SALSA method is much less enough of an advantage to the PageRank method which exceeds in every other segment. This work concludes in a final discussion of the methods resilience to spamming which shows the HITS method’s and the SALSA method’s resilience to spamming. The final example of this work shows that the PageRank method isn’t resilient to special versions of spamming.