Concept

Random walk

In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk on the integer number line which starts at 0, and at each step moves +1 or −1 with equal probability. Other examples include the path traced by a molecule as it travels in a liquid or a gas (see Brownian motion), the search path of a foraging animal, or the price of a fluctuating stock and the financial status of a gambler. Random walks have applications to engineering and many scientific fields including ecology, psychology, computer science, physics, chemistry, biology, economics, and sociology. The term random walk was first introduced by Karl Pearson in 1905. A popular random walk model is that of a random walk on a regular lattice, where at each step the location jumps to another site according to some probability distribution. In a simple random walk, the location can only jump to neighboring sites of the lattice, forming a lattice path. In a simple symmetric random walk on a locally finite lattice, the probabilities of the location jumping to each one of its immediate neighbors are the same. The best-studied example is the random walk on the d-dimensional integer lattice (sometimes called the hypercubic lattice) . If the state space is limited to finite dimensions, the random walk model is called a simple bordered symmetric random walk, and the transition probabilities depend on the location of the state because on margin and corner states the movement is limited. An elementary example of a random walk is the random walk on the integer number line, , which starts at 0 and at each step moves +1 or −1 with equal probability. This walk can be illustrated as follows. A marker is placed at zero on the number line, and a fair coin is flipped. If it lands on heads, the marker is moved one unit to the right. If it lands on tails, the marker is moved one unit to the left. After five flips, the marker could now be on -5, -3, -1, 1, 3, 5.

Official source

https://en.wikipedia.org/wiki/Random_walk

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

MATH-232: Probability and statistics (for IC)

Cours d'introduction à la théorie des probabilités et aux statistiques. ...

PHYS-512: Statistical physics of computation

The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning. ...

Related units (14)

Chair of Stochastic Processes

Scientific Computing and Uncertainty Quantification - CADMOS Chair

Audiovisual Communications Laboratory

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Random_walk

About this result

Related courses (32)

PHYS-467: Machine learning for physicists

MATH-232: Probability and statistics (for IC)

Cours d'introduction à la théorie des probabilités et aux statistiques. ...

PHYS-512: Statistical physics of computation

Related lectures (32)

Levy Flights & Brownian Motion

Explores Levy Flights and Brownian Motion, focusing on probability distributions and divergences in lag time.

Maximum Entropy Principle: Stochastic Differential Equations

Explores the application of randomness in physical models, focusing on Brownian motion and diffusion.

Applied Probability and Stochastic Processes: Tutorial 02

Covers communicating classes, hitting time, probabilities, and the Gambler's Ruin Model in stochastic processes.

Related publications (32)

Recovering Communities in Structured Random Graphs

The problem of recovering planted community structure in random graphs has received a lot of attention in the literature on the stochastic block model, where the input is a random graph in which edges crossing between different communities appear with smaller probability than edges induced by communities. The communities themselves form a collection of vertex-disjoint sparse cuts in the expected graph, and can be recovered, often exactly, from a sample as long as a separation condition on the intra- and int

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

Robust Software for the Modeling of Spatial Random Fields across Geoscience Disciplines

We have developed theory, algorithmic tools, and two software suites (written in MATLAB and Python) that are openly available for use by the broad geosciences community for the statistical characterization of spatial datasets as finite, discrete random fields. Our software implements robust statistical methods that we have formulated for the simulation and estimation of stationary, isotropic, random fields on a potentially only partially observed grid within the Matérn class of parametric covariance functio

2026

PCA for point processes

We introduce a novel statistical framework for the analysis of replicated point processes that allows for the study of point pattern variability at a population level. By treating point process realizations as random measures, we adopt a functional analysis perspective and propose a form of functional Principal Component Analysis (fPCA) for point processes. The originality of our method is to base our analysis on the cumulative mass functions of the random measures, which gives us a direct and interpretable

Institute of Mathematical Statistics2026

Related people (32)

Younes Pierre Zine

Expertise I mainly work on (deterministic and random) nonlinear PDEs by using techniques and insights from PDE theory, probability theory and Fourier analysis.My website:https://younes-zine.github.io Expertise I mainly work on (deterministic and random) nonlinear PDEs by using techniques and insights from PDE theory, probability theory and Fourier analysis.My website:https://younes-zine.github.io Education Ph.D. | 2020 – 2023 The University of Edinburgh

Myrto Limnios

Teaching & PhD Courses Empirical processes MATH-522 We learn how to control the nonasymptotic and random behavior of collections of estimators, when indexed by classes of functions/sets. Examples range from prototypical estimators used by statisticians, to nonparametric models used in machine learning. Regression methods MATH-408 General graduate course on regression methods

Sofia Charlotta Olhede

I am a professor of Statistics at EPFL. I did my PhD in Mathematics at Imperial College London, and graduated in 2003. I was an assistant professor (lecturer) at Imperial College London 2002-2006, and an associate professor (senior lecturer) 2006-2007. In 2007 I moved to University College London and became a full professor. I moved to EPFL in 2019, and in 2018 I became an Institute of Mathematical Statistics Fellow with citation “For seminal contributions to the theory and application of large and heteroge

