Originally Posted by
Robin
Originally Posted by
Robin
This means that whenever there is a run of "calm" the first "emotional" is guaranteed to be a local maximum, similarly the first "calm" after a run of "emotional" data will be a local minimum.
If you plan to publish, I think you can be a bit more specific and say that every local maximum will be "emotional", and every local minimum will be "calm". If an event was "calm", then it's "anticipation" must be lower than the following (as a calm event will raise the "anticipation"), thus not being able to be a local maximum. Reverse for "emotional". That statement can be used to directly prove that the effect observed is a mathematical artifact. You only need to prove that events that are neither locally maximal nor minimal are distributed randomly (which should be evident from your algorithm).