Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 2 of 2
Full-Text Articles in Probability
Evaluating The Efficiency Of Markov Chain Monte Carlo Algorithms, Thuy Scanlon
Evaluating The Efficiency Of Markov Chain Monte Carlo Algorithms, Thuy Scanlon
Graduate Theses and Dissertations
Markov chain Monte Carlo (MCMC) is a simulation technique that produces a Markov chain designed to converge to a stationary distribution. In Bayesian statistics, MCMC is used to obtain samples from a posterior distribution for inference. To ensure the accuracy of estimates using MCMC samples, the convergence to the stationary distribution of an MCMC algorithm has to be checked. As computation time is a resource, optimizing the efficiency of an MCMC algorithm in terms of effective sample size (ESS) per time unit is an important goal for statisticians. In this paper, we use simulation studies to demonstrate how the Gibbs …
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Computer Science and Computer Engineering Undergraduate Honors Theses
In the modern age of social media and networks, graph representations of real-world phenomena have become incredibly crucial. Often, we are interested in understanding how entities in a graph are interconnected. Graph Neural Networks (GNNs) have proven to be a very useful tool in a variety of graph learning tasks including node classification, link prediction, and edge classification. However, in most of these tasks, the graph data we are working with may be noisy and may contain spurious edges. That is, there is a lot of uncertainty associated with the underlying graph structure. Recent approaches to modeling uncertainty have been …