User talk:Mathstat

Hello, Mathstat! Welcome to Wikipedia! Thank you for your contributions to this free encyclopedia. If you decide that you need help, check out Getting Help below, ask me on my talk page, or place {{helpme}} on your talk page and ask your question there. Please remember to sign your name on talk pages by using four tildes (~~~~) or by clicking if shown; this will automatically produce your username and the date. Finally, please do your best to always fill in the edit summary field. Below are some useful links to facilitate your involvement. Happy editing! ww2censor (talk) 20:20, 11 November 2010 (UTC)[reply]
Getting started
Getting help
Policies and guidelines
The community
Writing articles
Miscellaneous

Thank you for uploading File:EugeneLukacs2.jpg. However, it currently is missing information on its copyright status. Wikipedia takes copyright very seriously. It may be deleted soon, unless we can determine the license and the source of the file. If you know this information, then you can add a copyright tag to the image description page.

If you have uploaded other files, consider checking that you have specified their license and tagged them, too. You can find a list of files you have created in your upload log.

If you have any questions, please feel free to ask them at the media copyright questions page. Thanks again for your cooperation. ww2censor (talk) 20:19, 11 November 2010 (UTC)[reply]

Articles you might like to edit, from SuggestBot

SuggestBot predicts that you will enjoy editing some of these articles. Have fun!

Stubs
Medical statistics
Polar distribution
Cleanup
Prior probability
Mann–Whitney U
Merge
Stability (probability)
Multivariate random variable
Discrete probability distribution
Add Sources
McNemar's test
Wikify
Proportional hazards models
Expand
Characteristic function (probability theory)
Probability integral transform

SuggestBot picks articles in a number of ways based on other articles you've edited, including straight text similarity, following wikilinks, and matching your editing patterns against those of other Wikipedians. It tries to recommend only articles that other Wikipedians have marked as needing work. Your contributions make Wikipedia better -- thanks for helping.

If you have feedback on how to make SuggestBot better, please tell me on SuggestBot's talk page. Thanks from Nettrom (talk), SuggestBot's caretaker.

P.S. You received these suggestions because your name was listed on the SuggestBot request page. If this was in error, sorry about the confusion. -- SuggestBot (talk) 16:14, 12 November 2010 (UTC)[reply]

Questions on dcor

Hi, Mathstat. Thanks for your work on the Distance correlation article. I have a couple of questions about dcor that probably don't belong on the article's discussion page:

1. I'm sure I'm just not seeing the obvious, but I don't see the difference between E|X-X’||Y-Y’|, E|X – X’||Y – Y"|, and E|X – X"||Y – Y’|. Since no-prime, prime, and double-prime are all iid, why does it make any difference for the calculation whether e.g. X’ or X" is subtracted from X under the expectation operator?

It may be more clear if the expectations are written in integral form with the corresponding joint densities. One can also gain some insight by looking at the sample coefficients, which correspond to certain finite populations.

2. I would think an ideal measure of degree of dependence would have not only the property that dcor = 0 iff they're independent, but also that dcor = 1 iff they are non-stochastically related according to xi = f(yi) for all i, for some non-stochastic function f. Does the latter or something like it hold for dcor? I.e., does dcor provide a test for a non-stochastic relationship? Duoduoduo (talk) 16:41, 22 December 2010 (UTC)[reply]

Under distance correlation properties, (iii) dcor(X,Y)=1 implies that Y=a+bCX. Thus 0<dcor(X,Y)<1 if the function f is not a linear transformation. Testing for a non-stochastic relationship is an interesting question, which could potentially be an application of dcor, but I am not aware of any more general results to date.

Mathstat (talk) 17:02, 22 December 2010 (UTC)[reply]

One more question: Do we know that, for all independent X and Y, dvar (X+Y) ≥ max{dvar (X), dvar (Y)}? Duoduoduo (talk) 00:41, 23 December 2010 (UTC)[reply]

Your submission at Articles for creation

Radha Laha, which you submitted to Articles for creation, has been created.

Thank you for helping Wikipedia!  Chzz  ►  23:01, 23 December 2010 (UTC)[reply]

Speedy deletion nomination of Lukacs Distinguished Professor

If this is the first article that you have created, you may want to read the guide to writing your first article.

