0
$\begingroup$

I was wondering if the meaning of an elbow applies to graphs like the following. Basically for each curve obtained, I am looking to find out if there is a way to determine a point such as the one marked by 0 in the graph. In layman terms, I want to find out the maximum trade-off point across all the curves. I am not sure about the exact terminology though. In other words, I am trying to find out the point on the curve where the curve undergoes the maximum change. In this graph however, every change looks almost identical but the amount by which the curve falls before changing differs.

I tried looking at the point at which we obtain the maximum second derivative using the second derivative test but am having a hard time to see if it actually applies to curves like this and if there are any references explaining this.

Can someone please suggest related techniques that can be used to find the elbow point on curves like this? I found the following method called the L-Method but wasn't sure if it is applicable in my case.

EDIT: An attempt to describe what I am trying to do:

I am aware that I will be having a hard time explaining what I am doing but I will try my best. I am trying to fix two thresholds: one that is used to obtain the line and the other that I use to filter noise. The '0' on the graph marks the thresholds. In this particular case, I am using Threshold 3 and filtering my population to contain only those people that have >= 2 friends. While this is working well for me, I am trying to determine if there is systematic procedure to explain why these thresholds are better than others. For instance, Threshold 2 is not such a good filter because it behaves like Threshold 1 in that it is not filtering any information from the population (which is around 1500). Utilizing Threshold 4 is not so useful because the returns in going from Threshold 2 to Threshold 3 is much higher than that going from Threshold 3 to Threshold 4.

enter image description here

  • 0
    Al$s$o, I have added a reference that I found called the L-Method if that is of any help.2011-08-01

1 Answers 1

1

Assuming that I'm reading the graph correctly... The derivative (or local change) isn't define on elbows, and since each pair of two adjacent elbows are connected by a straight line, the derivative in each such region (and thus in it's entire area of definition) is constant. Thus, the maximal derivative occurs where the longest "altitude" is lost in the least "time". If we assume that the distance between two adjacent elbows which aren't of the same height is constant $\Delta$ we get that the greatest change occurs in the plunge around 5.

Now for a more constructive approach. This graph seems to represent a function of discrete values (i.e., the values it takes on represents people, which is always a natural number). A very numerically convenient analogue to the derivative in this case is simply $f(n+1)-f(n)$. The larger $f(n)$ will be in relation to $f(n+1)$ the larger the plummet is, in a way independent of the actual values of $f(n)$ and $f(n+1)$. That is, the value of $n$ where $f(n+1)-f(n)$ is maximal (in absolute value) is where the steepest plummet/rise (up to sign) occurred in the graph. I know it seems ridiculously trivial, but it works, and it's also very easy to take averages of and generate some more meaningful statistics.

  • 0
    @J.M.: Thank you for the clarification.2011-08-01