Essays about: "random walks"
Showing result 1 - 5 of 17 essays containing the words random walks.
-
1. Applications of Random Walks : How Random Walks Are Used in Wilson's Algorithm and How They Connect to Electrical Networks
University essay from Uppsala universitet/Sannolikhetsteori och kombinatorikAbstract : In this master thesis we will show how random walks are used in Wilson's algorithm to generate spanning trees of graphs, and how they can be used to calculate the number of spanning trees in a graph. We will also explore the connection between electrical networks and random walks, and how this connection can be exploited to prove Pólya's theorem (normally proved with probability and combinatorics) using electrical arguments. READ MORE
-
2. A Comparative Investigation of Classical Random and Quantum Walks in Terms of Algorithms, Implementation, and Characteristics
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : In recent years, there has been a significant development in high performance computing, driven by advances in hardware and software technology. The performance of the computers to the present has improved in accordance with Moore’s law, on the other hand, it seems to be reaching the limits in the near future. READ MORE
-
3. Interactive Visualization of Network Models in JavaScript/TypeScript for Web-based Applications
University essay from Umeå universitet/Institutionen för fysikAbstract : Networks of nodes and links are powerful tools to model complex systems, however, when the number of nodes and links grows to the thousands then even the network becomes too complex to comprehend unless we can simplify and highlight the networks underlying structure. The map equation is a method developed by the researchers at IntegratedScience Lab that uses an information theoretic approach to reveal community structure using the flow of information on the network modeled with random walks. READ MORE
-
4. Simulating the Impact of Noise on Quantum Walk Algorithm
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Quantum computing has recently shown promise for improving the efficiency of some classical algorithms. However, quantum computing suffers from issues in reliability due to the fundamental problem of quantum mechanics called decoherence. READ MORE
-
5. Random curves and their scaling limits
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : We focus on planar Random Walks and some related stochastic processes. The discrete models are introduced and some of their core properties examined. We then turn to the question of continuous analogues, starting with the well-known convergence of the Random Walk to Brownian Motion. READ MORE
