Array vs. Linked List Traversal

It's claimed that array traversal is faster than linked list traversal.  What would be the reasons for that?
Array elements being in cache, assuming the element size is small enough to fit multiple elements in a cache line?
No dependent load delay from having to load the linked list next pointer?  If that was the case, then moving the load of the next pointer to the beginning of the loop should ameliorate that somewhat.
Something else?
Joe Seigh