Stockfish ELO vs search depth Could Stockfish beat Magnus Carlsen if its moves were calculated with the UCI command "go depth 16"?
If not, how can I find the depth "d" at which Stockfish's strength surpasses top GMs?

We assume Magnus has standard time controls, and Stockfish limited only by search depth.

I would love to see a graph of Stockfish ELO (against an opponent with standard time controls) vs search depth. Does anything similar exist?

Context: I'm analyzing GM games to see when humans make mistakes, like this.
I want to set my search depth "d" so that when the engine and human moves disagree, I can be confident that the human has made a mistake.
There actually is an ambitiously worked out answer out there:

http://web.ist.utl.pt/diogo.ferreira/papers/ferreira13impact.pdf

On page 77 you get the relevant table:

depth: elo:

20    2894

19    2828

18    2761

17    2695

16    2629

15    2563

…


So my comment was slightly off, depth 20 is already very strong. Still the point remains, that it is hard to compare search depth between different engines, because it is never brute force and selectively they go much deeper than the given depth. (In the paper they used Houdini 1.5, maybe some engine expert can relate Houdini-search depth to Stockfish search depth.)