A random walk on a graph is a stochastic process where steps between connected vertices are chosen randomly. While typical city grids allow for a predictable pattern of movement, irregular grids, represented as complex graphs, may have junctions with different numbers of exits, and the chance of moving through any specific exit is equal. This concept, which can be linked to electrical networks and Markov chains, has been extensively researched since the 1980s, revealing connections to various mathematical concepts and providing insights into both structured and random graphs.
Brown University
Spring 2023
CSCI 0220 provides a foundation in discrete math and probability theory. Key topics include logic, set theory, number theory, combinatorics, graph theory, and probability. No prior math background assumed. Aims to develop problem solving, communication, and collaboration skills. Introduces new concepts and ways of thinking to enable analyzing problems arising in computer science. Beginner-friendly introduction to core mathematical concepts underlying many aspects of CS.
No concepts data
+ 26 more concepts