| |
| | subadditive ergodic theorem (Site not responding. Last check: 2007-10-23) |
 | | Definition: If a stationary and ergodic process satisfies the subadditive inequality, it grows almost surely linearly in time. |
 | | Note: From Algorithms and Theory of Computation Handbook, page 14-35, Copyright © 1999 by CRC Press LLC. |
 | | Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "subadditive ergodic theorem", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. |
| www.nist.gov /dads/HTML/subadditive.html (117 words) |
|