Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(collisions of random walks). Showing records 1 – 30 of 241256 total matches.

[1] [2] [3] [4] [5] … [8042]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Oregon

1. Montgomery, Aaron. Topics in Random Walks.

Degree: PhD, Department of Mathematics, 2013, University of Oregon

 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… (more)

Subjects/Keywords: balanced incomplete block designs; collisions of random walks; Markov chains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Montgomery, A. (2013). Topics in Random Walks. (Doctoral Dissertation). University of Oregon. Retrieved from http://hdl.handle.net/1794/13335

Chicago Manual of Style (16th Edition):

Montgomery, Aaron. “Topics in Random Walks.” 2013. Doctoral Dissertation, University of Oregon. Accessed August 05, 2020. http://hdl.handle.net/1794/13335.

MLA Handbook (7th Edition):

Montgomery, Aaron. “Topics in Random Walks.” 2013. Web. 05 Aug 2020.

Vancouver:

Montgomery A. Topics in Random Walks. [Internet] [Doctoral dissertation]. University of Oregon; 2013. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1794/13335.

Council of Science Editors:

Montgomery A. Topics in Random Walks. [Doctoral Dissertation]. University of Oregon; 2013. Available from: http://hdl.handle.net/1794/13335


University of Bath

2. Phetpradap, Parkpoom. Intersections of random walks.

Degree: PhD, 2011, University of Bath

 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… (more)

Subjects/Keywords: 519.282; Random walk; large deviation; intersections of random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Phetpradap, P. (2011). Intersections of random walks. (Doctoral Dissertation). University of Bath. Retrieved from https://researchportal.bath.ac.uk/en/studentthesis/intersections-of-random-walks(c8edb047-3e40-4cc2-9ab8-42e5bad36758).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548100

Chicago Manual of Style (16th Edition):

Phetpradap, Parkpoom. “Intersections of random walks.” 2011. Doctoral Dissertation, University of Bath. Accessed August 05, 2020. https://researchportal.bath.ac.uk/en/studentthesis/intersections-of-random-walks(c8edb047-3e40-4cc2-9ab8-42e5bad36758).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548100.

MLA Handbook (7th Edition):

Phetpradap, Parkpoom. “Intersections of random walks.” 2011. Web. 05 Aug 2020.

Vancouver:

Phetpradap P. Intersections of random walks. [Internet] [Doctoral dissertation]. University of Bath; 2011. [cited 2020 Aug 05]. Available from: https://researchportal.bath.ac.uk/en/studentthesis/intersections-of-random-walks(c8edb047-3e40-4cc2-9ab8-42e5bad36758).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548100.

Council of Science Editors:

Phetpradap P. Intersections of random walks. [Doctoral Dissertation]. University of Bath; 2011. Available from: https://researchportal.bath.ac.uk/en/studentthesis/intersections-of-random-walks(c8edb047-3e40-4cc2-9ab8-42e5bad36758).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.548100


University of Alberta

3. Sangi, Farzad. Ranking entities in heterogeneous multiple relation social networks using random walks.

Degree: MS, Department of Computing Science, 2011, University of Alberta

 A Social Network or Information Network is a structure made up of nodes representing entities, and edges representing the relationships among nodes. Understanding the behaviour… (more)

Subjects/Keywords: ranking; social networks; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sangi, F. (2011). Ranking entities in heterogeneous multiple relation social networks using random walks. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/ft848r479

Chicago Manual of Style (16th Edition):

Sangi, Farzad. “Ranking entities in heterogeneous multiple relation social networks using random walks.” 2011. Masters Thesis, University of Alberta. Accessed August 05, 2020. https://era.library.ualberta.ca/files/ft848r479.

MLA Handbook (7th Edition):

Sangi, Farzad. “Ranking entities in heterogeneous multiple relation social networks using random walks.” 2011. Web. 05 Aug 2020.

Vancouver:

Sangi F. Ranking entities in heterogeneous multiple relation social networks using random walks. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Aug 05]. Available from: https://era.library.ualberta.ca/files/ft848r479.

Council of Science Editors:

Sangi F. Ranking entities in heterogeneous multiple relation social networks using random walks. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/ft848r479


University of Newcastle

4. Rogers, Cameron. On the interconnectedness, via random walks, of cogrowth rates and the Følner function.

Degree: PhD, 2017, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Amenability can be characterised in many ways, and many of these characterisations employ limits. This thesis investigates the… (more)

Subjects/Keywords: random walks; group theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rogers, C. (2017). On the interconnectedness, via random walks, of cogrowth rates and the Følner function. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1333797

Chicago Manual of Style (16th Edition):

Rogers, Cameron. “On the interconnectedness, via random walks, of cogrowth rates and the Følner function.” 2017. Doctoral Dissertation, University of Newcastle. Accessed August 05, 2020. http://hdl.handle.net/1959.13/1333797.

