Frequency of exceedance any peak exceeding is . Its complement, is the probability of exceedance, the probability that has been exceeded at least once by time . This probability can be useful to estimate whether an extreme event will occur during a specified time period, such as the lifespan of a structure or the duration of an operation. If is small, for example for the frequency of a rare event occurring in a short time period, then Under this assumption, the frequency of exceedance is equal to the probability of exceedance per unit time, , and the probability of exceedance can be computed
Cube-connected cycles graphs are not pancyclic, they contain cycles of all but a bounded number of possible even lengths, and when "n" is odd they also contain many of the possible odd lengths of cycles. Cube-connected cycles were investigated by , who applied these graphs as the interconnection pattern of a network connecting the processors in a parallel computer. In this application, cube-connected cycles have the connectivity advantages of hypercubes while only requiring three connections per processor. Preparata and Vuillemin showed that a planar layout based on this network has optimal area × time complexity for many parallel processing tasks. Cube-connected cycles