How much slower is vector comapred STL list when trying to delete from middle(or anywhere except head/tail)

Question

I am currently researching different Data Structures and comparing them. This is the first one I am doing and I have some few question about running time of deletion algorithms.