Academic literature on the topic 'Random walks'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random walks.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random walks"

1

Blondel, Oriane, Marcelo R. Hilário, Renato S. dos Santos, Vladas Sidoravicius, and Augusto Teixeira. "Random walk on random walks: Low densities." Annals of Applied Probability 30, no. 4 (2020): 1614–41. http://dx.doi.org/10.1214/19-aap1537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Montero, Miquel. "Random Walks with Invariant Loop Probabilities: Stereographic Random Walks." Entropy 23, no. 6 (2021): 729. http://dx.doi.org/10.3390/e23060729.

Full text
Abstract:
Random walks with invariant loop probabilities comprise a wide family of Markov processes with site-dependent, one-step transition probabilities. The whole family, which includes the simple random walk, emerges from geometric considerations related to the stereographic projection of an underlying geometry into a line. After a general introduction, we focus our attention on the elliptic case: random walks on a circle with built-in reflexing boundaries.
APA, Harvard, Vancouver, ISO, and other styles
3

Lee, P. M., and B. D. Hughes. "Random Walks and Random Environments: Vol. I, Random Walks." Journal of the Royal Statistical Society. Series A (Statistics in Society) 159, no. 3 (1996): 624. http://dx.doi.org/10.2307/2983343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hughes, B. D. "Random Walks and Random Environments, Volume 1: Random Walks." Biometrics 54, no. 3 (1998): 1204. http://dx.doi.org/10.2307/2533883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Weiss, George H. "Random walks and random environments, volume 1: Random walks." Journal of Statistical Physics 82, no. 5-6 (1996): 1675–77. http://dx.doi.org/10.1007/bf02183400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Georgiou, Nicholas, Mikhail V. Menshikov, Aleksandar Mijatović, and Andrew R. Wade. "Anomalous recurrence properties of many-dimensional zero-drift random walks." Advances in Applied Probability 48, A (2016): 99–118. http://dx.doi.org/10.1017/apr.2016.44.

Full text
Abstract:
AbstractFamously, a d-dimensional, spatially homogeneous random walk whose increments are nondegenerate, have finite second moments, and have zero mean is recurrent if d∈{1,2}, but transient if d≥3. Once spatial homogeneity is relaxed, this is no longer true. We study a family of zero-drift spatially nonhomogeneous random walks (Markov processes) whose increment covariance matrix is asymptotically constant along rays from the origin, and which, in any ambient dimension d≥2, can be adjusted so that the walk is either transient or recurrent. Natural examples are provided by random walks whose in
APA, Harvard, Vancouver, ISO, and other styles
7

Boissard, Emmanuel, Serge Cohen, Thibault Espinasse, and James Norris. "Diffusivity of a random walk on random walks." Random Structures & Algorithms 47, no. 2 (2014): 267–83. http://dx.doi.org/10.1002/rsa.20541.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Yujian, and Hechen Zhang. "Application of Random Walks in Data Processing." Highlights in Science, Engineering and Technology 31 (February 10, 2023): 263–67. http://dx.doi.org/10.54097/hset.v31i.5152.

Full text
Abstract:
A random walk is known as a process that a random walker makes consecutive steps in space at equal intervals of time and the length and direction of each step is determined independently. It is an example of Markov processes, meaning that future movements of the random walker are independent of the past. The applications of random walks are quite popular in the field of mathematics, probability and computer science. Random walk related models can be used in different areas such as prediction, recommendation algorithm to recent supervised learning and networks. It is noticeable that there are f
APA, Harvard, Vancouver, ISO, and other styles
9

GUILLOTIN-PLANTARD, NADINE, and RENÉ SCHOTT. "DYNAMIC QUANTUM BERNOULLI RANDOM WALKS." Infinite Dimensional Analysis, Quantum Probability and Related Topics 11, no. 02 (2008): 213–29. http://dx.doi.org/10.1142/s021902570800304x.

Full text
Abstract:
Quantum Bernoulli random walks can be realized as random walks on the dual of SU(2). We use this realization in order to study a model of dynamic quantum Bernoulli random walk with time-dependent transitions. For the corresponding dynamic random walk on the dual of SU(2), we prove several limit theorems (local limit theorem, central limit theorem, law of large numbers, large deviation principle). In addition, we characterize a large class of transient dynamic random walks.
APA, Harvard, Vancouver, ISO, and other styles
10

