Thursday, 7 February 2013

Surfendipity



Let's start with a question. How would you order all websites in order of importance? You could order by most popular, most informative or most authoritative.

None of those are truly satisfactory because the question is subjective. It depends on who is asked. For example I would rank technical, comedy and competitive gaming sites highly conversely fashion, gossip and liberal arts sites would rank extremely low. Yet incomprehensible many (majority?) people think the opposite.

So we alter a websites rank depending on the viewer. This is what Google does now but originally googled ranked websites using the PageRank algorithm (named after one of the founders Larry Page). The algorithm takes an objective approach to solving the problem.

Figure 1. Random surfer

We have all been there, you go on the web with a specific purpose and then through a magical Intertubes journey you end up somewhere totally unpredictable. For example I started today searching for the relationship between static code analysis and the halting problem, and I hate to admit ended up on youtube...

Jeez Louise what on earth does that anecdote have to do with PageRank? Its a nice analogy of how PageRank works. Given a user (for example a monkey) that surfs the web by randomly clicking links. The PageRank of a website is the probability of that user landing on the site after a significant number of clicks. This is illustrated in Figure 2.

Figure 2. Graph with PageRank values.

So you can think of hyper-links as the source website vouching for the destination website. This explains why website B in Figure 2 is ranked so highly because many sites link to it. In contrast site C is ranked highly even though it has only one incoming link. The reason being its got an incoming link from the big dogg B. Since its likely to land on B it is also likely to land on C.

“Its not what you know or who you know – its who knows you.”

Ok that makes sense and if you're like me you must be wondering how on Gods green earth do you calculate those probabilities? That is what the rest of the article is about. First we need Markov chain models. These model the movement through a stochastic state machines. These are just state machines with transitions based on probabilities like so:


Figure 3. Directed graph to illustrated state transitions

So just to clarify we can move from state A to B with probability of 0.5 and from B to C with 1.0 and so on so forth.

The Markov chain is just a sequence of random variables ( X1, X2, … Xn ) that represent a single state. So you can imagine just walking along the graph. So let's say we start at state A. Then the random variable X1 represents our first step so it is

P( X1 = A ) = 0.0
P( X1 = B ) = 0.5
P( X1= C ) = 0.5

The most important feature of the Markov chain is that the transitions probabilities do not depend on the past. In this article we assume the transitions are constant throughout. So it doesn't matter at all what ridiculous journey you took to get to a state. To predicate the future all you need is the current state and the transitions. So just to reiterate the past is irrelevant on Markov chains.

Right let's represent the state transitions using a transition matrix T . Since the transitions are probabilities we call it a stochastic matrix (technically the total probability of moving from one state to the others is 1 so the rows sum to 1).

So the entry at row i and column j represents the probability of moving from state i to state j. For example T23 is the probability of moving from state B to state C i.e. 1.0.

Why did we bother converting the graph to a matrix. Well it turns out it has a few neat properties. Let's say we started at state A and I asked you what's the probability of moving to state C in two steps?

To answer assume the following notation P(IJ) means the probability of moving from state I to state J in one step (just look up the matrix). So for example P(AB) = 0.5. So the probability of going from A to C in two steps is the probability of going from A to every state (A, B, C) then the probability of going from that state to C. i.e.

Notice that this corresponds to the entry T2AC. If you try it out for the rest of the entries it turns out that the product of the transition matrix is the probabilities of going from the row to the column in 2 steps. That is T2ij the probability of going from state i to state j in two steps. If you multiply that by the transition matrix you get the state transitions for 3 steps. So it turns out that Tn is the state transitions for n steps. Really neat huh? I thought so anyway.

Ok let's multiply our transition matrix so we can see the probabilities for two, three, four, five, twenty and one hundred steps:


Something very interesting happens. The entries seem to converge until all the columns values become equivalent. This means that after a certain number of steps it doesn't matter which state you started on. The probability of getting to another state is constant. My mind = blown. So let's try visualise this:


Figure 4. State with converged population distribution.


So let's say we start with a 100 people. Let's use the values of the converged matrix to place people on the graph. So let's put 40% of them on A and another 40% on C. The last 20% can go on B. So move forward one step in the Markov chain.

