User talk:Radagast3
Our first steps help file and our FAQ will help you a lot after registration. They explain how to customize the interface (for example the language), how to upload files and our basic licensing policy. You don't need technical skills in order to contribute here. Be bold contributing here and assume good faith for the intentions of others. This is a wiki ‒ it is really easy. More information is available at the Community Portal. You may ask questions at the Help desk, Village Pump or on IRC channel #wikimedia-commons (direct access). You can also contact an administrator on their talk page. If you have a specific copyright question, ask at Commons talk:Licensing. |
| |
(P.S. Would you like to provide feedback on this message?) |
--SieBot 14:27, 30 April 2008 (UTC)
Zipf Graph
[edit]I refer to the Hapax Legomenom page that you added [Zipf graph] too. That is a fascinating phenomenom that you introduced me to, thanks.
However it seems misleading to me because the red and blue horizontal lines overlap yet so much overlap should not be possible because they represent rank. Sure they could overlap by *one* rank (two words can be equal one millionth in rank) but not more than one.
Or am I misunderstanding something? I really am wanting to be sure I understand this.
~~sqgl
- The "red and blue horizontal lines" are in fact thousands of adjacent points. For example, words ranked #6720 to #9554 occur exactly twice each (e.g. "sympathies"), and words ranked #9555 to #16942 occur exactly once each (e.g. "stiver"). -- Radagast3 (talk) 10:16, 2 February 2013 (UTC)
A barnstar for you!
[edit]![]() |
The Original Barnstar |
Hi, Thank you for your contribution on Chaos topics. I would like to ask you if you have time to explain how you got the topological mixing plot. I am trying to make it in MATLAB but am not able to. N3kromancer732 (talk) 00:24, 28 July 2016 (UTC) |