Roichman, Yuval. "On random random walks." Annals of Probability 24, no. 2 (1996): 1001–11. http://dx.doi.org/10.1214/aop/1039639375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Random walks"

1

Bowditch, Adam. "Biased randomly trapped random walks and applications to random walks on Galton-Watson trees." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/97359/.

Full text
Abstract:
In this thesis we study biased randomly trapped random walks. As our main motivation, we apply these results to biased walks on subcritical Galton-Watson trees conditioned to survive. This application was initially considered model in its own right. We prove conditions under which the biased randomly trapped random walk is ballistic, satisfies an annealed invariance principle and a quenched central limit theorem with environment dependent centring. We also study the regime in which the walk is sub-ballistic; in this case we prove convergence to a stable subordinator. Furthermore, we study the
APA, Harvard, Vancouver, ISO, and other styles
2

Forghani, Behrang. "Transformed Random Walks." Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32538.

Full text
Abstract:
We consider transformations of a given random walk on a countable group determined by Markov stopping times. We prove that these transformations preserve the Poisson boundary. Moreover, under some mild conditions, the asymptotic entropy (resp., rate of escape) of the transformed random walks is equal to the asymptotic entropy (resp., rate of escape) of the original random walk multiplied by the expectation of the corresponding stopping time. This is an analogue of the well-known Abramov's formula from ergodic theory.
APA, Harvard, Vancouver, ISO, and other styles
3

Gnacik, Michal. "Quantum random walks." Thesis, Lancaster University, 2014. http://eprints.lancs.ac.uk/69946/.

Full text
Abstract:
In this thesis we investigate the convergence of various quantum random walks to quantum stochastic cocycles defined on a Bosonic Fock space. We prove a quantum analogue of the Donsker invariance principle by invoking the so-called semigroup representation of quantum stochastic cocycles. In contrast to similar results by other authors our proof is relatively elementary. We also show convergence of products of ampliated random walks with different system algebras; in particular, we give a sufficient condition to obtain a cocycle via products of cocycles. The CCR algebra, its quasifree represent
APA, Harvard, Vancouver, ISO, and other styles
4

Phetpradap, Parkpoom. "Intersections of random walks." Thesis, University of Bath, 2011. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548100.

Full text
Abstract:
We study the large deviation behaviour of simple random walks in dimension three or more in this thesis. The first part of the thesis concerns the number of lattice sites visited by the random walk. We call this the range of the random walk. We derive a large deviation principle for the probability that the range of simple random walk deviates from its mean. Our result describes the behaviour for deviation below the typical value. This is a result analogous to that obtained by van den Berg, Bolthausen, and den Hollander for the volume of the Wiener sausage. In the second part of the thesis, we
APA, Harvard, Vancouver, ISO, and other styles
5

Windisch, David. "Random walks, disconnection and random interlacements /." [S.l.] : [s.n.], 2009. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=18343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Oosthuizen, Joubert. "Random walks on graphs." Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2014.<br>ENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical netw
APA, Harvard, Vancouver, ISO, and other styles
7

Montgomery, Aaron. "Topics in Random Walks." Thesis, University of Oregon, 2013. http://hdl.handle.net/1794/13335.

Full text
Abstract:
We study a family of random walks defined on certain Euclidean lattices that are related to incidence matrices of balanced incomplete block designs. We estimate the return probability of these random walks and use it to determine the asymptotics of the number of balanced incomplete block design matrices. We also consider the problem of collisions of independent simple random walks on graphs. We prove some new results in the collision problem, improve some existing ones, and provide counterexamples to illustrate the complexity of the problem.
APA, Harvard, Vancouver, ISO, and other styles
8

Buckley, Stephen Philip. "Problems in random walks in random environments." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:06a12be2-b831-4c2a-87b1-f0abccfb9b8b.

Full text
Abstract:
Recent years have seen progress in the analysis of the heat kernel for certain reversible random walks in random environments. In particular the work of Barlow(2004) showed that the heat kernel for the random walk on the infinite component of supercritical bond percolation behaves in a Gaussian fashion. This heat kernel control was then used to prove a quenched functional central limit theorem. Following this work several examples have been analysed with anomalous heat kernel behaviour and, in some cases, anomalous scaling limits. We begin by generalizing the first result - looking for suffici
APA, Harvard, Vancouver, ISO, and other styles
9