Half of A will go to B and the other half will go to C. So the new B will have 20% of people. The new C has 20% and the rest of the people from old B which is also 20% therefore the new C has 40%. Finally new state A has all the people from old state C i.e. 40%. Whad'ya know? We are back where we started. So this shows the steady state that the Markov chain converges on. Once we get into this distribution we stay there forever.

So if the small graph used in the example actually represented three websites and the related hyper-links. Then the stabilised values (i.e. the probabilities for each column in converged matrix) represent the PageRank of each website. Sweet!

This blog is already long enough so I'm going to skip over the intuitive proof of convergence. Although Ive put that in the appendix A. I'll just show how we can use the transition matrix to calculate the PageRank.

If we represent the initial distribution (for example of people) using a vector e.g.


That means ¼ of people are in state A and another ¼ in B and the rest ( ½) are in C. If we multiply the transition matrix with the vector. We will get a new vector representing the distribution after the first step. By the same token if we multiply it by an n step transition matrix then the result is the distribution after n steps. So written mathematically, given a transition matrix T, a source distribution s (represented as a row vector) we can calculate the resulting distribution r after n steps using:

r = s . Tn

So we have two very similar concepts but they are not equivalent.
  1. After a number of steps the probability of getting to a state is constant regardless of where you start. So no matter what initial distribution you start with you will end up with stable distribution.
  2. If you apply a single state transition on the stable distribution you will get the stable distribution.

Let's go through both these points in order. To illustrate point 1 let's pick any random distribution and multiply it with the stable matrix (the converged matrix). So let's say we have 0.3, 0.3 and 0.4 in states A,B and C respectively. Represent it as a row vector and multiply with the converged matrix:


Notice the result distribution is the stable distribution. So intuitively what does this mean? It just means that given the initial distribution and taking it through a significant number of steps we will eventually end up at the stable distribution.

The stable distribution is interesting because once you're in it you remain in that distribution forever . This just a rewording of point 2. So let's illustrate this by multiplying the stable distribution with the initial transition matrix:



Notice we get the stable distribution again. That makes sense because the definition of the stable distribution is one that doesn't change when transitioned. If you try any other distribution on the transition matrix you will not get the same result.

So if you recall from linear algebra an eigenvector is a vector that is only scaled when transformed by a matrix. That is, given a matrix T, a vector s (called eigenvector) and a scalar lambda (called eigenvalue) we have


This looks very similar to our answer above. Except we have a value of lambda as 1 and we are using a row vector (we could change that by transposing both). So it turns out that the stable distribution is the eigenvector of the transition matrix with an eigenvalue of 1.

So moving back to our PageRank algorithm where the transition matrix is a representation of the web and the stable distribution is the PageRank of websites. We can say the PageRank is the eigenvector of the stochastic matrix representing the topology of hyper-links. Wow! that sounds complicated but hopefully we now understand what that means.

Let's generate the algorithm. So our input is the stochastic transition matrix representing the Web. We want the stable distribution (i.e. the eigenvector). Remember a multiplication of any distribution with the convergence matrix will be that stable distribution / eigenvector. So all we have to do is multiply any distribution with our convergent matrix to get the answer.

So the problem reduces to finding the convergent matrix. Well we know to do that we just need to multiply repetitively (take to the exponent) the transition matrix until it converges. So let x be our initial distribution. Just set it to 1/n where n is the number of components in the vector (i.e. websites). And we have the following formula to calculate the eigenvector: 


Huh? bear with me. Let's expand this out:


So by doing it in this order we can skip a few operations. We can do vector-matrix product instead of matrix-matrix product which has far fewer operations. So the last and final question is when do we stop? when we hit the stable distribution (eigenvector). That is when: 


So let's convert this into a floating point friendly algorithm:
 /* Inputs are  
 * n = number of websites   
 * T = is a n x n transition matrix  
 */  
 vector x = { 1/n, 1/n, ..., 1/n }    // initial distribution  
 do {  
    old = x   
    x = x * T  
    delta = | x - old |  
 } while( delta > EPISILON );  

So once the algorithm is complete, x will be the stable distribution, eigenvector and the PageRank of the web.

So its been a pretty lengthy article for such little code. Always the way with Maths heavy algorithms. For more information on PageRank read "The PageRank Citation Ranking: Bringing Order to the Web" and on Markov chains I highly recommend "Finite Markov Chains and Algorithmic Applications" by Olle Häggström.

