A walk is a finite sequence of vertices and edges beginning and ending with a vertex. Here both vertices and edges could repeat.
A path is a walk with distinct vertices and edges with the starting vertex and end vertex. Also the starting and end vertex in a path must be distinct.
So by the definitions we can see that every path is a walk.
For a more detailed discription refer Glossary of graph theory - Wikipedia, the free encyclopedia