You may want to consider using the Article Wizard to help you create articles.

A tag has been placed on Lukacs Distinguished Professor requesting that it be speedily deleted from Wikipedia. This has been done under section A3 of the criteria for speedy deletion, because it is an article with no content whatsoever, or whose contents consist only of external links, a "See also" section, book references, category tags, template tags, interwiki links, a rephrasing of the title, or an attempt to contact the subject of the article. Please see Wikipedia:Stub for our minimum information standards for short articles. Also please note that articles must be on notable subjects and should provide references to reliable sources that verify their content.

If you think that this notice was placed here in error, you may contest the deletion by adding {{hang on}} to the top of the page that has been nominated for deletion (just below the existing speedy deletion, or "db", tag; if no such tag exists, then the page is no longer a speedy delete candidate and adding a hang-on tag is unnecessary), coupled with adding a note on the talk page explaining your position, but be aware that once tagged for speedy deletion, if the page meets the criterion, it may be deleted without delay. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the page that would render it more in conformance with Wikipedia's policies and guidelines. If the page is deleted, you can contact one of these administrators to request that the administrator userfy the page or email a copy to you. The Blade of the Northern Lights (話して下さい) 19:23, 10 January 2011 (UTC)[reply]

Re

It had absolutely no content at the time I got to it, and was rightly deleted as such. It's good that you recreated it; however, the version I tagged (I didn't delete it, I'm not an admin) clearly fell under CSD A3. When creating a page, you should include at least some basic information; we have no idea if you'll ever come back to the article, and after a little while it's standard procedure to tag a page with no content. But I'm glad you recreated it; don't get discouraged, just remember that going forward. It'll make everyone's life easier. The Blade of the Northern Lights (話して下さい) 20:38, 10 January 2011 (UTC)[reply]

You can take up the deletion with the deleting admin; I have no control over that. Very few people do what I do (New Page Patrol), so I have to make quick decisions, and at the time the page had no content. For future reference, there are two templates you can put on top of the page, {{underconstruction}} and {{editing}}, which will alert people that you're still working on the article, and will give you some extra time. You can also work on things in userspace by making User:Mathstat/Name of Article, then move it into mainspace when you feel it's ready. I hope that's helpful. The Blade of the Northern Lights (話して下さい) 21:28, 10 January 2011 (UTC)[reply]
If you look at the top of your screen, there should be an arrow; if you hover over it, there should be a dropdown menu that says "move". If you're having trouble, the relevant page is WP:MOVE. If you still have issues, you can go to the helpdesk and ask someone there. And before I go, I read over your article, and I'm impressed; it looks very good now. Nice work. The Blade of the Northern Lights (話して下さい) 21:39, 10 January 2011 (UTC)[reply]

Thank you

The Modest Barnstar
Thanks for your recent contributions! 129.49.72.78 (talk) 22:13, 23 February 2011 (UTC)[reply]

Categories

You asked about my changing of some of the categories that you had placed 2 articles in. There is a general understanding that "categories" should be fairly specific and of modest size so that they are usful for grouping similar things together. We did have a situation where there were 400 articles directly in category "Statistics", all very disparate, so that it was essdentially useless. Similarly for "Probability". There is a need find one (or preferably some) of the subcategories under these roots to find useful ideas the article can be grouped with. After all, Wikipedia does not have a category called "All articles in Wikipedia". It is always a good idea to look at what other articles are already in a category you are thinking of using. The "Theory of probability distributions" category for example contains things that describe or characterise distributions or which allow them to be combined, relevant to its being a subcategory of "Probability distributions".

You mention "biographies" ... not all biographies are directly in category "Biographies" (if there is one). Typically "biographies" suffer from ambiguity of nationality and this may have led to some understandable difference in treatment there, ... or just a general laziness of participants.

The "Estimation theory" category has suffered (and still does) from its starting out as a mixture of estimation-in-statistics and estimation-in-signal-processing: some better subcategorisation of this and "Statistical theory" may well be needed. To some extent, U-statistics and V-statistics are similar ... if it were possible to find other articles with which they should be grouped then it may be possible to devise some new sub-categories that would help to clean up these parts of the "Statistics" and "Probability" trees of categories.