Ngoc, Anh Do Hoang. "Anomalous diffusion and random walks on random fractals." Doctoral thesis, Universitätsbibliothek Chemnitz, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-201000205.

Full text
Abstract:
The purpose of this research is to investigate properties of diffusion processes in porous media. Porous media are modelled by random Sierpinski carpets, each carpet is constructed by mixing two different generators with the same linear size. Diffusion on porous media is studied by performing random walks on random Sierpinski carpets and is characterized by the random walk dimension $d_w$. In the first part of this work we study $d_w$ as a function of the ratio of constituents in a mixture. The simulation results show that the resulting $d_w$ can be the same as, higher or lower than $d_w$ of c
APA, Harvard, Vancouver, ISO, and other styles
10

Gabucci, Ilenia. "Random walks classici e quantistici." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17759/.

Full text
Abstract:
Questa tesi si propone di fornire uno studio sul random walk. Partendo da un approfondimento sulla teoria della probabilita` alla base di tale processo ed in particolare le distribuzioni Binomiale e Gaussiana, si `e potuto studiare il caso del random walk classico, sia nel caso del reticolo monodimensionale che per reticoli a piu` dimensioni. Sempre nell’ambito classico si sono analizzati anche i processi stocastici dipendenti dal tempo, detti Processi di Markov, e il moto browniano, per cui si sono ricavate le equazioni del moto della particella browniana, ovvero le equazioni di Langevin. Si
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Random walks"

1

Pál, Révész, Tóth Bálint, Paul Erdős Summer Research Center of Mathematics., and International Workshop on Random Walks (1998 : Budapest, Hungary), eds. Random walks. János Bolyai Mathematical Society, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hughes, B. D. Random walks and random environments. Clarendon Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gut, Allan. Stopped Random Walks. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4757-1992-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gut, Allan. Stopped Random Walks. Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-87835-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shi, Zhan. Branching Random Walks. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25372-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lawler, Gregory F. Intersections of Random Walks. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-5972-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lawler, Gregory F. Intersections of Random Walks. Birkhäuser Boston, 1991. http://dx.doi.org/10.1007/978-1-4757-2137-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lawler, Gregory F. Intersections of Random Walks. Birkhäuser Boston, 1991. http://dx.doi.org/10.1007/978-1-4612-0771-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cohen, J. W. Analysis of random walks. IOS Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Markellos, Raphael N. High-frequency random walks? Loughborough University, Department of Economics, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Random walks"

1

Privault, Nicolas. "Random Walks." In Springer Undergraduate Mathematics Series. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0659-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stanley, Richard P. "Random Walks." In Undergraduate Texts in Mathematics. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6998-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gordon, Hugh. "Random Walks." In Discrete Probability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bosq, Denis, and Hung T. Nguyen. "Random Walks." In A Course in Stochastic Processes. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-015-8769-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Blom, Gunnar, Lars Holst, and Dennis Sandell. "Random walks." In Problems and Snapshots from the World of Probability. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-4304-5_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vogel, Harold L. "Random Walks." In Financial Market Bubbles and Crashes, Second Edition. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-71528-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Privault, Nicolas. "Random Walks." In Springer Undergraduate Mathematics Series. Springer Singapore, 2013. http://dx.doi.org/10.1007/978-981-4451-51-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jukna, Stasys. "Random Walks." In Texts in Theoretical Computer Science. An EATCS Series. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17364-6_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

DasGupta, Anirban. "Random Walks." In Springer Texts in Statistics. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-9634-3_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zobitz, John M. "Random Walks." In Exploring Modeling with Data and Differential Equations Using R. Chapman and Hall/CRC, 2022. http://dx.doi.org/10.1201/9781003286974-23.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random walks"

1

Backstrom, Lars, and Jure Leskovec. "Supervised random walks." In the fourth ACM international conference. ACM Press, 2011. http://dx.doi.org/10.1145/1935826.1935914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Javanshir Moghaddam, Mandana, Abouzar Eslami, and Nassir Navab. "DEeP random walks." In SPIE Medical Imaging, edited by Sebastien Ourselin and David R. Haynor. SPIE, 2013. http://dx.doi.org/10.1117/12.2006902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Coopert, Joshua, Benjamin Doerr, Joel Spencer, and Garbor Tardos. "Deterministic Random Walks." In 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2006. http://dx.doi.org/10.1137/1.9781611972962.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Saul, Zachary M., Vladimir Filkov, Premkumar Devanbu, and Christian Bird. "Recommending random walks." In the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1287624.1287629.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Azar, Yossi, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, and Steven Phillips. "Biased random walks." In the twenty-fourth annual ACM symposium. ACM Press, 1992. http://dx.doi.org/10.1145/129712.129713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nguyen, Giang H., John Boaz Lee, Ryan A. Rossi, Nesreen K. Ahmed, Eunyee Koh, and Sungchul Kim. "Dynamic Network Embeddings: From Random Walks to Temporal Random Walks." In 2018 IEEE International Conference on Big Data (Big Data). IEEE, 2018. http://dx.doi.org/10.1109/bigdata.2018.8622109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Servetto, Sergio D., and Guillermo Barrenechea. "Constrained random walks on random graphs." In the 1st ACM international workshop. ACM Press, 2002. http://dx.doi.org/10.1145/570738.570741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kallaugher, John, Michael Kapralov, and Eric Price. "Simulating Random Walks in Random Streams." In Proposed for presentation at the ACM-SIAM Symposium on Discrete Algorithms (SODA22) held January 9-12, 2022 in Alexandria, Virginia United States of America. US DOE, 2022. http://dx.doi.org/10.2172/2001591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rzeszutek, Richard, Thomas El-Maraghi, and Dimitrios Androutsos. "Scale-Space Random Walks." In 2009 Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2009. http://dx.doi.org/10.1109/ccece.2009.5090191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Das Sarma, Atish, Danupon Nanongkai, and Gopal Pandurangan. "Fast distributed random walks." In the 28th ACM symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1582716.1582745.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Random walks"

1

Kunz, Christopher. Nonlocal fractional equations from random walks. Iowa State University, 2023. http://dx.doi.org/10.31274/cc-20240624-1063.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Reeder, Leah, Aaron Jamison Hill, James Bradley Aimone, and William Mark Severa. Exploring Applications of Random Walks on Spiking Neural Algorithms. Office of Scientific and Technical Information (OSTI), 2018. http://dx.doi.org/10.2172/1471656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baggerly, K., D. Cox, and R. Picard. Adaptive importance sampling of random walks on continuous state spaces. Office of Scientific and Technical Information (OSTI), 1998. http://dx.doi.org/10.2172/677157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Metcalf, Gilbert, and Kevin Hassett. Investment Under Alternative Return Assumptions: Comparing Random Walks and Mean Reversion. National Bureau of Economic Research, 1995. http://dx.doi.org/10.3386/t0175.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lo, Andrew, and A. Craig MacKinlay. Stock Market Prices Do Not Follow Random Walks: Evidence From a Simple Specification Test. National Bureau of Economic Research, 1987. http://dx.doi.org/10.3386/w2168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dshalalow, Jewgeni H. Random Walk Analysis in Antagonistic Stochastic Games. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada533481.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Morris, Richard. Solving random walk problems using resistive analogues. Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pompeu, Gustavo, and José Luiz Rossi. Real/Dollar Exchange Rate Prediction Combining Machine Learning and Fundamental Models. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004491.

Full text
Abstract:
The study of the predictability of exchange rates has been a very recurring theme on the economics literature for decades, and very often is not possible to beat a random walk prediction, particularly when trying to forecast short time periods. Although there are several studies about exchange rate forecasting in general, predictions of specifically Brazilian real (BRL) to United States dollar (USD) exchange rates are very hard to find in the literature. The objective of this work is to predict the specific BRL to USD exchange rates by applying machine learning models combined with fundamental
APA, Harvard, Vancouver, ISO, and other styles
9

Young, Richard M. Modeling Random Walk Processes In Human Concept Learning. Defense Technical Information Center, 2006. http://dx.doi.org/10.21236/ada462700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bacchetta, Philippe, and Eric van Wincoop. Random Walk Expectations and the Forward Discount Puzzle. National Bureau of Economic Research, 2007. http://dx.doi.org/10.3386/w13205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!