Robert Dalang

Robert Dalang, né en 1961, a reçu le diplôme de Mathématicien-EPFL en 1983 et est lauréat du Prix Dommer. Il passe l'année 1985-86 à Cornell University (USA) comme chercheur invité. Il obtient le doctorat au Département de mathématiques de l'EPFL en 1987. Son domaine de spécialisation est la théorie des processeurs stochastiques. En 1987, Robert Dalang est nommé professeur assistant au Département de statistiques de l'Université de Californie à Berkeley (USA). En 1988, il reçoit une bourse post-doctorale du Fonds national scientifique américain et effectue des recherches sur les propriétés markoviennes de processus stochastiques à plusieurs paramètres. En 1990, il est nommé à Tufts University (Boston, USA). Il est promu professeur associé en mai 1993. Une partie importante de ses recherches se font dans le cadre de contrats avec le Fonds national scientifique américain et l'Office de la recherche de l'armée américaine. En collaboration avec le Prof. R. Cairoli du Département de mathématiques de l'EPFL, il a écrit un livre sur l'optimisation stochastique séquentielle publié en 1996 aux éditions John Wiley. M. Dalang est nommé professeur extraordinaire de probabilités au Département de mathématiques en 1995. Il y poursuit des travaux de recherche en processus stochastiques et probabilité appliquée et participe à l'enseignement des processus stochastiques, de la théorie des probabilités et des cours de mathématiques aux sections d'ingénieurs. Il dirige régulièrement des thèses de doctorats, est éditeur de plusieurs journaux de recherche mathématique et travail en collaboration avec des chercheurs de plusieurs universités européennes et américaines.

Martin Vetterli

Martin Vetterli was appointed president of EPFL by the Federal Council following a selection process conducted by the ETH Board, which unanimously nominated him. Professor Vetterli was born on 4 October 1957 in Solothurn and received his elementary and secondary education in Neuchâtel Canton. He earned a Bachelor’s degree in electrical engineering from ETH Zurich (ETHZ) in 1981, a Master’s of Science degree from Stanford University in 1982, and a PhD from EPFL in 1986. Professor Vetterli taught at Columbia University as an assistant and then associate professor. He was subsequently named full professor in the Department of Electrical Engineering and Computer Sciences at the University of California at Berkeley before returning to EPFL as a full professor at the age of 38. He has also taught at ETHZ and Stanford University. Professor Vetterli has earned numerous national and international awards for his research in electrical engineering, computer science and applied mathematics, including the National Latsis Prize in 1996. He is a fellow of both the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers and a member the US National Academy of Engineering. He has published over 170 articles and three reference works. Professor Vetterli’s work on the theory of wavelets, which are used in signal processing, is considered to be of major importance by his peers, and his areas of expertise, including image and video compression and self-organized communication systems, are central to the development of new information technologies. As the founding director of the National Centre of Competence in Research on Mobile Information and Communication Systems, Professor Vetterli is a staunch advocate of transdisciplinary research. Professor Vetterli knows EPFL inside and out. An EPFL graduate himself, he began been teaching at the school in 1995, was vice president for International Affairs and then Institutional Affairs from 2004 to 2011, and served as dean of the School of Computer and Communication Sciences in 2011 and 2012. In addition to his role as president of the National Research Council of the Swiss National Science Foundation, a position he held from 2013 to 2016, he heads the EPFL’s Audiovisual Communications Laboratory (LCAV) since 1995. Professor Vetterli has supported more than 60 students in Switzerland and the United States in their doctoral work and makes a point of following their highly successful careers, whether it is in the academic or business world. He is the author of some 50 patents, some of which were the basis for start-ups coming out of his lab, such as Dartfish and Illusonic, while others were sold (e.g. Qualcomm) as successful examples of technology transfer. He actively encourages young researchers to market the results of their work.

Andrés Ignacio Cristi Espinosa

Expertise

Online Algorithms & Sequential Decision-Making- Algorithmic Game Theory- Mechanism & Market Design Teaching & PhD PhD Students Jiechen Zhang, Aruzhan Amanbayeva Courses Algorithmic game theory MGT-435 We will study mathematical models of the interplay between algorithms and strategic behavior. We cover fundamental concepts from game theory and mechanism design, including Nash equilibria, the price of anarchy, auctions and market design, incentive compatibility, and online learn

Andrea Rinaldo

Max-Olivier Hongler

Expertise Processus stochastiquesContrôle optimal Enseignement et PhD A dirigé les thèses EPFL de Yves Salama, Philippe Ciprut, Fabrice Dusonchet, Roger Filliger, Olivier Gallay, Julio Rodriguez, Guillaume Adrien Sartoretti

Patrick Thiran

