Why does an adjacency list usually fit a sparse graph better than an adjacency matrix?

Why does an adjacency list usually fit a sparse graph better than an adjacency matrix?

1. It stores existing neighbor relationships instead of allocating a cell for every vertex pair.
2. It guarantees that the graph contains no cycle.
3. It makes every weighted shortest-path query constant time.
4. It removes the need for stable vertex identities.