So Appendix A has a high-level explanation for convergence. Then Appendix A shows how Google converts the web graph into a Google matrix so that it has a convergent property.

Right I applied the algorithm to the request for comments (RFC) and used citations as links/edges. The PageRank of all RFCs (at the time of writing) in descending order:

https://github.com/iainkfraser/PageRank/blob/master/rfc_pagerank_with_titles.txt

That's all folks - PEACE!


Appendix A - Convergence

I'm going to very briefly describe state transition restrictions that allow convergence. Then i'll explain intuitively why convergence occurs. If you want to learn more about Markov Chains in more detail then refer to a book, it's a subject in its own right.

Theroem: Any irreducible and aperiodic Markov chain has exactly one stationary distribution. 

Before I explain irreducible and aperiodic let me say the converse isn't true. Not being irreducible and aperiodic does not mean there isn't a stationary distribution it just means there may not be. So irreducible and aperiodic chains are interesting because we are guaranteed to have stationary distribution (and therefore a PageRank).

An irreducible graph means there is always a way to get from one state to another eventually. If you can't you call it reducible. Figure 5. has some example illustrations.


Figure 5. The two chains on the left are reducible and the one on the right is irreducible

By the way its called reducible because you can split into two or more separate graphs and model those using Markov chains. So its quite obvious there can't be a stationary distribution because remember the stationary distribution means: the probability of getting from any state to a certain state is constant. So clearly if you can't get to a state the probabilities can't be the same because some states can reach but other(s) cannot.
Figure 6. The two on the right are aperiodic and the left has a period of of 2.


Aperiodic is a bit more difficult to explain. So I'm going to explain it with an example, again read one of the Markov chains books for the formal definition (quickly its the greatest common divisor of the number of steps to get back to the same state).

So look at example  in Figure 6a. If you place all one hundred people on S1. Then if we do the next step they all move to S2  (so none on S1). Then they all move back to S1 and so on and so forth. So clearly its never going to converge because it oscillates. It has a period of 2, because getting back to state S1 takes a minimum of 2 steps.

Compare that with Figure 6c which is aperiodic. So S1 is trivial because we can get straight back to S1 in one step. But S2 we can get back in 2,3,4,5,7... steps. Why isn't that periodic? Let's run through an instance of a Markov chain. So all 100 people move from S2 to S1. Then 50 go back S2 and the other 50 stay on S1. Now look at this distribution (which originally started with 100 on s2) we can get back to S2 now in 1 step forever. Ergo its not periodic.

So let's get onto a intuitive description of the proof. If the graph is aperiodic and irreducible then eventually (after a number of steps) every value in the transition matrix will be between 0 and 1 exclusively (i.e. not 0 or 1). Because there is a way to get from any state to any other state.


Figure 7. Probability of moving to B in one step

So let's start thinking of a hypothetical graph shown in Figure 7. I was going to use variables for transition probability but I think numbers are simpler to understand. So if we were playing a game and wanted to get to B in one step we would start at C and if we didn't want to get to B we would start at A.  How about two steps? 


Figure 8. Probability of moving to B in two steps

So if I asked you to try get to B, what would you say? B->C->B right. Because we already know ending with C -> B is the optimum for one step. So we want the optimum something to C which is B. So the optimum odds of landing on B for 2 steps is 0.54. Notice that the odds are worse than just the single step.

Now if I asked you try to avoid getting to B in two steps what would you say? Well again we want to pick the most likely of landing on A->B (the least likely single step) so we would choose A->A->B which has overall odds of 0.18. Notice again these odds are greater (so in response to the question worst) than the single step.



Figure 9. Probability of A->B in three steps. Notice the minimum is increasing

This illustrates why convergence works. The maximum and minimum probabilities of getting to B will be in the first step. Because in the next step the probability of getting to the maximum step is not 1 so its going to lose a bit (to the other branches). And the probability of getting to the minimum step is also not 1 so we will gain a bit (by the other branches). 

Through induction (due to recursive nature of the steps) we can show that after each step the minimum will raise and the maximum will fall until they eventually converge. Therefore no matter where you start you have the same probability of getting to the destination (B in this case).