MLA Handbook (7th Edition):

Rogers, Cameron. “On the interconnectedness, via random walks, of cogrowth rates and the Følner function.” 2017. Web. 05 Aug 2020.

Vancouver:

Rogers C. On the interconnectedness, via random walks, of cogrowth rates and the Følner function. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1959.13/1333797.

Council of Science Editors:

Rogers C. On the interconnectedness, via random walks, of cogrowth rates and the Følner function. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1333797

5. Villagra, Marcos. Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: Random Walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Villagra, M. (n.d.). Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/6275

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Villagra, Marcos. “Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed August 05, 2020. http://hdl.handle.net/10061/6275.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Villagra, Marcos. “Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク.” Web. 05 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Villagra M. Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10061/6275.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Villagra M. Quantum Walks with Phase Parameters : 位相パラメータを用いた量子ウォーク; イソウ パラメータ オ モチイタ リョウシ ウォーク. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/6275

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Waterloo

6. van Bommel, Christopher Martin. Quantum Walks and Pretty Good State transfer on Paths.

Degree: 2019, University of Waterloo

 Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges… (more)

Subjects/Keywords: Random walks (Mathematics); Quantum computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

van Bommel, C. M. (2019). Quantum Walks and Pretty Good State transfer on Paths. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

van Bommel, Christopher Martin. “Quantum Walks and Pretty Good State transfer on Paths.” 2019. Thesis, University of Waterloo. Accessed August 05, 2020. http://hdl.handle.net/10012/14935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

van Bommel, Christopher Martin. “Quantum Walks and Pretty Good State transfer on Paths.” 2019. Web. 05 Aug 2020.

Vancouver:

van Bommel CM. Quantum Walks and Pretty Good State transfer on Paths. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10012/14935.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

van Bommel CM. Quantum Walks and Pretty Good State transfer on Paths. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14935

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Toronto

7. Stewart, Andrew. On the Range of the Random Walk Bridge on the Regular Tree.

Degree: PhD, 2016, University of Toronto

 Consider a nearest neighbour random walk Xn on the d-regular tree \Td, where d ≥  3, conditioned on Xn = X0. This is known as the… (more)

Subjects/Keywords: Probability; Random walks; Tree; 0405

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stewart, A. (2016). On the Range of the Random Walk Bridge on the Regular Tree. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/77439

Chicago Manual of Style (16th Edition):

Stewart, Andrew. “On the Range of the Random Walk Bridge on the Regular Tree.” 2016. Doctoral Dissertation, University of Toronto. Accessed August 05, 2020. http://hdl.handle.net/1807/77439.

MLA Handbook (7th Edition):

Stewart, Andrew. “On the Range of the Random Walk Bridge on the Regular Tree.” 2016. Web. 05 Aug 2020.

Vancouver:

Stewart A. On the Range of the Random Walk Bridge on the Regular Tree. [Internet] [Doctoral dissertation]. University of Toronto; 2016. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1807/77439.

Council of Science Editors:

Stewart A. On the Range of the Random Walk Bridge on the Regular Tree. [Doctoral Dissertation]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/77439


University of Tasmania

8. Alghofari, AR. Applications of representation theory.

Degree: 1998, University of Tasmania

 This thesis presents two applications of representation theory of locally compact groups. The first is concerned with random walks, the second with Mackey's Intertwining Number… (more)