Patrick Thiran is a full professor in network and systems theory at the School of Computer and Communication Sciences at EPFL. He holds an electrical engineering degree from the Université Catholique de Louvain, Louvain-la-Neuve, Belgium, an M.Sc. degree in electrical engineering from the University of California at Berkeley, USA, and he received the PhD degree from EPFL, in 1996. He became an adjunct professor in 1998, an assistant professor in 2002, an associate professor in 2006 and a full professor in 2011. He was with Sprint Advanced Technology Labs in Burlingame, California, in 2000-01. His research interests are in communication and social networks, performance analysis and stochastic models. He is currently active in the analysis and design of wireless and PLC networks (scaling laws, medium access control), in network monitoring (network tomography, multi-layer networks), and data-driven network science. He also contributed to network calculus and to the theory of locally coupled neural networks and self-organizing maps. He served as an associate editor for the IEEE Transactions on Circuits and Systems in 1997-99 and for the IEEE/ACM Transactions on Networking in 2006-10. He is currently on the editorial board of the IEEE Journal on Selected Areas in Communication. He is/was on the program committee of different conferences in networking, including ACM Sigcomm, Sigmetrics, IMC, CoNext and IEEE Infocom. He was TPC chair of AMC IMC 2011 and CoNext 2012. He is a Fellow of the Belgian American Educational Foundation and of the IEEE. He received the 1996 EPFL Doctoral Prize and the 2008 Crédit Suisse Teaching Award.

Clément Hongler

2006: B.Sc. Math, EPFL2008: M.Sc. Math, EPFL2010: Ph.D. Math, Université de Genève2010-2014: Ritt Assistant Professor, Columbia University2014-2018 Tenure-Track Assistant Professor, EPFL2019-present: Associate Professor, EPFL

Related units (14)

Chair of Stochastic Processes

Scientific Computing and Uncertainty Quantification - CADMOS Chair

Audiovisual Communications Laboratory

Related concepts (26)

Wiener process

In mathematics, the Wiener process is a real-valued continuous-time stochastic process named in honor of American mathematician Norbert Wiener for his investigations on the mathematical properties of the one-dimensional Brownian motion. It is often also called Brownian motion due to its historical connection with the physical process of the same name originally observed by Scottish botanist Robert Brown.

Diffusion

Diffusion is the net movement of anything (for example, atoms, ions, molecules, energy) generally from a region of higher concentration to a region of lower concentration. Diffusion is driven by a gradient in Gibbs free energy or chemical potential. It is possible to diffuse "uphill" from a region of lower concentration to a region of higher concentration, like in spinodal decomposition. Diffusion is a stochastic process due to the inherent randomness of the diffusing entity and can be used to model many real-life stochastic scenarios.

Stochastic process

In probability theory and related fields, a stochastic (stəˈkæstɪk) or random process is a mathematical object usually defined as a sequence of random variables, where the index of the sequence has the interpretation of time. Stochastic processes are widely used as mathematical models of systems and phenomena that appear to vary in a random manner. Examples include the growth of a bacterial population, an electrical current fluctuating due to thermal noise, or the movement of a gas molecule.

Related notebooks (7)

Classical Monte Carlo Simulations of the Ising Model on Square Lattice

"## Classical Monte-Carlo simulations of the Ising model on square lattice\n", "\n", "The Ising model considers the following Hamiltonian\n", "\n", "

\\hat{\\mathcal{H}} = -J\\displaystyle\\sum_{}\\sigma_i \\sigma_j

,\n", "\n", "in which spins

\\sigma_i

can take only two discrete values

\\sigma_i \\in \\{-1,+1\\}

. Below, we will consider spins on two-dimensional square lattice taking into account couplings

J

only for the nearest neighbor sites. For

J > 0

the ferromagneti

Basic Example of Anderson Localization in a 1D System

Demonstration of Anderson localization[1]¶ This notebook is intended to show a very basic example of the Anderson localization in one-dimensional system. In [1]: import numpy as np from numpy import linalg as LA import matplotlib.pyplot as plt

from future import print_function

from ipywidgets import interact, interactive, fixed, interact_manual import ipywidgets as widgets %matplotlib inline To show the idea of Anderson localization, we can consider 1D chain of

N

atoms with perio

Exploring the Karplus-Strong Algorithm for Sound Synthesis

The Karplus-Strong Algorithm[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

The Karplus-Strong algorithm is a simple method to generate synthetic sounds with arbitrary pitch. In this notebook we will explore a few variations of the method to illustrate some basic notions of discrete-time signal processing. In [1]: %matplotlib inline import matplotlib import matplotlib.pyplot as plt import numpy as np import IPython In [2]: plt.rcParams["figure.figsize"]

Adaptive Echo Cancellation using LMS Filter

Adaptive Echo Cancellation[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will use the adaptive LMS filter to estimate the impulse response of a reverberating room. A typical use case is handsfree telephony: since the received signal, amplified and played by the speaker, is picked up by the microphone, we need to eliminate it from the signal that is transmitted back in order to avoid a feedback loop. The signal picked up by the microph

Advantages of Digital Transmission over Analog Transmission

[1]Paolo Prandoni, [2]EPFL Analog vs Digital Transmission In this notebook we will explore the advantages of digital transmission over analog transmission. We will model the case of transmission over a long (e.g. transoceanic) cable in which several repeaters are used to compensate for the attenuation incurred by the signal. In [1]: import matplotlib import matplotlib.pyplot as plt import numpy as np import IPython from scipy.io import wavfile plt.rcParams["figure.figsize"] = (14,4)