It should now make sense why you don't want 1 or 0 entries in the matrix forever. Because that means the maximum or minimum doesn't have to fall or raise and thus converge. 

Appendix B – Google Matrix

So we need the Markov chain to be irreducible and aperiodic to guarantee that there is a stable distribution (see Appendix 1). An easy way to do that is to have a link from every state to every other state.

So how can we transform the hyper-link graph into this type of graph. Because clearly every website doesn't link every other website. The way Google does it, is to imagine that the random surfer may get bored and when that happens they randomly teleport to random website.

So how do we apply this logic to the transition matrix? Well we need a probability of the user getting bored call d (for damping) which is usually set to 0.85 (the clever dudes at Google figured this number out). Then we can convert the transition matrix to:


So the dT just dampens all the links due to the chance of getting more bored. Then there is a chance of ( 1 – d ) divided by the number of sites of randomly teleporting to another site. So we need to add that to every entry in the matrix which is what eeT (generates a n x n matrix of all ones using outer product).



78 comments:

  1. Great job! If you're interested in a slightly more linear-algebra focused treatment (with proofs), you may want to check out my post on this subject.

    http://jeremykun.com/2011/06/18/googles-pagerank-a-first-attempt/

    ReplyDelete
  2. wow! really liked your articles. I recommend interested readers also check them out.

    When I get time ill check out the rest. I'm also interested in improving my Math-programming intersection.

    ReplyDelete
  3. Thank you for sharing useful information with us. please keep sharing like this. You might like the following article also please visit us.

    Female Freedom Fighters of India

    Women Freedom Fighters

    ReplyDelete
  4. The Best Varanasi Escorts that are Attractive and Delightful
    Varanasi's Escorts services have earned a lot of fame and recognition, which has made them a major source for entertainment. It's been the most enjoyable thing I've done so far. Many people long for these kinds of service ingredients all year.Call Us For hiring Varanasi Call girls.
    Varanasi Escorts

    ReplyDelete
  5. Hello There. I found your blog using msn. This is a really well written article. I will be sure to bookmark it and come back to read more of your useful info. Thanks for the post. I’ll definitely return. 야동

    ReplyDelete
  6. Enjoyed reading the article above , really explains everything in detail,the article is very interesting and effective.Thank you and good luck for the upcoming articles 대딸방.

    ReplyDelete
  7. I highly appreciate your hard-working skills as the post you published have some great information which is quite beneficial for me, I hope you will post more like that in the future. 마사지블루

    ReplyDelete
  8. This is really interesting, You’re a very skilled blogger. 건마탑

    ReplyDelete
  9. Udaipur Escorts & call girl known for their innocent behavior
    Our Udaipur Escorts will do precisely what you'll like . Make your day memorable by means of having intercourse with the girls of Udaipur Escorts at some point of lovely surroundings and first-rate surroundings. The girls in our Services are a long way greater, diligent and clearly honest than others.
    Udaipur Escorts
    Escorts in Udaipur

    ReplyDelete
  10. Thank you for sharing useful information with us. please keep sharing like this. Know about some such things related to

    history and health that you have rarely read.


    Nuclear war in ancient history

    Harald Bluetooth

    Ignaz Semmelweis

    Who was Typhoid Mary

    Worst Serial Killers in History

    ReplyDelete
  11. Great job for publishing such a beneficial web site
    온라인카지노

    ReplyDelete
  12. It’s so good and so awesome. I am just amazed. I hope that you continue to do your work like this in the future also.
    카지노사이트

    ReplyDelete
  13. Thank you for providing a good quality article.
    스포츠토토

    ReplyDelete
  14. Its an amazing website, I really enjoy reading your articles.
    바카라사이트

    ReplyDelete
  15. Whether you're looking for a spectacular new logo or some stunning flyers, the talented global community of designers at Promote Abhi can make it happen. Promoteabhi.com prides itself on it's high quality designers who deliver only the best graphic design services. Find the right design service for you below and get design you'll love today! Promote Abhi is one of the leading and passionate graphic design service providers in the online market.
    Matriculation is the formal process of entering a university, or of becoming eligible to enter by fulfilling certain academic requirements such as a matriculation examination. Matriculation means a process or the course is given for any examination. Whether the processor syllabus is for the 10th board examination
    Expert recommended Top 3 Interior Designers in Gorakhpur, Uttar Pradesh. All of our interior designers actually face a rigorous 50-Point Inspection, which includes customer reviews, history, complaints, ratings, satisfaction, trust, cost and their general excellence. You deserve only the best! All Gorakhpur, Uttar Pradesh interiors designers require specific schooling and formal training. They use their specialised knowledge of interior architecture!
    Real-time problems and outages for PlentyOfFish (POF). Can't log in? Is the server down? Here you see what is going on.

    ReplyDelete
  16. This website is one thing that is
    needed on the internet, someone with a bit of originality!
    토토
    경마사이트
    경마

    ReplyDelete
  17. So nice to find somebody with unique
    thoughts on this subject. Really.. many thanks
    for starting this up.
    바카라사이트
    토토사이트

    ReplyDelete
  18. I find reading this article a joy. It is extremely helpful and interesting and very much looking forward to reading more of your work
    스포츠토토

    ReplyDelete
  19. Hi there, You’ve done an incredible job. I’ll certainly digg it and in my view recommend to my friends. I am confident they’ll be benefited from this site. 경마사이트

    ReplyDelete

  20. This site seems to inspire me a lot. Thank you so much for organizing and providing this quality information in an easy to understand way. I think that a healthy era of big data can be maintained only when such high-quality information is continuously produced. And I, too, are working hard to organize and provide such high-quality information. It would be nice to come in once and get information.

    Also visit my site:파워볼

    ReplyDelete
  21. I could not resist commenting. Well written. There is certainly a lot to learn about this topic. I love all of the points you have made. 야한동영상

    Also feel free to visit may webpage check this link
    야설

    ReplyDelete
  22. You are so awesome! I don’t suppose I have read anything like this before. So wonderful to discover another person with genuine thoughts on this issue. Really.. many thanks for starting this up. This site is something that’s needed on the web, someone with a little originality. 일본야동

    Also feel free to visit may webpage check this link
    한국야동

    ReplyDelete
  23. Greetings! Very useful advice within this article! It’s the little changes that will make the biggest changes. Thanks for sharing! 한국야동닷컴

    Also feel free to visit may webpage check this link
    국산야동

    ReplyDelete
  24. I have to thank you for the efforts you’ve put in penning this blog. I am hoping to check out the same high-grade content from you in the future as well 국산야동

    Also feel free to visit may webpage check this link
    야설

    ReplyDelete
  25. Everything is very open with a really clear description of the issues. It was really informative. Your website is very helpful. Thank you for sharing! 중국야동넷

    Also feel free to visit may webpage check this link
    야설

    ReplyDelete
  26. I am regular visitor, how are you everybody?
    This article posted at this website is in fact good
    I 사설토토

    ReplyDelete
  27. Promote Abhi digital agency marketing is the leading SEO company in Patiala, Punjab. Designing a stunning website is one thing and to make its online presence is another thing.
    Find a low-cost and Best interior designer in Gorakhpur to help you design your dream home. From a list of interior designers in Gorakhpur, choose the best
    Buy Birthright's clay balls for plants hydroponics and Aquaponics online at low price in India on Amazon.in. Free Shipping.
    Go to the Workspace Control Center. on GoDaddy and Enter Your Username and Password, and select Sign In. Click Sign In. Related steps.
    F95zone Latest Games & Updates. A visual overview of the latest new games and updates.

    ReplyDelete
  28. I have a similar interest this is my page read everything carefully and let me know what you think. 사설토토

    ReplyDelete
  29. Your information is helpful for me thanks for sharing the valuable information… 카지노

    ReplyDelete
  30. Here you will learn what is important, it gives you a link to an interesting web page: 파워볼

    ReplyDelete
  31. I am very glad to be here. It is so amazing and interesting. I wanna tell you that it is very helpful for us. Thanks for sharing such an awesome blog with us. I want to visit again. 온라인카지노

    ReplyDelete
  32. I want you that You are a very interesting person. You have a different mindset than the others
    Want to be rich, then come to see.... พีจีสล็อต สมัคร

    ReplyDelete
  33. We are Delhi based SMO Company, We offer Social Media Optimization (SMO) Services in Delhi, India at reasonable price
    Emotions Interior Designer is the most trusted interior designers in Gorakhpur, India. their company provide a unique and creative approach to their customers.
    Buy Money Plant Golden Online at best prices only at Birthright, India's leading online shop for agriculture supplies and garden tools.
    Financeatyourtip, provide updates about the best demat account for traders all over world. Its brokerage fee is extremely feasible and this assists traders and investors
    F95zone Latest Games & Updates. A visual overview of the latest new games and updates.

    ReplyDelete
  34. We are Delhi based SMO Company, We offer Social Media Optimization (SMO) Services in Delhi, India at reasonable price
    Emotions Interior Designer is the most trusted interior designers in Gorakhpur, India. their company provide a unique and creative approach to their customers.
    Buy Aloe Vera Indoor Plant Online In India at best prices only at Birthright, India's leading online shop for agriculture supplies and garden tools.
    Financeatyourtip, provide updates about the best demat account for traders all over world. Its brokerage fee is extremely feasible and this assists traders and investors
    F95zone Latest Games & Updates. A visual overview of the latest new games and updates.Buy Money Plant Online in India at best prices only at Birthright, India's leading online shop.

    ReplyDelete
  35. Here you can find POP3 IMAP SMTP Mail Servers address for iCloud Internet Service Provider · iCloud POP3 incoming mail server: pop3 not supported · iCloud IMAP incoming mail server: imap.
    If there are no updates available or avast is not updating, repair the Avast software. Click the Start menu and then select the Clean my PC Programs and Features option. From the list of options displayed, select the Avast option and then choose Uninstall/change. Click the Change tab on the Uninstall or change a program option.
    The Adobe Genuine Software (AGS) integrity service is a service that periodically verifies whether Adobe apps on your machine are genuine and notifies you if
    Follow Brother Printer Troubleshooting steps· First, you can check the power supply. · Try shutting down the printer and restart it if you encounter any
    The error code [pii_email_3a19ac5cc937023e1594] most often appears when your Microsoft Outlook is not working properly.
    The Fort Collins, CO, GoWireless Verizon Authorized Retailer is conveniently located in Front Range Village off E. Harmony Road, near the intersection of
    Call silversingles.com customer service faster with Experts. Popular customer problems and how to solve them · Reasons customers like you called recently.
    New Kannada Full Movies Watch Online Free 3Movierulz, Latest Kannada Movies Free HD mkv 720p, ... Kotigobba 3 (2021) HDRip Kannada Movie Watch Online Free.

    ReplyDelete
  36. I always think about what is. It seems to be a perfect article that seems to blow away such worries. 온카지노 seems to be the best way to show something. When you have time, please write an article about what means!!

    ReplyDelete
  37. Some truly wonderful work on behalf of the owner of this internet site , perfectly great articles 안전놀이터

    ReplyDelete
  38. "Nice blog here! Also your website loads up very fast! What host are you using? Can I get your affiliate link to your host? I wish my site loaded up as fast as yours lol I frequently read through your articles thoroughly. I’m also interested in wealth generators phone number, you could discuss this occasionally. Have a good day! I’m still learning from you, as I’m trying to reach my goals. I definitely liked reading all that is posted on your blog.Keep the aarticles coming. I liked it!
    Enjoyed reading through this, very good stuff, thanks." 승인전화없는토토사이트

    ReplyDelete
  39. "It is appropriate time to make some plans for the long run and it’s time to be happy. I’ve read this post and if I may I wish to recommend you some attention-grabbing things or suggestions. Perhaps you could write next articles relating to this article. Thanks for sharing superb informations. Your website is so cool. I am impressed by the details that you’ve on this site.
    It reveals how nicely you understand this subject. Bookmarked this web page, will come back for extra articles.
    You, I found just the information I already searched everywhere and just could not come across.
    What a perfect web site." 검증된놀이터

    ReplyDelete
  40. Woah! I’m really digging the template/theme of this site. It’s simple, yet effective. A lot of times it’s challenging to get that “perfect balance” between usability and appearance. I must say you’ve done a superb job with this. In addition, the blog loads extremely quick for me on Opera. Excellent Blog! This is my very first comment here so I really wanted to say a quick shout out and tell you I truly enjoy reading through your posts. Can you recommend any other sites which go over healthy family diet? I am as well pretty intrigued by this! Thanks a ton! 헤이먹튀

    ReplyDelete
  41. Thanks for an interesting blog. What else may I get that sort of info written in such a perfect approach? I have an undertaking that I am just now operating on, and I have been on the lookout for such info. You completed a few fine points there. I did a search on the subject and found nearly all persons will go along with with your blog. This is an awesome motivating article.I am practically satisfied with your great work.You put truly extremely supportive data. Keep it up. Continue blogging. Hoping to perusing your next post 우리카지노

    ReplyDelete
  42. Thank you, I have just been searching for info approximately this topic for a while and yours is the best I have discovered so far. But, what concerning the conclusion? Are you positive in regards to the source? 토토경비대

    ReplyDelete
  43. Pretty good post. I just stumbled upon your blog and wanted to say that I have really enjoyed reading your blog posts. Any way I'll be subscribing to your feed and I hope you post again soon. Big thanks for the useful info. I recently found many useful information in your website especially this blog page. Among the lots of comments on your articles. Thanks for sharing. I've been looking for info on this topic for a while. I'm happy this one is so great. Keep up the excellent work 먹튀폴리스주소

    ReplyDelete
  44. Great post. I was checking continuously this blog and I’m impressed! Very helpful information specially the last part  I care for such info a lot. I was looking for this certain information for a very long time. Thank you and good luck.| 엔트리파워사다리

    ReplyDelete
  45. This article is an appealing wealth of useful informative that is interesting and well-written. I commend your hard work on this and thank you for this information. I know it very well that if anyone visits your blog, then he/she will surely revisit it again. Excellent post. I was reviewing this blog continuously, and I am impressed! Extremely helpful information especially this page. Thank you and good luck. this article is very nice and very informative article.I will make sure to be reading your blog more. 토토SOS

    ReplyDelete
  46. This is the type of information I’ve long been trying to find. Thank you for writing this information. 토토사이트

    ReplyDelete
  47. Thanks on your marvelous posting! I quite enjoyed reading it, you might be a great author. I will ensure that I bookmark your blog and definitely will come back someday. I want to encourage you continue your great job, have a nice afternoon! 카지노

    ReplyDelete
  48. This article is an appealing wealth of useful informative that is interesting and well-written. I commend your hard work on this and thank you for this information. I know it very well that if anyone visits your blog, then he/she will surely revisit it again. I’m impressed, I must say. Actually rarely do you encounter a weblog that’s both educative and entertaining, and let me tell you, you’ve got hit the nail for the head. Your thought is outstanding; the thing is a thing that insufficient consumers are speaking intelligently about. I am happy that I found this at my find some thing with this. Thanks for helping out, good info 카지노사이트

    ReplyDelete
  49. This is such a great resource that you are providing and you give it away for free. I love seeing blog that understand the value. Im glad to have found this post as its such an interesting one! I am always on the lookout for quality posts and articles so i suppose im lucky to have found this! I hope you will be adding more in the future  헤이먹튀

    ReplyDelete
  50. Pretty good post. I just stumbled upon your blog and wanted to say that I have really enjoyed reading your blog posts. Any way I'll be subscribing to your feed and I hope you post again soon. Big thanks for the useful info. I recently found many useful information in your website especially this blog page. Among the lots of comments on your articles. Thanks for sharing. I've been looking for info on this topic for a while. I'm happy this one is so great. Keep up the excellent work 안전토토검증

    ReplyDelete
  51. Wow that was strange. I just wrote an extremely long comment but after I clicked submit my comment didn’t show up. Grrrr… well I’m not writing all that over again. Anyway, just wanted to say superb blog!| 우리카지노

    ReplyDelete
  52. Great articles and great layout. Your blog post deserves all of the positive feedback it’s been getting. 바카라사이트

    ReplyDelete
  53. This is actually the kind of information I have been trying to find. Thank you for writing this information. 토토사이트

    ReplyDelete
  54. Extremely pleasant and fascinating post. I was searching for this sort of data and appreciated perusing this one. Continue posting. Much obliged for sharing. When I initially commented I appear to have clicked on the -Notify me when new comments are added- checkbox and now every time a comment is added I get 4 emails with the same comment. Is there an easy method you are able to remove me from that service? Thank you!| 카지노세상

    ReplyDelete
  55. hi there. Neat submit. There is an hassle along side your internet web page in firefox, and you may need to test this… the browser is the marketplace chief and a massive a part of exclusive people will miss your high-quality writing because of this problem. Super statistics in your weblog, thanks for taking the time to proportion with us. Remarkable perception you've got in this, it's quality to find out a internet site that facts plenty information about special artists. Thanks first-rate article. When i noticed jon’s electronic mail, i recognize the post may be suitable and i'm amazed that you wrote it guy! 토토검증

    ReplyDelete
  56. Hello, I am one of the most impressed people in your article. 토토사이트순위 I'm very curious about how you write such a good article. Are you an expert on this subject? I think so. Thank you again for allowing me to read these posts, and have a nice day today. Thank you.

    ReplyDelete
  57. Captivating post. I Have Been contemplating about this issue, so an obligation of appreciation is all together to post. Completely cool post.It 's greatly extraordinarily OK and Useful post.Thanks 사설토토사이트

    ReplyDelete
  58. Looking at this article, I miss the time when I didn't wear a mask. 오공슬롯 Hopefully this corona will end soon. My blog is a blog that mainly posts pictures of daily life before Corona and landscapes at that time. If you want to remember that time again, please visit us.

    ReplyDelete
  59. In my opinion, the item you posted is perfect for being selected as the best item of the year. You seem to be a genius to combine 우리카지노 and . Please think of more new items in the future!

    ReplyDelete
  60. When did you start writing articles related to ? To write a post by reinterpreting the 메리트카지노 I used to know is amazing. I want to talk more closely about , can you give me a message?

    ReplyDelete
  61. Buy Indoor Plants Online in India - Birthright offers indoor plants for home online in India.
    As a Best Graphic Design Company in India, We have a team of talented brand shapers who have the capability, passion and knowledge to deal with clients.
    Get contact details and address of Renovation Services, Renovation Works firms and ... Customoised Home Renovation Services, In Delhi Ncr, Negotiable.
    Use the Blink Home Monitor app to check in on what's happening at home from anywhere at any time. The app connects your home to your phone in HD video

    ReplyDelete
  62. "
    Extraordinarily new! Some extraordinarily sensible center interests! I'm especially appreciative that
    you made this article, different pieces of the site are all things considered extraordinary. 토토사이트"

    ReplyDelete
  63. Your post is very interesting to me. Reading was so much fun. I think the reason reading is fun is because it is a post related to that I am interested in. Articles related to 온카지노 you are the best. I would like you to write a similar post about !

    ReplyDelete
  64. Good site you have here.. It’s hard to find quality writing like yours these days. I honestly appreciate individuals like you!
    스포츠토토

    ReplyDelete
  65. This is my first time go to see at here and i am really happy to read everything at single place. 경마

    ReplyDelete
  66. Never knew this, regards for letting me know. 파친코사이트

    ReplyDelete
  67. I have been reading for the past two days about your blogs and topics, still on fetching! Wondering about your words on each line was massively effective. 스포츠토토

    ReplyDelete
  68. Wonderful web site. Plenty of useful info here. I am sending it to several pals ans additionally sharing. 온라인카지노

    ReplyDelete
  69. This is my first visit to your blog! We are a team of volunteers and starting a new initiative in a community in the same niche. Your blog provided us beneficial information to work on. 바카라사이트

    ReplyDelete
  70. It’s awesome in favor of me to have a web page, which is useful in favor of my experience. thanks admin. 카지노사이트존

    ReplyDelete
  71. This an amazing reads, it shows that you actually know what you are talking about, thanks a lot for sharing the elucidate contents.
    온라인카지노

    ReplyDelete

  72. I was impressed by your writing. I have a similar hobby as you. 사설토토

    ReplyDelete
  73. Great post! I am actually getting ready to across this information, is very helpful my friend. Also great blog here with all of the valuable information you have. Keep up the good work you are doing here. 온라인카지노

    ReplyDelete
  74. I’m very pleased to discover this site. I want to to thank you for ones time for this particularly wonderful read. 파워볼게임

    ReplyDelete
  75. Oh my goodness! Awesome article dude! Thanks, numerous tips. 카지노

    ReplyDelete