human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "Theoretical rates of convergence for Markov chain Monte Carlo"
  Abstract: We present a general method for proving rigorous, a priori bounds on the number of iterations required to achieve convergence of Markov chain Monte Carlo. We describe bounds for specific models of the Gibbs sampler, which have been obtained from the general method. We discuss possibilities for obtaining bounds more generally.

Connected through hyperedge HE-1 (induced by source paper "A simulation approach to convergence rates for Markov chain Monte Carlo algorithms"):
  with members:
    - "Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review"
    - "Bounding Convergence Time of the Gibbs Sampler in Bayesian Image Restoration"
    - "Rate of Convergence of the Gibbs Sampler by Gaussian Approximation  SUMMARY"
    - "Analysis of the Gibbs sampler for a model related to James-Stein estimators"
    - "Convergence properties of perturbed Markov chains"
    - "Rates of convergence of the Hastings and Metropolis algorithms"
    - "A note on convergence rates of Gibbs sampling for nonparametric mixtures"
    - "Adaptive Markov Chain Monte Carlo through Regeneration  Summary"

Connected through hyperedge HE-2 (induced by source paper "Rates of convergence of the Hastings and Metropolis algorithms"):
  with members:
    - "Bounding Convergence Time of the Gibbs Sampler in Bayesian Image Restoration"
    - "A simulation approach to convergence rates for Markov chain Monte Carlo algorithms"
    - "Rate of Convergence of the Gibbs Sampler by Gaussian Approximation  SUMMARY"
    - "Analysis of the Gibbs sampler for a model related to James-Stein estimators"
    - "EXACT TRANSITION PROBABILITIES FOR THE INDEPENDENCE METROPOLIS SAMPLER"
    - "Estimating L 1 Error of Kernel Estimator: Monitoring Convergence of Markov Samplers"
    - "A note on acceptance rate criteria for CLTs for Hastings-Metropolis algorithms"
    - "Exponential Convergence of Langevin Diffusions and Their Discrete Approximations"

Connected through hyperedge HE-3 (induced by source paper "Analysis of the Gibbs sampler for a model related to James-Stein estimators"):
  with members:
    - "Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review"
    - "A simulation approach to convergence rates for Markov chain Monte Carlo algorithms"
    - "Convergence properties of perturbed Markov chains"
    - "Rates of convergence of the Hastings and Metropolis algorithms"
    - "APPLICATIONS OF CHEEGER'S CONSTANT TO THE CONVERGENCE RATE OF MARKOV CHAINS ON R n"

Connected through hyperedge HE-4 (induced by source paper "Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review"):
  with members:
    - "Applications and extensions of MCMC in IRT: Multiple item types, missing data, and rated responses"
    - "Decision Analysis by Augmented Probability Simulation"
    - "Bounding Convergence Time of the Gibbs Sampler in Bayesian Image Restoration"
    - "Perfect Simulation in Stochastic Geometry"
    - "Maximum Working Likelihood Inference with Markov Chain Monte Carlo"
    - "Estimating Ratios of Normalizing Constants for Densities with Different Dimensions"
    - "Markov Chain Monte Carlo in Practice: A Roundtable Discussion"
    - "A simulation approach to convergence rates for Markov chain Monte Carlo algorithms"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Probabilistic_Methods