Name
Abstract | ||
|---|---|---|
In this work we explore the ability of the Google search engine to find results for random N-letter strings. These random strings, dense over the set of possible N-letter words, address the existence of typos, acronyms, and other words without semantic meaning. Interestingly, we find that the probability of finding such strings sharply drops from one to zero at Nc = 6. The behavior of such order parameter suggests the presence of a transition-like phenomenon in the geometry of the search space. Furthermore, we define a susceptibility-like parameter which reaches a maximum in the neighborhood, suggesting the presence of criticality. We finally speculate on the possible connections to Ramsey theory. |
Year | Venue | Field |
|---|---|---|
2012 | CoRR | Ramsey theory,Search engine,Crossover,Information retrieval,Computer science,Phenomenon,Criticality,The Internet |
DocType | Volume | Citations |
Journal | abs/1205.1505 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lucas Lacasa | 1 | 16 | 6.12 |
| Jacopo Tagliabue | 2 | 3 | 1.90 |
| Andrew Berdahl | 3 | 1 | 1.71 |