The probability that a pair of group elements is autoconjugate

Let g and h be arbitrary elements of a given finite group G. Then g and h are said to be autoconjugate if there exists some automorphism α of G such that h = gα. In this article, we construct some sharp bounds for the probability that two random elements of G are autoconjugate, denoted by Pa(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {P}_{a}(G)$\end{document}. It is also shown that Pa(G)|G|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {P}_{a}(G)|G|$\end{document} depends only on the autoisoclinism class of G.