Subjects/Keywords: Representations of groups; Representations of algebras; Random walks (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alghofari, A. (1998). Applications of representation theory. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/19056/1/whole_AlghofariAbdulR1998_thesis.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Alghofari, AR. “Applications of representation theory.” 1998. Thesis, University of Tasmania. Accessed August 05, 2020. https://eprints.utas.edu.au/19056/1/whole_AlghofariAbdulR1998_thesis.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Alghofari, AR. “Applications of representation theory.” 1998. Web. 05 Aug 2020.

Vancouver:

Alghofari A. Applications of representation theory. [Internet] [Thesis]. University of Tasmania; 1998. [cited 2020 Aug 05]. Available from: https://eprints.utas.edu.au/19056/1/whole_AlghofariAbdulR1998_thesis.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alghofari A. Applications of representation theory. [Thesis]. University of Tasmania; 1998. Available from: https://eprints.utas.edu.au/19056/1/whole_AlghofariAbdulR1998_thesis.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Temple University

9. Lagro, Matthew Patrick. A Perron-Frobenius Type of Theorem for Quantum Operations.

Degree: PhD, 2015, Temple University

Mathematics

Quantum random walks are a generalization of classical Markovian random walks to a quantum mechanical or quantum computing setting. Quantum walks have promising applications… (more)

Subjects/Keywords: Mathematics;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lagro, M. P. (2015). A Perron-Frobenius Type of Theorem for Quantum Operations. (Doctoral Dissertation). Temple University. Retrieved from http://digital.library.temple.edu/u?/p245801coll10,339694

Chicago Manual of Style (16th Edition):

Lagro, Matthew Patrick. “A Perron-Frobenius Type of Theorem for Quantum Operations.” 2015. Doctoral Dissertation, Temple University. Accessed August 05, 2020. http://digital.library.temple.edu/u?/p245801coll10,339694.

MLA Handbook (7th Edition):

Lagro, Matthew Patrick. “A Perron-Frobenius Type of Theorem for Quantum Operations.” 2015. Web. 05 Aug 2020.

Vancouver:

Lagro MP. A Perron-Frobenius Type of Theorem for Quantum Operations. [Internet] [Doctoral dissertation]. Temple University; 2015. [cited 2020 Aug 05]. Available from: http://digital.library.temple.edu/u?/p245801coll10,339694.

Council of Science Editors:

Lagro MP. A Perron-Frobenius Type of Theorem for Quantum Operations. [Doctoral Dissertation]. Temple University; 2015. Available from: http://digital.library.temple.edu/u?/p245801coll10,339694


Macquarie University

10. Lehman, Lauri. Statistical effects in anyonic quantum walks.

Degree: 2013, Macquarie University

"A thesis submitted to Macquarie University for the degree of Doctor of Philosophy Department of Physics and Astronomy June 2013"

1. Introduction  – 2. Anyonic… (more)

Subjects/Keywords: Anyons; Random walks (Mathematics); Ising model; Quantum walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lehman, L. (2013). Statistical effects in anyonic quantum walks. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/280533

Chicago Manual of Style (16th Edition):

Lehman, Lauri. “Statistical effects in anyonic quantum walks.” 2013. Doctoral Dissertation, Macquarie University. Accessed August 05, 2020. http://hdl.handle.net/1959.14/280533.

MLA Handbook (7th Edition):

Lehman, Lauri. “Statistical effects in anyonic quantum walks.” 2013. Web. 05 Aug 2020.

Vancouver:

Lehman L. Statistical effects in anyonic quantum walks. [Internet] [Doctoral dissertation]. Macquarie University; 2013. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1959.14/280533.

Council of Science Editors:

Lehman L. Statistical effects in anyonic quantum walks. [Doctoral Dissertation]. Macquarie University; 2013. Available from: http://hdl.handle.net/1959.14/280533


University of Lund

11. Nguyen, Tuan-Minh. Random Geometry and Reinforced Jump Processes.

Degree: 2017, University of Lund

 This thesis comprises three papers studying several mathematical models related to geometric Markov processes and random processes with reinforcements. The main goal of these works… (more)

Subjects/Keywords: Probability Theory and Statistics; random polygons; products of random matrices; vertex-reinforced jump processes; pseudotrajectories; random walks in simplexes; Markov chains in a general state space

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nguyen, T. (2017). Random Geometry and Reinforced Jump Processes. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/1a0c3c32-10a4-4207-aba8-ce3e164f1ce3 ; https://portal.research.lu.se/ws/files/35836509/Minh_Thesis.pdf

Chicago Manual of Style (16th Edition):

Nguyen, Tuan-Minh. “Random Geometry and Reinforced Jump Processes.” 2017. Doctoral Dissertation, University of Lund. Accessed August 05, 2020. https://lup.lub.lu.se/record/1a0c3c32-10a4-4207-aba8-ce3e164f1ce3 ; https://portal.research.lu.se/ws/files/35836509/Minh_Thesis.pdf.

MLA Handbook (7th Edition):

Nguyen, Tuan-Minh. “Random Geometry and Reinforced Jump Processes.” 2017. Web. 05 Aug 2020.

Vancouver:

Nguyen T. Random Geometry and Reinforced Jump Processes. [Internet] [Doctoral dissertation]. University of Lund; 2017. [cited 2020 Aug 05]. Available from: https://lup.lub.lu.se/record/1a0c3c32-10a4-4207-aba8-ce3e164f1ce3 ; https://portal.research.lu.se/ws/files/35836509/Minh_Thesis.pdf.

Council of Science Editors:

Nguyen T. Random Geometry and Reinforced Jump Processes. [Doctoral Dissertation]. University of Lund; 2017. Available from: https://lup.lub.lu.se/record/1a0c3c32-10a4-4207-aba8-ce3e164f1ce3 ; https://portal.research.lu.se/ws/files/35836509/Minh_Thesis.pdf


University of Victoria

12. Anwar, Shahed. A Simulation Study of Walks in Large Social Graphs.

Degree: Department of Computer Science, 2015, University of Victoria

 Online Social Networks (OSNs) such as Facebook, Twitter, and YouTube are among the most popular sites on the Internet. Billions of users are connected through… (more)

Subjects/Keywords: Random Walks; K-Avoiding Random Walk; Neighborhood-Avoiding Random Walk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Anwar, S. (2015). A Simulation Study of Walks in Large Social Graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6785

Chicago Manual of Style (16th Edition):

Anwar, Shahed. “A Simulation Study of Walks in Large Social Graphs.” 2015. Masters Thesis, University of Victoria. Accessed August 05, 2020. http://hdl.handle.net/1828/6785.

MLA Handbook (7th Edition):

Anwar, Shahed. “A Simulation Study of Walks in Large Social Graphs.” 2015. Web. 05 Aug 2020.

Vancouver:

Anwar S. A Simulation Study of Walks in Large Social Graphs. [Internet] [Masters thesis]. University of Victoria; 2015. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1828/6785.

Council of Science Editors:

Anwar S. A Simulation Study of Walks in Large Social Graphs. [Masters Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6785


Oregon State University

13. Almonacid-Merino, Sergio Felipe. Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue.

Degree: PhD, Bioresource Engineering, 2005, Oregon State University

 Mass transfer processes in food systems, such as solute infusion, are poorly understood because of their complex nature. Food systems contain porous matrices and a… (more)

Subjects/Keywords: Random walks (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Almonacid-Merino, S. F. (2005). Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/28671

Chicago Manual of Style (16th Edition):

Almonacid-Merino, Sergio Felipe. “Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue.” 2005. Doctoral Dissertation, Oregon State University. Accessed August 05, 2020. http://hdl.handle.net/1957/28671.

MLA Handbook (7th Edition):

Almonacid-Merino, Sergio Felipe. “Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue.” 2005. Web. 05 Aug 2020.

Vancouver:

Almonacid-Merino SF. Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue. [Internet] [Doctoral dissertation]. Oregon State University; 2005. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1957/28671.

Council of Science Editors:

Almonacid-Merino SF. Monte Carlo random walk simulation as a complement to experimental and theoretical approaches : application to mass transfer in fish muscle tissue. [Doctoral Dissertation]. Oregon State University; 2005. Available from: http://hdl.handle.net/1957/28671


Portland State University

14. Morris, Richard D. Solving random walk problems using resistive analogues.

Degree: MS(M.S.) in Applied Science, Applied Science, 1968, Portland State University

  The classical method of solving random walk problems involves using Markov chain theory. When the particular random walk of interest is written in matrix… (more)

Subjects/Keywords: Random walks (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Morris, R. D. (1968). Solving random walk problems using resistive analogues. (Masters Thesis). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/529

Chicago Manual of Style (16th Edition):

Morris, Richard D. “Solving random walk problems using resistive analogues.” 1968. Masters Thesis, Portland State University. Accessed August 05, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/529.

MLA Handbook (7th Edition):

Morris, Richard D. “Solving random walk problems using resistive analogues.” 1968. Web. 05 Aug 2020.

Vancouver:

Morris RD. Solving random walk problems using resistive analogues. [Internet] [Masters thesis]. Portland State University; 1968. [cited 2020 Aug 05]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/529.

Council of Science Editors:

Morris RD. Solving random walk problems using resistive analogues. [Masters Thesis]. Portland State University; 1968. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/529

15. Tabrizi, Mandana. Rosenbluth Algorithm Studies of Self-Avoiding Walks.

Degree: MSc -MS, Applied and Industrial Mathematics, 2015, York University

 In this thesis we used self-avoiding walks as a model of linear polymers to study some of the most fundamental questions about polymers- namely the… (more)

Subjects/Keywords: Mathematics; Rosenbluth algorithm; self-avoiding random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tabrizi, M. (2015). Rosenbluth Algorithm Studies of Self-Avoiding Walks. (Masters Thesis). York University. Retrieved from http://hdl.handle.net/10315/30743

Chicago Manual of Style (16th Edition):

Tabrizi, Mandana. “Rosenbluth Algorithm Studies of Self-Avoiding Walks.” 2015. Masters Thesis, York University. Accessed August 05, 2020. http://hdl.handle.net/10315/30743.

MLA Handbook (7th Edition):

Tabrizi, Mandana. “Rosenbluth Algorithm Studies of Self-Avoiding Walks.” 2015. Web. 05 Aug 2020.

Vancouver:

Tabrizi M. Rosenbluth Algorithm Studies of Self-Avoiding Walks. [Internet] [Masters thesis]. York University; 2015. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10315/30743.

Council of Science Editors:

Tabrizi M. Rosenbluth Algorithm Studies of Self-Avoiding Walks. [Masters Thesis]. York University; 2015. Available from: http://hdl.handle.net/10315/30743


University of Adelaide

16. Bridges, Lachlan. In the mood for food: Markov-modulated models for animal foraging.

Degree: 2019, University of Adelaide

 Early theoretical models of animal foraging determined that Lévy flights were an optimal search strategy in a number of different scenarios. However, a new family… (more)

Subjects/Keywords: animal foraging; random walks; Markov modulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bridges, L. (2019). In the mood for food: Markov-modulated models for animal foraging. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/120475

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bridges, Lachlan. “In the mood for food: Markov-modulated models for animal foraging.” 2019. Thesis, University of Adelaide. Accessed August 05, 2020. http://hdl.handle.net/2440/120475.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bridges, Lachlan. “In the mood for food: Markov-modulated models for animal foraging.” 2019. Web. 05 Aug 2020.

Vancouver:

Bridges L. In the mood for food: Markov-modulated models for animal foraging. [Internet] [Thesis]. University of Adelaide; 2019. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/2440/120475.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bridges L. In the mood for food: Markov-modulated models for animal foraging. [Thesis]. University of Adelaide; 2019. Available from: http://hdl.handle.net/2440/120475

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Fletcher, Robert Brian. Energy efficient compressed sensing in wireless sensor networks via random walk.

Degree: 2011, University of Tennessee – Chattanooga

 In this paper, we explore the problem of data acquisition using compressive sensing (CS) in wireless sensor networks. Unique properties of wireless sensor networks require… (more)

Subjects/Keywords: Random walks (Mathematics); Wireless sensor networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fletcher, R. B. (2011). Energy efficient compressed sensing in wireless sensor networks via random walk. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/65

Chicago Manual of Style (16th Edition):

Fletcher, Robert Brian. “Energy efficient compressed sensing in wireless sensor networks via random walk.” 2011. Masters Thesis, University of Tennessee – Chattanooga. Accessed August 05, 2020. https://scholar.utc.edu/theses/65.

MLA Handbook (7th Edition):

Fletcher, Robert Brian. “Energy efficient compressed sensing in wireless sensor networks via random walk.” 2011. Web. 05 Aug 2020.

Vancouver:

Fletcher RB. Energy efficient compressed sensing in wireless sensor networks via random walk. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2011. [cited 2020 Aug 05]. Available from: https://scholar.utc.edu/theses/65.

Council of Science Editors:

Fletcher RB. Energy efficient compressed sensing in wireless sensor networks via random walk. [Masters Thesis]. University of Tennessee – Chattanooga; 2011. Available from: https://scholar.utc.edu/theses/65


University of Minnesota

18. Boghrati, Baktash. Application of random walks for the analysis of power grids in modern VLSI chips.

Degree: Electrical Engineering, 2013, University of Minnesota

 Power grid design and analysis is a critical part of modern VLSI chip design and demands tools for accurate modeling and efficient analysis. In this… (more)

Subjects/Keywords: Incremental solver; Power grids; Random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Boghrati, B. (2013). Application of random walks for the analysis of power grids in modern VLSI chips. (Thesis). University of Minnesota. Retrieved from http://purl.umn.edu/157738

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Boghrati, Baktash. “Application of random walks for the analysis of power grids in modern VLSI chips.” 2013. Thesis, University of Minnesota. Accessed August 05, 2020. http://purl.umn.edu/157738.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Boghrati, Baktash. “Application of random walks for the analysis of power grids in modern VLSI chips.” 2013. Web. 05 Aug 2020.

Vancouver:

Boghrati B. Application of random walks for the analysis of power grids in modern VLSI chips. [Internet] [Thesis]. University of Minnesota; 2013. [cited 2020 Aug 05]. Available from: http://purl.umn.edu/157738.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Boghrati B. Application of random walks for the analysis of power grids in modern VLSI chips. [Thesis]. University of Minnesota; 2013. Available from: http://purl.umn.edu/157738

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arizona

19. Kaigh, William Daniel, 1944-. THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO .

Degree: 1973, University of Arizona

Subjects/Keywords: Random walks (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kaigh, William Daniel, 1. (1973). THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/288119

Chicago Manual of Style (16th Edition):

Kaigh, William Daniel, 1944-. “THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO .” 1973. Doctoral Dissertation, University of Arizona. Accessed August 05, 2020. http://hdl.handle.net/10150/288119.

MLA Handbook (7th Edition):

Kaigh, William Daniel, 1944-. “THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO .” 1973. Web. 05 Aug 2020.

Vancouver:

Kaigh, William Daniel 1. THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO . [Internet] [Doctoral dissertation]. University of Arizona; 1973. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10150/288119.

Council of Science Editors:

Kaigh, William Daniel 1. THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO . [Doctoral Dissertation]. University of Arizona; 1973. Available from: http://hdl.handle.net/10150/288119

20. Zeng, Xiaolin. Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators.

Degree: Docteur es, Mathématiques, 2015, Université Claude Bernard – Lyon I

Cette thèse s'intéresse à deux modèles de processus auto intéagissant étroitement reliés: le processus de sauts renforcé par sites (VRJP) et la marche aléatoire renforcée… (more)

Subjects/Keywords: Marches aléatoires renforcées; Marches aléatoires en milieux aléatoires; Schrödinger aléatoires; Reinforced random walks; Random walks in random environments; Random Schrödinger; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zeng, X. (2015). Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2015LYO10252

Chicago Manual of Style (16th Edition):

Zeng, Xiaolin. “Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators.” 2015. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed August 05, 2020. http://www.theses.fr/2015LYO10252.

MLA Handbook (7th Edition):

Zeng, Xiaolin. “Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators.” 2015. Web. 05 Aug 2020.

Vancouver:

Zeng X. Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2015. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2015LYO10252.

Council of Science Editors:

Zeng X. Marches aléatoires renforcées et opérateurs de Schrödinger aléatoires : Reinforced random walks and Random Schrödinger operators. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2015. Available from: http://www.theses.fr/2015LYO10252

21. Noren, Steven Ronald. Topics in self-interacting random walks.

Degree: 2017, Iowa State University

 In this thesis, we will show results on two different self-interacting random walk models on ∈ts. First, we observe the frog model, an infinite system… (more)

Subjects/Keywords: favorite sites of random walks; frog model; hypergeometric functions; persistent random walks; Ray-Knight theorems; self-interacting random walks; Mathematics

…1 CHAPTER 1. INTRODUCTION Self-interacting random walks are a broad category of… …of simple random walks. Chapter 3 will be organized in the following way. After introducing… …RANGE OF THE TRANSIENT FROG MODEL ON Z Consider the following interacting random walks model… …can consider a standard hierarchical coupling of the underlying random walks leading to the… …x5B;29]. The second chapter extends a proof of a simple random walk conjecture from… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Noren, S. R. (2017). Topics in self-interacting random walks. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/15592

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Noren, Steven Ronald. “Topics in self-interacting random walks.” 2017. Thesis, Iowa State University. Accessed August 05, 2020. https://lib.dr.iastate.edu/etd/15592.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Noren, Steven Ronald. “Topics in self-interacting random walks.” 2017. Web. 05 Aug 2020.

Vancouver:

Noren SR. Topics in self-interacting random walks. [Internet] [Thesis]. Iowa State University; 2017. [cited 2020 Aug 05]. Available from: https://lib.dr.iastate.edu/etd/15592.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Noren SR. Topics in self-interacting random walks. [Thesis]. Iowa State University; 2017. Available from: https://lib.dr.iastate.edu/etd/15592

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Ραπτόπουλος, Χριστόφορος. Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα.

Degree: 2008, University of Patras

Έστω V ένα σύνολο n κορυφών και έστω {\cal M} ένα πεπερασμένα αριθμήσιμο σύνολο m ετικετών. Ένα γράφημα ετικετών προκύπτει αν αντιστοιχήσουμε σε κάθε κορυφή… (more)

Subjects/Keywords: Τυχαία γραφήματα τομής ετικετών; Στοχαστικές διεργασίες; Κύκλος Hamilton; Επεκτασιμότητα; Τυχαίοι περίπατοι; Ανεξάρτητα σύνολα κορυφών; 511.5; Random intersection Graphs Model; Stochastic procedures; Hamilton cycle; Expansion; Random walks; Independed sets of vertices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ραπτόπουλος, . (2008). Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα. (Doctoral Dissertation). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/2107

Chicago Manual of Style (16th Edition):

Ραπτόπουλος, Χριστόφορος. “Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα.” 2008. Doctoral Dissertation, University of Patras. Accessed August 05, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/2107.

MLA Handbook (7th Edition):

Ραπτόπουλος, Χριστόφορος. “Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα.” 2008. Web. 05 Aug 2020.

Vancouver:

Ραπτόπουλος . Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα. [Internet] [Doctoral dissertation]. University of Patras; 2008. [cited 2020 Aug 05]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2107.

Council of Science Editors:

Ραπτόπουλος . Σχεδιασμός και ανάλυση αλγορίθμων για τυχαία εξελικτικά δίκτυα. [Doctoral Dissertation]. University of Patras; 2008. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/2107


University of Alberta

23. Shen, Rui. Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis.

Degree: PhD, Department of Computing Science, 2012, University of Alberta

 Many problems in digital image processing and analysis can be interpreted as labeling problems, which aim to find the optimal mapping from a set of… (more)

Subjects/Keywords: Random fields; Labeling problems; Image fusion; Stereo correspondence; Random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shen, R. (2012). Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/9g54xk26n

Chicago Manual of Style (16th Edition):

Shen, Rui. “Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis.” 2012. Doctoral Dissertation, University of Alberta. Accessed August 05, 2020. https://era.library.ualberta.ca/files/9g54xk26n.

MLA Handbook (7th Edition):

Shen, Rui. “Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis.” 2012. Web. 05 Aug 2020.

Vancouver:

Shen R. Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis. [Internet] [Doctoral dissertation]. University of Alberta; 2012. [cited 2020 Aug 05]. Available from: https://era.library.ualberta.ca/files/9g54xk26n.

Council of Science Editors:

Shen R. Probabilistic Methods for Discrete Labeling Problems in Digital Image Processing and Analysis. [Doctoral Dissertation]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/9g54xk26n


Macquarie University

24. Motes, Keith R. Routes towards optical quantum technology: new architectures and applications.

Degree: 2016, Macquarie University

Thesis by publication.

Bibliography: pages 131-144.

1. Introduction to linear optical quantum computing  – 2. Quantum random walks on congested lattices and the Effect of… (more)

Subjects/Keywords: Quantum computing; Bosons; quantum; Boson sampling; computational complexity; architectures; computing; optics; light; random walks; cats; single photon; error correction; integrals; other states of light

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Motes, K. R. (2016). Routes towards optical quantum technology: new architectures and applications. (Doctoral Dissertation). Macquarie University. Retrieved from http://hdl.handle.net/1959.14/1253808

Chicago Manual of Style (16th Edition):

Motes, Keith R. “Routes towards optical quantum technology: new architectures and applications.” 2016. Doctoral Dissertation, Macquarie University. Accessed August 05, 2020. http://hdl.handle.net/1959.14/1253808.

MLA Handbook (7th Edition):

Motes, Keith R. “Routes towards optical quantum technology: new architectures and applications.” 2016. Web. 05 Aug 2020.

Vancouver:

Motes KR. Routes towards optical quantum technology: new architectures and applications. [Internet] [Doctoral dissertation]. Macquarie University; 2016. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1959.14/1253808.

Council of Science Editors:

Motes KR. Routes towards optical quantum technology: new architectures and applications. [Doctoral Dissertation]. Macquarie University; 2016. Available from: http://hdl.handle.net/1959.14/1253808

25. Αγγελόπουλος, Κωνσταντίνος Μάριος. Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων.

Degree: 2013, University of Patras

 Το Διαδίκτυο αναμφίβολα αποτελεί την μεγαλύτερη ανακάλυψη στον τομέα διάδοσης της πληροφορίας από την εποχή του Γουτεμβέργιου και της τυπογραφίας, έχοντας ριζικά αλλάξει τον τρόπο… (more)

Subjects/Keywords: Ασύρματα δίκτυα αισθητήρων; Αποδοτικά πρωτόκολλα; Θέματα κίνησης; Τυχαίοι περίπατοι; Ηλεκτρομαγνητική ακτινοβολία; Διαδίκτυο των αντικειμένων; Συλλογή δεδομένων; 004.6; Wireless sensor networks; Efficient protocols; Mobility; Data collection; Internet of things; Random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Αγγελόπουλος, . . (2013). Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων. (Doctoral Dissertation). University of Patras. Retrieved from http://hdl.handle.net/10889/6384

Chicago Manual of Style (16th Edition):

Αγγελόπουλος, Κωνσταντίνος Μάριος. “Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων.” 2013. Doctoral Dissertation, University of Patras. Accessed August 05, 2020. http://hdl.handle.net/10889/6384.

MLA Handbook (7th Edition):

Αγγελόπουλος, Κωνσταντίνος Μάριος. “Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων.” 2013. Web. 05 Aug 2020.

Vancouver:

Αγγελόπουλος . Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων. [Internet] [Doctoral dissertation]. University of Patras; 2013. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10889/6384.

Council of Science Editors:

Αγγελόπουλος . Αποδοτικά πρωτόκολλα συλλογής δεδομένων σε ασύρματα δίκτυα αισθητήρων. [Doctoral Dissertation]. University of Patras; 2013. Available from: http://hdl.handle.net/10889/6384


University of Oxford

26. Giasemidis, Georgios. Spectral dimension in graph models of causal quantum gravity.

Degree: PhD, 2013, University of Oxford

 The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed… (more)

Subjects/Keywords: 539; Theoretical physics; quantum gravity; lattice quantum gravity; spectral dimension; random walks; random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Giasemidis, G. (2013). Spectral dimension in graph models of causal quantum gravity. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415

Chicago Manual of Style (16th Edition):

Giasemidis, Georgios. “Spectral dimension in graph models of causal quantum gravity.” 2013. Doctoral Dissertation, University of Oxford. Accessed August 05, 2020. http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415.

MLA Handbook (7th Edition):

Giasemidis, Georgios. “Spectral dimension in graph models of causal quantum gravity.” 2013. Web. 05 Aug 2020.

Vancouver:

Giasemidis G. Spectral dimension in graph models of causal quantum gravity. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2020 Aug 05]. Available from: http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415.

Council of Science Editors:

Giasemidis G. Spectral dimension in graph models of causal quantum gravity. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:d0aaa6f2-dd0b-4ea9-81c1-7c9e81a7229e ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588415

27. Huynh, Cong Bang. Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics.

Degree: Docteur es, Mathématiques, 2019, Université Grenoble Alpes (ComUE)

Cette thèse se situe à l'interface entre combinatoire et probabilités,et contribue à l'étude de différents modèles issus de la mécanique statistique : polymères, marches aléatoires… (more)

Subjects/Keywords: Probabilités; Cartes aléatoires; Marches aléatoires; Mécanique statistique; Probability; Random maps; Random walks; Statistical mechanics; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Huynh, C. B. (2019). Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2019GREAM026

Chicago Manual of Style (16th Edition):

Huynh, Cong Bang. “Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics.” 2019. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed August 05, 2020. http://www.theses.fr/2019GREAM026.

MLA Handbook (7th Edition):

Huynh, Cong Bang. “Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics.” 2019. Web. 05 Aug 2020.

Vancouver:

Huynh CB. Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2019. [cited 2020 Aug 05]. Available from: http://www.theses.fr/2019GREAM026.

Council of Science Editors:

Huynh CB. Une promenade aléatoire entre combinatoire et mécanique statistique : A random hike between combinatorics and statistical mechanics. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2019. Available from: http://www.theses.fr/2019GREAM026


Stellenbosch University

28. Oosthuizen, Joubert. Random walk hitting times in random trees.

Degree: PhD, Mathematical Sciences, 2017, Stellenbosch University

ENGLISH ABSTRACT : The hitting time Hxy, between two vertices x and y of a graph, is the average time that the standard simple random(more)

Subjects/Keywords: Combinatorial probabilities; Probabilities; Random trees (Mathematics); Random walks (Mathematics); Wiener index; UCTD; Dickman distributions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Oosthuizen, J. (2017). Random walk hitting times in random trees. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/102727

Chicago Manual of Style (16th Edition):

Oosthuizen, Joubert. “Random walk hitting times in random trees.” 2017. Doctoral Dissertation, Stellenbosch University. Accessed August 05, 2020. http://hdl.handle.net/10019.1/102727.

MLA Handbook (7th Edition):

Oosthuizen, Joubert. “Random walk hitting times in random trees.” 2017. Web. 05 Aug 2020.

Vancouver:

Oosthuizen J. Random walk hitting times in random trees. [Internet] [Doctoral dissertation]. Stellenbosch University; 2017. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10019.1/102727.

Council of Science Editors:

Oosthuizen J. Random walk hitting times in random trees. [Doctoral Dissertation]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/102727


University of California – Berkeley

29. Ding, Jian. Mixing time for the Ising model and random walks.

Degree: Statistics, 2011, University of California – Berkeley

 In this thesis we study the mixing times of Markov chains, e.g., therate of convergence of Markov chains to stationary measures. Wefocus on Glauber dynamics… (more)

Subjects/Keywords: Mathematics; Glauber dynamics; Ising model; mixing time; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ding, J. (2011). Mixing time for the Ising model and random walks. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2b54v885

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ding, Jian. “Mixing time for the Ising model and random walks.” 2011. Thesis, University of California – Berkeley. Accessed August 05, 2020. http://www.escholarship.org/uc/item/2b54v885.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ding, Jian. “Mixing time for the Ising model and random walks.” 2011. Web. 05 Aug 2020.

Vancouver:

Ding J. Mixing time for the Ising model and random walks. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/2b54v885.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ding J. Mixing time for the Ising model and random walks. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2b54v885

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Ryerson University

30. Rzeszutek, Richard. Image segmentation through the scale-space random walker.

Degree: 2009, Ryerson University

 This thesis proposes an extension to the Random Walks assisted segmentation algorithm that allows it to operate on a scale-space. Scale-space is a multi-resolution signal… (more)

Subjects/Keywords: Image processing  – Mathematics; Random walks (Mathematics); Computer vision; Image processing  – Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rzeszutek, R. (2009). Image segmentation through the scale-space random walker. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1295

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rzeszutek, Richard. “Image segmentation through the scale-space random walker.” 2009. Thesis, Ryerson University. Accessed August 05, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1295.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rzeszutek, Richard. “Image segmentation through the scale-space random walker.” 2009. Web. 05 Aug 2020.

Vancouver:

Rzeszutek R. Image segmentation through the scale-space random walker. [Internet] [Thesis]. Ryerson University; 2009. [cited 2020 Aug 05]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1295.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rzeszutek R. Image segmentation through the scale-space random walker. [Thesis]. Ryerson University; 2009. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1295

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [8042]

.