Essays about: "random graphs"
Showing result 1 - 5 of 38 essays containing the words random graphs.
-
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. Subjective Tests for Quality of Experience in Streamed Virtual Reality Games
University essay from Luleå tekniska universitet/Institutionen för system- och rymdteknikAbstract : VR gaming is an emerging market with relatively new technology when compared to PC and console gaming. Streamed VR gaming is when the VR game is being streamed from another device to the VR headset. READ MORE
-
3. Automating Root Cause Analysis of Anomalies in Ericsson Wallet Platform using Machine Learning
University essay from Blekinge Tekniska HögskolaAbstract : Background: In this era of mobile wallet platforms, to ensure key requirements like high availability and performance, the company must have mechanisms in place to detect anomalies at any given point in time. Ericsson Wallet Platform(EWP), a mobile wallet platform, is facing the problem of manually analyzing all the logs and reports and taking comprehensive action decisions accordingly. READ MORE
-
4. Adaptive random walks on graphs to sample rare events
University essay from Stockholms universitet/FysikumAbstract : In this thesis, I study fluctuations and rare events of time-additive observables of discrete-time Markov chains on finite state spaces. The observable of interest is the mean node connectivity visited by a random walk running on instances of an Erdős-Rényi (ER) random graph. READ MORE
-
5. Modelling Cyber Security of Networks as a Reinforcement Learning Problem using Graphs : An Application of Reinforcement Learning to the Meta Attack Language
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : ICT systems are part of the vital infrastructure in today’s society. These systems are under constant threat and efforts are continually being put forth by cyber security experts to protect them. By applying modern AI methods, can these efforts both be improved and alleviated of the cost of expert work. READ MORE