Exponential Distribution Random Numbers out of range
$begingroup$
Hi All I have following exponential distribution equation to generate different values for random variable 'r':
$$p_r = frac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}} alpha^{-r}
text{ for } r = 1, dots, CW$$
I have applied inverse sampling to get values of $r$ by equating this equation to random variable $U$ between 0 and 1 and then applying log on both sides. CW is fixed as 10 and $alpha$ as 0.8 . But I get values of
$r$ greater than CW (its max range) and values are positive and negative.
probability-distributions random-variables
$endgroup$
add a comment |
$begingroup$
Hi All I have following exponential distribution equation to generate different values for random variable 'r':
$$p_r = frac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}} alpha^{-r}
text{ for } r = 1, dots, CW$$
I have applied inverse sampling to get values of $r$ by equating this equation to random variable $U$ between 0 and 1 and then applying log on both sides. CW is fixed as 10 and $alpha$ as 0.8 . But I get values of
$r$ greater than CW (its max range) and values are positive and negative.
probability-distributions random-variables
$endgroup$
add a comment |
$begingroup$
Hi All I have following exponential distribution equation to generate different values for random variable 'r':
$$p_r = frac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}} alpha^{-r}
text{ for } r = 1, dots, CW$$
I have applied inverse sampling to get values of $r$ by equating this equation to random variable $U$ between 0 and 1 and then applying log on both sides. CW is fixed as 10 and $alpha$ as 0.8 . But I get values of
$r$ greater than CW (its max range) and values are positive and negative.
probability-distributions random-variables
$endgroup$
Hi All I have following exponential distribution equation to generate different values for random variable 'r':
$$p_r = frac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}} alpha^{-r}
text{ for } r = 1, dots, CW$$
I have applied inverse sampling to get values of $r$ by equating this equation to random variable $U$ between 0 and 1 and then applying log on both sides. CW is fixed as 10 and $alpha$ as 0.8 . But I get values of
$r$ greater than CW (its max range) and values are positive and negative.
probability-distributions random-variables
probability-distributions random-variables
edited Dec 4 '18 at 9:38
Todor Markov
1,854410
1,854410
asked Dec 4 '18 at 8:48
user3696623user3696623
12
12
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For convenience, use the shorthand $beta equivfrac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}}$.
Generate random variable $U$ uniformly from $[0,1)$, where the observed values are $u$, then the desired random variable $R$ (which observed values are $r$) can be obtained as
begin{align}
r &= 1 & &text{if} & 0 le frac{u}{beta} & < alpha^{-1} \
r &= 2 & &text{if} & alpha^{-1} le frac{u}{beta} & < alpha^{-1} + alpha^{-2} \
r &= 3 & &text{if} & alpha^{-1} + alpha^{-2} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} \
r &= 4 & &text{if} & alpha^{-1} + alpha^{-2} + alpha^{-3} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} + alpha^{-4}\
&vdots &&vdots &&vdots \
r &= k & &text{if} & sum_{j=1}^{k-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^k alpha^{-j} \
&vdots &&vdots &&vdots \
r &= CW & &text{if} & sum_{j=1}^{CW-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^{CW} alpha^{-j}
end{align}
By the way, this is not an exponential distribution. It is a truncated Geometric distribution.
Your original approach of "applying log on both sides" is the method of inverse transformation that works only on continuous distributions when directly applied like that.
$endgroup$
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
|
show 2 more comments
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025303%2fexponential-distribution-random-numbers-out-of-range%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For convenience, use the shorthand $beta equivfrac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}}$.
Generate random variable $U$ uniformly from $[0,1)$, where the observed values are $u$, then the desired random variable $R$ (which observed values are $r$) can be obtained as
begin{align}
r &= 1 & &text{if} & 0 le frac{u}{beta} & < alpha^{-1} \
r &= 2 & &text{if} & alpha^{-1} le frac{u}{beta} & < alpha^{-1} + alpha^{-2} \
r &= 3 & &text{if} & alpha^{-1} + alpha^{-2} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} \
r &= 4 & &text{if} & alpha^{-1} + alpha^{-2} + alpha^{-3} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} + alpha^{-4}\
&vdots &&vdots &&vdots \
r &= k & &text{if} & sum_{j=1}^{k-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^k alpha^{-j} \
&vdots &&vdots &&vdots \
r &= CW & &text{if} & sum_{j=1}^{CW-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^{CW} alpha^{-j}
end{align}
By the way, this is not an exponential distribution. It is a truncated Geometric distribution.
Your original approach of "applying log on both sides" is the method of inverse transformation that works only on continuous distributions when directly applied like that.
$endgroup$
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
|
show 2 more comments
$begingroup$
For convenience, use the shorthand $beta equivfrac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}}$.
Generate random variable $U$ uniformly from $[0,1)$, where the observed values are $u$, then the desired random variable $R$ (which observed values are $r$) can be obtained as
begin{align}
r &= 1 & &text{if} & 0 le frac{u}{beta} & < alpha^{-1} \
r &= 2 & &text{if} & alpha^{-1} le frac{u}{beta} & < alpha^{-1} + alpha^{-2} \
r &= 3 & &text{if} & alpha^{-1} + alpha^{-2} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} \
r &= 4 & &text{if} & alpha^{-1} + alpha^{-2} + alpha^{-3} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} + alpha^{-4}\
&vdots &&vdots &&vdots \
r &= k & &text{if} & sum_{j=1}^{k-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^k alpha^{-j} \
&vdots &&vdots &&vdots \
r &= CW & &text{if} & sum_{j=1}^{CW-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^{CW} alpha^{-j}
end{align}
By the way, this is not an exponential distribution. It is a truncated Geometric distribution.
Your original approach of "applying log on both sides" is the method of inverse transformation that works only on continuous distributions when directly applied like that.
$endgroup$
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
|
show 2 more comments
$begingroup$
For convenience, use the shorthand $beta equivfrac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}}$.
Generate random variable $U$ uniformly from $[0,1)$, where the observed values are $u$, then the desired random variable $R$ (which observed values are $r$) can be obtained as
begin{align}
r &= 1 & &text{if} & 0 le frac{u}{beta} & < alpha^{-1} \
r &= 2 & &text{if} & alpha^{-1} le frac{u}{beta} & < alpha^{-1} + alpha^{-2} \
r &= 3 & &text{if} & alpha^{-1} + alpha^{-2} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} \
r &= 4 & &text{if} & alpha^{-1} + alpha^{-2} + alpha^{-3} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} + alpha^{-4}\
&vdots &&vdots &&vdots \
r &= k & &text{if} & sum_{j=1}^{k-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^k alpha^{-j} \
&vdots &&vdots &&vdots \
r &= CW & &text{if} & sum_{j=1}^{CW-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^{CW} alpha^{-j}
end{align}
By the way, this is not an exponential distribution. It is a truncated Geometric distribution.
Your original approach of "applying log on both sides" is the method of inverse transformation that works only on continuous distributions when directly applied like that.
$endgroup$
For convenience, use the shorthand $beta equivfrac{(1 - alpha)alpha^{CW}}{1 - alpha^{CW}}$.
Generate random variable $U$ uniformly from $[0,1)$, where the observed values are $u$, then the desired random variable $R$ (which observed values are $r$) can be obtained as
begin{align}
r &= 1 & &text{if} & 0 le frac{u}{beta} & < alpha^{-1} \
r &= 2 & &text{if} & alpha^{-1} le frac{u}{beta} & < alpha^{-1} + alpha^{-2} \
r &= 3 & &text{if} & alpha^{-1} + alpha^{-2} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} \
r &= 4 & &text{if} & alpha^{-1} + alpha^{-2} + alpha^{-3} le frac{u}{beta} &< alpha^{-1} + alpha^{-2} + alpha^{-3} + alpha^{-4}\
&vdots &&vdots &&vdots \
r &= k & &text{if} & sum_{j=1}^{k-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^k alpha^{-j} \
&vdots &&vdots &&vdots \
r &= CW & &text{if} & sum_{j=1}^{CW-1} alpha^{-j} le frac{u}{beta} &< sum_{j=1}^{CW} alpha^{-j}
end{align}
By the way, this is not an exponential distribution. It is a truncated Geometric distribution.
Your original approach of "applying log on both sides" is the method of inverse transformation that works only on continuous distributions when directly applied like that.
answered Dec 4 '18 at 13:31
Lee David Chung LinLee David Chung Lin
3,98031140
3,98031140
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
|
show 2 more comments
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
1. Thanks for explanation and sorry for late reply . This equation is from SIFT MAC Protocol research paper [Jamieson, K., Balakrishnan, H., & Tay, Y. C. (2006, February). Sift: A MAC protocol for event-driven wireless sensor networks. In European workshop on wireless sensor networks (pp. 260-275). Springer, Berlin, Heidelberg] and author says that it is exponential. any ways may be i understood wrong. 2. How can we make this equation more compact as i need to program it ?
$endgroup$
– user3696623
Dec 22 '18 at 12:20
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(1) People from different fields use different terminology. If no such communication problem is encountered in your line of work then it's not my place to judge. Just FYI in many communities, Geometric Distribution and Exponential Distribution refer to two different things that are mutual analogues, with the former being discrete and latter continuous.
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:39
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
(2) This set of equations can be easily vectorized (coded compactly) in most commonly used programming languages or Matlab, R, Mathematica, etc. What platform are you working with?
$endgroup$
– Lee David Chung Lin
Dec 23 '18 at 10:40
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
I am working in C++.
$endgroup$
– user3696623
Dec 24 '18 at 11:46
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
$begingroup$
Continue the two bullets above (1) I finally take a look at the (various versions) of the paper by Jamieson and Balakrishnan. They clearly stated that "Sift uses a truncated increasing geometric distribution". This and that are two highlighted snapshots. I don't know why you said they call it exponential. I advise you edit the question title, otherwise the suggested links are all irrelevant.
$endgroup$
– Lee David Chung Lin
Dec 25 '18 at 11:50
|
show 2 more comments
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025303%2fexponential-distribution-random-numbers-out-of-range%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown