Any finitely presented simple group has solvable word problem, and hence recursive Dehn function. I'm curious though how wild these recursive functions could possibly be.
One concrete question is whether there are even any examples known of a finitely presented simple group whose Dehn function is exponential. The only examples I can think of at the moment of finitely presented simple groups where something is known about their Dehn functions are Burger-Mozes groups (quadratic Dehn function) and Thompson's groups $T$ and $V$ (polynomial Dehn function, conjecturally quadratic).
Another (vaguer) question is whether there is some stronger bound on what sorts of functions can be Dehn functions of finitely presented simple groups (stronger than just being recursive, I mean). E.g., maybe there's some reason they can't be super-exponential?
Best Answer
To answer the vaguer question: I think there is no known bound on the Dehn functions of finitely presented simple groups. Recall:
Boone–Higman Embedding Theorem. A finitely presented group has solvable word problem if and only if it can be embedded in a recursively presented simple group.
In their paper, they asked about strengthening their theorem:
Question. Is every finitely generated group G with soluble word problem embeddable in some finitely presented simple group?
This is still open (as I learnt from a talk by Jim Belk last year) and if the answer were yes, then we could embed groups with "arbitrarily bad" solvable word problem in finitely presented simple groups, whereas a bound on the Dehn function gives a bound on the complexity of the word problem.
Boone, William W.; Higman, Graham, An algebraic characterization of groups with soluble word problem, J. Aust. Math. Soc. 18, 41-53 (1974). ZBL0303.20028 MR0357625.