I suggest: (i) that (if you haven't already done so) you start at these roots and expand the subcategories there to see what is already in existence; (ii) that you look to see what Wikepedia's strategy for "Categories" is. One way of doing the latter is to use Wikipedia's search facility .... click on "search" with an empty search field ...this should bring up a general search page ... click on "Advanced", untick "Articles" and tick "Wikipedia", then enter terms on which you seek background, such as "categories", "see also" etc.. 10:08, 24 February 2011 (UTC)

Thanks very much for the detailed explanation. In biographies I was referring to the large categories like "Living persons" or "1960 births" and really narrow categories like Fellows of whatever society or Alumni of Harvard, etc. Anyway I can accept if different types of articles follow different conventions. I will follow your suggestions to see if I can get a good sense of what the statistics community would prefer.
Still I cannot feel good about "Estimation theory" being the only category for V-statistics or U-statistics, and I feel that those two articles should really have identical categories. Which one is applied (U or V) really is more of a function of the type of application. If the limit distribution is normal then U-statistics are sometimes nicer. If the limit distribution is quadratic form of centered Gaussian, then the V-statistics are more natural. The real breakthrough of Cramer was that he could handle the degenerate cases that Hoeffding's projection method could not. So it gave unifying theory to both U-statistics and V-statistics. The category for me would be asymptotic theory, I suppose. I noticed that there is a category called Asymptotic analysis. Does that seem appropriate?
Maybe "Symmetric statistics" would be a category containing both U and V statistics (there is no such article or category that I could find.) In the literature this term is sometimes used, but unfortunately this term probably suggests to the average person a statistic with a symmetric distribution rather than a statistic defined by a symmetric kernel. The statistics that would fit into this category would be in addition familiar examples Cramer-von Mises statistics (in general) including Anderson-Darling statistics (all the quadratic EDF statistics), the special cases of those for testing normality; some less familiar statistics like nearest neighbor statistics for equality of distribution, and many others (even excluding examples from my own research the list is long). But some of these nice examples are not yet in WP. Mathstat (talk) 18:16, 25 February 2011 (UTC)[reply]
A suggestion is that we could place a category "Distributions of sample satatistics" under both "Probability distributions" and "Statistical theory", with the intentions being that these articles are related to finding distributions of estimates etc.. Note that I think that even "test statistics" in hypothesis tests are estimating something. But we need to choose category names that are generally understandable. We could also invent a category "Asymptotic statistical theory" and leave Category:Asymptotic analysis to cover more ordinary mathematical analysis. You might like to think about adding some appropriate text and links to the article Asymptotic theory (statistics) for U and V statistics. Melcombe (talk) 10:05, 28 February 2011 (UTC)[reply]

Talkback

Hello, Mathstat. You have new messages at WP:FEED#Radha_Laha.
You can remove this notice at any time by removing the {{Talkback}} or {{Tb}} template.

Hello, I replied to your request for feedback. I hope my comments/suggestions are useful, but if you have any questions please feel free to contact me. Thanks! Chevymontecarlo 07:06, 3 March 2011 (UTC)[reply]

http://en.wikipedia.org/wiki/Haplogroup_J1_(Y-DNA)

Please review the map, the work of Tofanelli et al, Hassan et al, and comment in the discussions:

http://en.wikipedia.org/wiki/File:HG_J1_(ADN-Y)
http://hpgl.stanford.edu/publications/AJHG_2004_v74_p1023-1034.pdf http://ychrom.invint.net/upload/iblock/94d/Hassan%202008%20Y-Chromosome%20Variation%20Among%20Sudanese.pdf
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC384897/figure/FG1/ http://en.wikipedia.org/wiki/Haplogroup_J1_(Y-DNA)
http://en.wikipedia.org/wiki/Talk:Haplogroup_J1_(Y-DNA)
Essentially, the issue is whether J1 dominates in Sudan and the Caucasus at over 60%. John Lloyd Scharf 09:54, 23 August 2011 (UTC)

Why not make Ward's method go online?

It seems like you have done a good work - and it could benefit from having more people looking over it.

Cheers, Tal Galili (talk) 07:52, 29 November 2011 (UTC)[reply]

Articles you might like to edit, from SuggestBot

We are currently running a study on the effects of adding additional information to SuggestBot’s recommendations. Participation in the study is voluntary. Should you wish to not participate in the study, or have questions or concerns, you can find contact information in the consent information sheet.

We have added information about the opportunity to make substantial valuable contributions to an article using a Low/Medium/High scale which goes from Low Opportunity: Low to High Opportunity: High Opportunity: High Opportunity: High. The score is calculated by combining an article's readership and quality.

SuggestBot predicts that you will enjoy editing some of these articles. Have fun!

Stubs   Cleanup
Opportunity: High Opportunity: High Opportunity: High Partial autocorrelation function   Opportunity: Medium Opportunity: Medium Twisting properties
Opportunity: High Opportunity: High Opportunity: High Covariance and correlation   Opportunity: High Opportunity: High Opportunity: High Generative model
Opportunity: High Opportunity: High Opportunity: High Bates distribution   Opportunity: High Opportunity: High Opportunity: High Benktander Weibull distribution
Opportunity: High Opportunity: High Opportunity: High Barry Morrow   Merge
Opportunity: High Opportunity: High Opportunity: High Empirical probability   Opportunity: Medium Opportunity: Medium Methods of computing square roots
Opportunity: High Opportunity: High Opportunity: High Woodworm   Opportunity: Medium Opportunity: Medium Point estimation
Opportunity: High Opportunity: High Opportunity: High Quintus Curtius Rufus   Opportunity: High Opportunity: High Opportunity: High 3D reconstruction
Opportunity: High Opportunity: High Opportunity: High Delaporte distribution   Add sources
Opportunity: High Opportunity: High Opportunity: High Additive smoothing   Opportunity: High Opportunity: High Opportunity: High Seasonal adjustment
Opportunity: High Opportunity: High Opportunity: High Statistical parameter   Opportunity: Medium Opportunity: Medium Beta distribution
Opportunity: High Opportunity: High Opportunity: High Ektara   Opportunity: High Opportunity: High Opportunity: High Scale parameter
Opportunity: High Opportunity: High Opportunity: High Variance-gamma distribution   Wikify
Opportunity: High Opportunity: High Opportunity: High Isabelle Breitman   Opportunity: Medium Opportunity: Medium Self-Similarity of Network Data Analysis
Opportunity: Medium Opportunity: Medium USA-223   Opportunity: Medium Opportunity: Medium Technology brokering
Opportunity: Medium Opportunity: Medium Garrowhill   Opportunity: Medium Opportunity: Medium Coupon collector's problem (generating function approach)
Opportunity: High Opportunity: High Opportunity: High Noncentral beta distribution   Expand
Opportunity: High Opportunity: High Opportunity: High Benini distribution   Opportunity: Medium Opportunity: Medium Entropy in thermodynamics and information theory
Opportunity: High Opportunity: High Opportunity: High Ahmad Hazwan Bakri   Opportunity: High Opportunity: High Opportunity: High Normal-scaled inverse gamma distribution
Opportunity: High Opportunity: High Opportunity: High Welch's t test   Opportunity: High Opportunity: High Opportunity: High Gamma distribution

SuggestBot picks articles in a number of ways based on other articles you've edited, including straight text similarity, following wikilinks, and matching your editing patterns against those of other Wikipedians. It tries to recommend only articles that other Wikipedians have marked as needing work. We appreciate that you have signed up to receive suggestions regularly, your contributions make Wikipedia better — thanks for helping!

If you have feedback on how to make SuggestBot better, please let us know on SuggestBot's talk page. Regards from Nettrom (talk), SuggestBot's caretaker. -- SuggestBot (talk) 02:58, 26 February 2012 (UTC)[reply]

Hi. When you recently edited Noncentral chi distribution, you added a link pointing to the disambiguation page Degrees of freedom (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 12:09, 13 July 2012 (UTC)[reply]

Invitation to comment at Monty Hall problem RfC

You are invited to comment on the following probability-related RfC:

Talk:Monty Hall problem#Conditional or Simple solutions for the Monty Hall problem?

--Guy Macon (talk) 17:15, 8 September 2012 (UTC)[reply]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Distance correlation, you added a link pointing to the disambiguation page Characteristic function (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:46, 14 December 2012 (UTC)[reply]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Relationships among probability distributions, you added a link pointing to the disambiguation page Independent (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:27, 14 January 2013 (UTC)[reply]

Thank you...

...for correcting my almost unbelievable mistake here. I must have been extremely tired when I made those edits, as I know full well that the two formulations are equivalent. I also know that the stuff about being a biased estimate is completely off the point, as there is no unbiased estimate of the correlation coefficient. I seem to have had a weird confusion in my mind between the correlation coefficient and the variance, goodness knows how or why. JamesBWatson (talk) 11:02, 10 May 2013 (UTC)[reply]

Some baklava for you!

Some baklava for you! Solomon7968 (talk) 18:02, 21 May 2013 (UTC)[reply]

Gopinath Kallianpur

If you have any info can you see the "See Also" section of this article. It needs some expert attention. May be you can help. Solomon7968 (talk) 13:13, 22 May 2013 (UTC)[reply]

Long-time Wikipedian increasingly semi-retired; kinda desperate for stats advice

  • Ummm, editing for... wow, nearly 7 years.. as Ling.Nut and various other names... see User:Ling.Nut/awards ... Yes, I know that asking for real-world stats advice (not actual help, just advice as to how to approach some problems) is probably the height of socially unacceptable behavior. But I'm semi-desperate. May I email you? • Serviceable†Villain 13:08, 5 June 2013 (UTC)[reply]
Hello, Mathstat. Please check your email; you've got mail!
It may take a few minutes from the time the email is sent for it to show up in your inbox. You can remove this notice at any time by removing the {{You've got mail}} or {{ygm}} template.

• Serviceable†Villain 05:22, 6 June 2013 (UTC)[reply]

Talk:C. R. Rao

Please continue the discussion on Talk:C. R. Rao or on User talk:Solomon7968. Solomon7968 19:45, 11 June 2013 (UTC)[reply]

You seem unhelpful. I am asking you for help but you are not answering. Regards. Solomon7968 20:03, 11 June 2013 (UTC)[reply]
I try to be helpful. Sorry for any misunderstanding. Mathstat (talk) 23:13, 11 June 2013 (UTC)[reply]
Thanks! It will be great if you can make the articles on the see also section of Gopinath Kallianpur. I posted above on your talk page. I am assuming you are from India. Solomon7968 23:26, 11 June 2013 (UTC)[reply]

Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Univariate distribution, you added links pointing to the disambiguation pages T distribution and Uniform distribution. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ • Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:03, 19 October 2014 (UTC)[reply]

ArbCom elections are now open!

Hi,
You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 14:25, 24 November 2015 (UTC)[reply]

ArbCom Elections 2016: Voting now open!

Hello, Mathstat. Voting in the 2016 Arbitration Committee elections is open from Monday, 00:00, 21 November through Sunday, 23:59, 4 December to all unblocked users who have registered an account before Wednesday, 00:00, 28 October 2016 and have made at least 150 mainspace edits before Sunday, 00:00, 1 November 2016.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2016 election, please review the candidates' statements and submit your choices on the voting page. MediaWiki message delivery (talk) 22:08, 21 November 2016 (UTC)[reply]

Women in Red World Contest

Hi. We're into the last five days of the Women in Red World Contest. There's a new bonus prize of $200 worth of books of your choice to win for creating the most new women biographies between 0:00 on the 26th and 23:59 on 30th November. If you've been contributing to the contest, thank you for your support, we've produced over 2000 articles. If you haven't contributed yet, we would appreciate you taking the time to add entries to our articles achievements list by the end of the month. Thank you, and if participating, good luck with the finale!

ArbCom 2017 election voter message

Hello, Mathstat. Voting in the 2017 Arbitration Committee elections is now open until 23.59 on Sunday, 10 December. All users who registered an account before Saturday, 28 October 2017, made at least 150 mainspace edits before Wednesday, 1 November 2017 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2017 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 3 December 2017 (UTC)[reply]

ArbCom 2018 election voter message

Hello, Mathstat. Voting in the 2018 Arbitration Committee elections is now open until 23.59 on Sunday, 3 December. All users who registered an account before Sunday, 28 October 2018, made at least 150 mainspace edits before Thursday, 1 November 2018 and are not currently blocked are eligible to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2018 election, please review the candidates and submit your choices on the voting page. MediaWiki message delivery (talk) 18:42, 19 November 2018 (UTC)[reply]