Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Markov chains)`

.
Showing records 1 – 30 of
376 total matches.

◁ [1] [2] [3] [4] [5] … [13] ▶

Search Limiters

Dates

- 2017 – 2021 (89)
- 2012 – 2016 (155)
- 2007 – 2011 (96)
- 2002 – 2006 (20)
- 1997 – 2001 (18)

Universities

- University of Florida (27)
- Universidade do Rio Grande do Norte (12)
- Georgia Tech (11)
- University of São Paulo (11)

Department

- Statistics (14)
- Mathematics (12)
- Informatique (11)
- Electrical and Computer Engineering (10)

Degrees

- PhD (94)
- Docteur es (53)
- MS (21)

Languages

- English (172)
- French (33)
- Portuguese (33)
- Greek (21)

▼ Search Limiters

1.
Wicks, John Randolph.
An Algorithm to Compute the Stochastically Stable
Distribution of a Perturbed *Markov* Matrix.

Degree: PhD, Computer Science, 2009, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:92/

► Recently, some researchers have attempted to exploit state-aggregation techniques to compute stable distributions of high-dimensional *Markov* matrices. While these researchers have devised an efficient, recursive…
(more)

Subjects/Keywords: Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wicks, J. R. (2009). An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:92/

Chicago Manual of Style (16^{th} Edition):

Wicks, John Randolph. “An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix.” 2009. Doctoral Dissertation, Brown University. Accessed March 01, 2021. https://repository.library.brown.edu/studio/item/bdr:92/.

MLA Handbook (7^{th} Edition):

Wicks, John Randolph. “An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix.” 2009. Web. 01 Mar 2021.

Vancouver:

Wicks JR. An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2021 Mar 01]. Available from: https://repository.library.brown.edu/studio/item/bdr:92/.

Council of Science Editors:

Wicks JR. An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix. [Doctoral Dissertation]. Brown University; 2009. Available from: https://repository.library.brown.edu/studio/item/bdr:92/

2. Sudyko, Elena. Dollarisation finançière en Russie : Financial dollarization in Russia.

Degree: Docteur es, Sciences de gestion, 2018, Université Paris-Saclay (ComUE)

URL: http://www.theses.fr/2018SACLE032

►

Le travail développe un modèle de portfolio à propos de la dollarisation financière (FD), et l'estime pour la Russie. La contribution de ce travail sera… (more)

Subjects/Keywords: Chaines de Markov; Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sudyko, E. (2018). Dollarisation finançière en Russie : Financial dollarization in Russia. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2018SACLE032

Chicago Manual of Style (16^{th} Edition):

Sudyko, Elena. “Dollarisation finançière en Russie : Financial dollarization in Russia.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed March 01, 2021. http://www.theses.fr/2018SACLE032.

MLA Handbook (7^{th} Edition):

Sudyko, Elena. “Dollarisation finançière en Russie : Financial dollarization in Russia.” 2018. Web. 01 Mar 2021.

Vancouver:

Sudyko E. Dollarisation finançière en Russie : Financial dollarization in Russia. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2021 Mar 01]. Available from: http://www.theses.fr/2018SACLE032.

Council of Science Editors:

Sudyko E. Dollarisation finançière en Russie : Financial dollarization in Russia. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLE032

Universiteit Utrecht

3. Schelling, W.D. Analyzing a queueing network.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/307053

► The purpose of the thesis is to help ING Bank to get a better understanding of their ICT landscape. Since the ICT landscape of ING…
(more)

Subjects/Keywords: queueing theory; markov chains; simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schelling, W. D. (2015). Analyzing a queueing network. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/307053

Chicago Manual of Style (16^{th} Edition):

Schelling, W D. “Analyzing a queueing network.” 2015. Masters Thesis, Universiteit Utrecht. Accessed March 01, 2021. http://dspace.library.uu.nl:8080/handle/1874/307053.

MLA Handbook (7^{th} Edition):

Schelling, W D. “Analyzing a queueing network.” 2015. Web. 01 Mar 2021.

Vancouver:

Schelling WD. Analyzing a queueing network. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2021 Mar 01]. Available from: http://dspace.library.uu.nl:8080/handle/1874/307053.

Council of Science Editors:

Schelling WD. Analyzing a queueing network. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/307053

University of Edinburgh

4. Apted, William D.F. Modelling Tourist Movements and Trends in the City of Edinburgh.

Degree: 2012, University of Edinburgh

URL: http://hdl.handle.net/1842/6353

► Abstract There is a great deal of interest, socioeconomically, in knowing the patterns and trends of the movements of groups of people, including the probability…
(more)

Subjects/Keywords: Markov Chains; Tourist Modelling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Apted, W. D. F. (2012). Modelling Tourist Movements and Trends in the City of Edinburgh. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/6353

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Apted, William D F. “Modelling Tourist Movements and Trends in the City of Edinburgh.” 2012. Thesis, University of Edinburgh. Accessed March 01, 2021. http://hdl.handle.net/1842/6353.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Apted, William D F. “Modelling Tourist Movements and Trends in the City of Edinburgh.” 2012. Web. 01 Mar 2021.

Vancouver:

Apted WDF. Modelling Tourist Movements and Trends in the City of Edinburgh. [Internet] [Thesis]. University of Edinburgh; 2012. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1842/6353.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Apted WDF. Modelling Tourist Movements and Trends in the City of Edinburgh. [Thesis]. University of Edinburgh; 2012. Available from: http://hdl.handle.net/1842/6353

Not specified: Masters Thesis or Doctoral Dissertation

Boston University

5.
Stevens, Roger T.
An application of *Markov* * chains*.

Degree: MA, Mathematics, 1959, Boston University

URL: http://hdl.handle.net/2144/24603

► Probability problems in which a time parameter is involved are known as stochastic processes. The simplest time dependent stochastic processes are those in which the…
(more)

Subjects/Keywords: Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stevens, R. T. (1959). An application of Markov chains. (Masters Thesis). Boston University. Retrieved from http://hdl.handle.net/2144/24603

Chicago Manual of Style (16^{th} Edition):

Stevens, Roger T. “An application of Markov chains.” 1959. Masters Thesis, Boston University. Accessed March 01, 2021. http://hdl.handle.net/2144/24603.

MLA Handbook (7^{th} Edition):

Stevens, Roger T. “An application of Markov chains.” 1959. Web. 01 Mar 2021.

Vancouver:

Stevens RT. An application of Markov chains. [Internet] [Masters thesis]. Boston University; 1959. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/2144/24603.

Council of Science Editors:

Stevens RT. An application of Markov chains. [Masters Thesis]. Boston University; 1959. Available from: http://hdl.handle.net/2144/24603

6.
Tifenbach, Ryan M.
A Combinatorial Approach to Nearly Uncoupled *Markov* * Chains*.

Degree: 2011, RIAN

URL: http://eprints.maynoothuniversity.ie/3730/

► A discrete-time *Markov* chain on a state space S is a sequence of random variables X = fx0; x1; : : :g that take on…
(more)

Subjects/Keywords: Hamilton Institute; Markov Chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tifenbach, R. M. (2011). A Combinatorial Approach to Nearly Uncoupled Markov Chains. (Thesis). RIAN. Retrieved from http://eprints.maynoothuniversity.ie/3730/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tifenbach, Ryan M. “A Combinatorial Approach to Nearly Uncoupled Markov Chains.” 2011. Thesis, RIAN. Accessed March 01, 2021. http://eprints.maynoothuniversity.ie/3730/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tifenbach, Ryan M. “A Combinatorial Approach to Nearly Uncoupled Markov Chains.” 2011. Web. 01 Mar 2021.

Vancouver:

Tifenbach RM. A Combinatorial Approach to Nearly Uncoupled Markov Chains. [Internet] [Thesis]. RIAN; 2011. [cited 2021 Mar 01]. Available from: http://eprints.maynoothuniversity.ie/3730/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tifenbach RM. A Combinatorial Approach to Nearly Uncoupled Markov Chains. [Thesis]. RIAN; 2011. Available from: http://eprints.maynoothuniversity.ie/3730/

Not specified: Masters Thesis or Doctoral Dissertation

7.
Tifenbach, Ryan M.
A Combinatorial Approach to Nearly Uncoupled *Markov* * Chains*.

Degree: 2011, RIAN

URL: http://mural.maynoothuniversity.ie/3730/

► A discrete-time *Markov* chain on a state space S is a sequence of random variables X = fx0; x1; : : :g that take on…
(more)

Subjects/Keywords: Hamilton Institute; Markov Chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tifenbach, R. M. (2011). A Combinatorial Approach to Nearly Uncoupled Markov Chains. (Thesis). RIAN. Retrieved from http://mural.maynoothuniversity.ie/3730/

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tifenbach, Ryan M. “A Combinatorial Approach to Nearly Uncoupled Markov Chains.” 2011. Thesis, RIAN. Accessed March 01, 2021. http://mural.maynoothuniversity.ie/3730/.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tifenbach, Ryan M. “A Combinatorial Approach to Nearly Uncoupled Markov Chains.” 2011. Web. 01 Mar 2021.

Vancouver:

Tifenbach RM. A Combinatorial Approach to Nearly Uncoupled Markov Chains. [Internet] [Thesis]. RIAN; 2011. [cited 2021 Mar 01]. Available from: http://mural.maynoothuniversity.ie/3730/.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tifenbach RM. A Combinatorial Approach to Nearly Uncoupled Markov Chains. [Thesis]. RIAN; 2011. Available from: http://mural.maynoothuniversity.ie/3730/

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

8. Paarporn, Keith. Dynamics of epidemic spreading over networks with agent awareness.

Degree: MS, Electrical and Computer Engineering, 2016, Georgia Tech

URL: http://hdl.handle.net/1853/55676

► We study an SIS (susceptible-infected-susceptible) model of disease spread over a contact network of n agents. The agents receive personalized information about the epidemic through…
(more)

Subjects/Keywords: Epidemics; Networks; Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Paarporn, K. (2016). Dynamics of epidemic spreading over networks with agent awareness. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55676

Chicago Manual of Style (16^{th} Edition):

Paarporn, Keith. “Dynamics of epidemic spreading over networks with agent awareness.” 2016. Masters Thesis, Georgia Tech. Accessed March 01, 2021. http://hdl.handle.net/1853/55676.

MLA Handbook (7^{th} Edition):

Paarporn, Keith. “Dynamics of epidemic spreading over networks with agent awareness.” 2016. Web. 01 Mar 2021.

Vancouver:

Paarporn K. Dynamics of epidemic spreading over networks with agent awareness. [Internet] [Masters thesis]. Georgia Tech; 2016. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1853/55676.

Council of Science Editors:

Paarporn K. Dynamics of epidemic spreading over networks with agent awareness. [Masters Thesis]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55676

Georgia Tech

9.
Bhakta, Prateek Jayeshbhai.
*Markov**chains* for weighted lattice structures.

Degree: PhD, Computer Science, 2016, Georgia Tech

URL: http://hdl.handle.net/1853/55689

► *Markov* *chains* are an essential tool for sampling from large sets, and are ubiquitous across many scientific fields, including statistical physics, industrial engineering, and computer…
(more)

Subjects/Keywords: Markov chains; Mixing rates

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhakta, P. J. (2016). Markov chains for weighted lattice structures. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55689

Chicago Manual of Style (16^{th} Edition):

Bhakta, Prateek Jayeshbhai. “Markov chains for weighted lattice structures.” 2016. Doctoral Dissertation, Georgia Tech. Accessed March 01, 2021. http://hdl.handle.net/1853/55689.

MLA Handbook (7^{th} Edition):

Bhakta, Prateek Jayeshbhai. “Markov chains for weighted lattice structures.” 2016. Web. 01 Mar 2021.

Vancouver:

Bhakta PJ. Markov chains for weighted lattice structures. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1853/55689.

Council of Science Editors:

Bhakta PJ. Markov chains for weighted lattice structures. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55689

Universidade Estadual de Campinas

10.
Vieira, Francisco Zuilton Gonçalves.
Cadeias de *Markov* homogêneas discretas: Discrete homogeneous *Markov* * chains*.

Degree: 2011, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306581

► Abstract: This dissertation deals with the study of discrete *Markov* *chains* with values in a countable state space. *Markov* *chains* are processes stochastic in the…
(more)

Subjects/Keywords: Probabilidades; Markov, Cadeias de; Probabilities; Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vieira, F. Z. G. (2011). Cadeias de Markov homogêneas discretas: Discrete homogeneous Markov chains. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306581

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vieira, Francisco Zuilton Gonçalves. “Cadeias de Markov homogêneas discretas: Discrete homogeneous Markov chains.” 2011. Thesis, Universidade Estadual de Campinas. Accessed March 01, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306581.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vieira, Francisco Zuilton Gonçalves. “Cadeias de Markov homogêneas discretas: Discrete homogeneous Markov chains.” 2011. Web. 01 Mar 2021.

Vancouver:

Vieira FZG. Cadeias de Markov homogêneas discretas: Discrete homogeneous Markov chains. [Internet] [Thesis]. Universidade Estadual de Campinas; 2011. [cited 2021 Mar 01]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306581.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vieira FZG. Cadeias de Markov homogêneas discretas: Discrete homogeneous Markov chains. [Thesis]. Universidade Estadual de Campinas; 2011. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306581

Not specified: Masters Thesis or Doctoral Dissertation

11. Ashton, Stephen. The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks.

Degree: PhD, 2019, University of Sussex

URL: http://sro.sussex.ac.uk/id/eprint/88850/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.793603

► In this thesis, I provide a statistical analysis of high-resolution contact pattern data within primary and secondary schools as collected by the SocioPatterns collaboration. Students…
(more)

Subjects/Keywords: 510; QA0274.7 Markov processes. Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ashton, S. (2019). The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/88850/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.793603

Chicago Manual of Style (16^{th} Edition):

Ashton, Stephen. “The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks.” 2019. Doctoral Dissertation, University of Sussex. Accessed March 01, 2021. http://sro.sussex.ac.uk/id/eprint/88850/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.793603.

MLA Handbook (7^{th} Edition):

Ashton, Stephen. “The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks.” 2019. Web. 01 Mar 2021.

Vancouver:

Ashton S. The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks. [Internet] [Doctoral dissertation]. University of Sussex; 2019. [cited 2021 Mar 01]. Available from: http://sro.sussex.ac.uk/id/eprint/88850/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.793603.

Council of Science Editors:

Ashton S. The mathematics of human contact : developing stochastic algorithms for the generation of time-varying dynamic human contact networks. [Doctoral Dissertation]. University of Sussex; 2019. Available from: http://sro.sussex.ac.uk/id/eprint/88850/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.793603

12. Sherborne, Neil. Non-Markovian epidemic dynamics on networks.

Degree: PhD, 2018, University of Sussex

URL: http://sro.sussex.ac.uk/id/eprint/79084/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.759572

► The use of networks to model the spread of epidemics through structured populations is widespread. However, epidemics on networks lead to intractable exact systems with…
(more)

Subjects/Keywords: 510; QA0274.7 Markov processes. Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sherborne, N. (2018). Non-Markovian epidemic dynamics on networks. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/79084/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.759572

Chicago Manual of Style (16^{th} Edition):

Sherborne, Neil. “Non-Markovian epidemic dynamics on networks.” 2018. Doctoral Dissertation, University of Sussex. Accessed March 01, 2021. http://sro.sussex.ac.uk/id/eprint/79084/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.759572.

MLA Handbook (7^{th} Edition):

Sherborne, Neil. “Non-Markovian epidemic dynamics on networks.” 2018. Web. 01 Mar 2021.

Vancouver:

Sherborne N. Non-Markovian epidemic dynamics on networks. [Internet] [Doctoral dissertation]. University of Sussex; 2018. [cited 2021 Mar 01]. Available from: http://sro.sussex.ac.uk/id/eprint/79084/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.759572.

Council of Science Editors:

Sherborne N. Non-Markovian epidemic dynamics on networks. [Doctoral Dissertation]. University of Sussex; 2018. Available from: http://sro.sussex.ac.uk/id/eprint/79084/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.759572

Cornell University

13.
Zeber, David.
Extremal Properties Of *Markov* *Chains* And The Conditional Extreme Value Model.

Degree: PhD, Statistics, 2012, Cornell University

URL: http://hdl.handle.net/1813/31016

► Multivariate extreme value theory has proven useful for modeling multivariate data in fields such as finance and environmental science, where one is interested in accounting…
(more)

Subjects/Keywords: Extreme Value Theory; Markov Chains; Point Processes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zeber, D. (2012). Extremal Properties Of Markov Chains And The Conditional Extreme Value Model. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31016

Chicago Manual of Style (16^{th} Edition):

Zeber, David. “Extremal Properties Of Markov Chains And The Conditional Extreme Value Model.” 2012. Doctoral Dissertation, Cornell University. Accessed March 01, 2021. http://hdl.handle.net/1813/31016.

MLA Handbook (7^{th} Edition):

Zeber, David. “Extremal Properties Of Markov Chains And The Conditional Extreme Value Model.” 2012. Web. 01 Mar 2021.

Vancouver:

Zeber D. Extremal Properties Of Markov Chains And The Conditional Extreme Value Model. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1813/31016.

Council of Science Editors:

Zeber D. Extremal Properties Of Markov Chains And The Conditional Extreme Value Model. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31016

Cornell University

14. Murugan, Mathav. Random Walks On Metric Measure Spaces.

Degree: PhD, Applied Mathematics, 2015, Cornell University

URL: http://hdl.handle.net/1813/40684

► In this thesis, we study transition probability estimates for *Markov* *chains* and their relationship to the geometry of the underlying state space. The thesis is…
(more)

Subjects/Keywords: Markov chains; transition probability estimates; anomalous diffusion

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Murugan, M. (2015). Random Walks On Metric Measure Spaces. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/40684

Chicago Manual of Style (16^{th} Edition):

Murugan, Mathav. “Random Walks On Metric Measure Spaces.” 2015. Doctoral Dissertation, Cornell University. Accessed March 01, 2021. http://hdl.handle.net/1813/40684.

MLA Handbook (7^{th} Edition):

Murugan, Mathav. “Random Walks On Metric Measure Spaces.” 2015. Web. 01 Mar 2021.

Vancouver:

Murugan M. Random Walks On Metric Measure Spaces. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1813/40684.

Council of Science Editors:

Murugan M. Random Walks On Metric Measure Spaces. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40684

15. Geetha Antony Pullen. Bayesian methods in genetics: a graph theoretic approach; -.

Degree: Statistics, 2012, Kannur University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/6056

Subjects/Keywords: Markov Chains; Statistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pullen, G. A. (2012). Bayesian methods in genetics: a graph theoretic approach; -. (Thesis). Kannur University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/6056

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Pullen, Geetha Antony. “Bayesian methods in genetics: a graph theoretic approach; -.” 2012. Thesis, Kannur University. Accessed March 01, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/6056.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pullen, Geetha Antony. “Bayesian methods in genetics: a graph theoretic approach; -.” 2012. Web. 01 Mar 2021.

Vancouver:

Pullen GA. Bayesian methods in genetics: a graph theoretic approach; -. [Internet] [Thesis]. Kannur University; 2012. [cited 2021 Mar 01]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/6056.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pullen GA. Bayesian methods in genetics: a graph theoretic approach; -. [Thesis]. Kannur University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/6056

Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University

16.
Liu, Ning.
Spectral Clustering for Graphs and *Markov* * Chains*.

Degree: PhD, Computer Science, 2010, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/4886

► Spectral graph partitioning based on spectral theory has become a popular clustering method over the last few years. The starting point is the work of…
(more)

Subjects/Keywords: spectral clustering; graph partitioning; markov chains; eigenvalue

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, N. (2010). Spectral Clustering for Graphs and Markov Chains. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4886

Chicago Manual of Style (16^{th} Edition):

Liu, Ning. “Spectral Clustering for Graphs and Markov Chains.” 2010. Doctoral Dissertation, North Carolina State University. Accessed March 01, 2021. http://www.lib.ncsu.edu/resolver/1840.16/4886.

MLA Handbook (7^{th} Edition):

Liu, Ning. “Spectral Clustering for Graphs and Markov Chains.” 2010. Web. 01 Mar 2021.

Vancouver:

Liu N. Spectral Clustering for Graphs and Markov Chains. [Internet] [Doctoral dissertation]. North Carolina State University; 2010. [cited 2021 Mar 01]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4886.

Council of Science Editors:

Liu N. Spectral Clustering for Graphs and Markov Chains. [Doctoral Dissertation]. North Carolina State University; 2010. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4886

University of Adelaide

17. Teo, Mingmei. Optimal allocation of vaccines in metapopulations.

Degree: 2017, University of Adelaide

URL: http://hdl.handle.net/2440/112808

► Infectious diseases have had a devastating impact on society and the world's population throughout the years. For example, the Spanish flu in 1918 and most…
(more)

Subjects/Keywords: vaccination; continuous-time Markov chains; mathematical epidemiology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Teo, M. (2017). Optimal allocation of vaccines in metapopulations. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/112808

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Teo, Mingmei. “Optimal allocation of vaccines in metapopulations.” 2017. Thesis, University of Adelaide. Accessed March 01, 2021. http://hdl.handle.net/2440/112808.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Teo, Mingmei. “Optimal allocation of vaccines in metapopulations.” 2017. Web. 01 Mar 2021.

Vancouver:

Teo M. Optimal allocation of vaccines in metapopulations. [Internet] [Thesis]. University of Adelaide; 2017. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/2440/112808.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Teo M. Optimal allocation of vaccines in metapopulations. [Thesis]. University of Adelaide; 2017. Available from: http://hdl.handle.net/2440/112808

Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

18. Milios, Dimitrios. On approximating the stochastic behaviour of Markovian process algebra models.

Degree: PhD, 2014, University of Edinburgh

URL: http://hdl.handle.net/1842/8930

► *Markov* *chains* offer a rigorous mathematical framework to describe systems that exhibit stochastic behaviour, as they are supported by a plethora of methodologies to analyse…
(more)

Subjects/Keywords: 519.2; process algebras; Markov chains; simulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Milios, D. (2014). On approximating the stochastic behaviour of Markovian process algebra models. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8930

Chicago Manual of Style (16^{th} Edition):

Milios, Dimitrios. “On approximating the stochastic behaviour of Markovian process algebra models.” 2014. Doctoral Dissertation, University of Edinburgh. Accessed March 01, 2021. http://hdl.handle.net/1842/8930.

MLA Handbook (7^{th} Edition):

Milios, Dimitrios. “On approximating the stochastic behaviour of Markovian process algebra models.” 2014. Web. 01 Mar 2021.

Vancouver:

Milios D. On approximating the stochastic behaviour of Markovian process algebra models. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1842/8930.

Council of Science Editors:

Milios D. On approximating the stochastic behaviour of Markovian process algebra models. [Doctoral Dissertation]. University of Edinburgh; 2014. Available from: http://hdl.handle.net/1842/8930

Delft University of Technology

19. Shelat, Sanmay (author). Developing an Integrated Pedestrian Behaviour Model for Office Buildings.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:6a52306a-2747-450e-89e4-390f5db96bf5

► As an increasing number of people work in office buildings and new sophisticated sensor technologies become available there is, both, a need and potential, to…
(more)

Subjects/Keywords: Pedestrian simulation models; Office buildings; Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shelat, S. (. (2017). Developing an Integrated Pedestrian Behaviour Model for Office Buildings. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6a52306a-2747-450e-89e4-390f5db96bf5

Chicago Manual of Style (16^{th} Edition):

Shelat, Sanmay (author). “Developing an Integrated Pedestrian Behaviour Model for Office Buildings.” 2017. Masters Thesis, Delft University of Technology. Accessed March 01, 2021. http://resolver.tudelft.nl/uuid:6a52306a-2747-450e-89e4-390f5db96bf5.

MLA Handbook (7^{th} Edition):

Shelat, Sanmay (author). “Developing an Integrated Pedestrian Behaviour Model for Office Buildings.” 2017. Web. 01 Mar 2021.

Vancouver:

Shelat S(. Developing an Integrated Pedestrian Behaviour Model for Office Buildings. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Mar 01]. Available from: http://resolver.tudelft.nl/uuid:6a52306a-2747-450e-89e4-390f5db96bf5.

Council of Science Editors:

Shelat S(. Developing an Integrated Pedestrian Behaviour Model for Office Buildings. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:6a52306a-2747-450e-89e4-390f5db96bf5

Delft University of Technology

20. Krishnan, Vishruth (author). Exploring the Potential of Uber Movement Data: An Amsterdam case study.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:77ebadc7-8af9-4b42-8f36-a94755eb5009

►

With the increasing use of big data in varied applications to improve decision making and provide new insights, the research explores the potential of the… (more)

Subjects/Keywords: Uber Movement; Amsterdam; Markov chains; Travel time

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krishnan, V. (. (2019). Exploring the Potential of Uber Movement Data: An Amsterdam case study. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:77ebadc7-8af9-4b42-8f36-a94755eb5009

Chicago Manual of Style (16^{th} Edition):

Krishnan, Vishruth (author). “Exploring the Potential of Uber Movement Data: An Amsterdam case study.” 2019. Masters Thesis, Delft University of Technology. Accessed March 01, 2021. http://resolver.tudelft.nl/uuid:77ebadc7-8af9-4b42-8f36-a94755eb5009.

MLA Handbook (7^{th} Edition):

Krishnan, Vishruth (author). “Exploring the Potential of Uber Movement Data: An Amsterdam case study.” 2019. Web. 01 Mar 2021.

Vancouver:

Krishnan V(. Exploring the Potential of Uber Movement Data: An Amsterdam case study. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Mar 01]. Available from: http://resolver.tudelft.nl/uuid:77ebadc7-8af9-4b42-8f36-a94755eb5009.

Council of Science Editors:

Krishnan V(. Exploring the Potential of Uber Movement Data: An Amsterdam case study. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:77ebadc7-8af9-4b42-8f36-a94755eb5009

Washington University in St. Louis

21.
Cook, Scott.
*Markov**Chains* Derived From Lagrangian Mechanical Systems.

Degree: PhD, Mathematics, 2011, Washington University in St. Louis

URL: https://openscholarship.wustl.edu/etd/75

► The theory of *Markov* *chains* with countable state spaces is a greatly developed and successful area of probability theory and statistics. There is much interest…
(more)

Subjects/Keywords: Mathematics; Mechanics; dynamical systems, Markov chains, probabilty

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cook, S. (2011). Markov Chains Derived From Lagrangian Mechanical Systems. (Doctoral Dissertation). Washington University in St. Louis. Retrieved from https://openscholarship.wustl.edu/etd/75

Chicago Manual of Style (16^{th} Edition):

Cook, Scott. “Markov Chains Derived From Lagrangian Mechanical Systems.” 2011. Doctoral Dissertation, Washington University in St. Louis. Accessed March 01, 2021. https://openscholarship.wustl.edu/etd/75.

MLA Handbook (7^{th} Edition):

Cook, Scott. “Markov Chains Derived From Lagrangian Mechanical Systems.” 2011. Web. 01 Mar 2021.

Vancouver:

Cook S. Markov Chains Derived From Lagrangian Mechanical Systems. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2011. [cited 2021 Mar 01]. Available from: https://openscholarship.wustl.edu/etd/75.

Council of Science Editors:

Cook S. Markov Chains Derived From Lagrangian Mechanical Systems. [Doctoral Dissertation]. Washington University in St. Louis; 2011. Available from: https://openscholarship.wustl.edu/etd/75

University of Tennessee – Knoxville

22. Kodituwakku, Hansaka Angel Dias Edirisinghe. InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data.

Degree: MS, Computer Engineering, 2017, University of Tennessee – Knoxville

URL: https://trace.tennessee.edu/utk_gradthes/4885

► Monitoring systems are paramount to the proactive detection and mitigation of problems in computer networks related to performance and security. Degraded performance and compromised…
(more)

Subjects/Keywords: insight2; noc; performance; analytics; visualization; markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kodituwakku, H. A. D. E. (2017). InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/4885

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kodituwakku, Hansaka Angel Dias Edirisinghe. “InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data.” 2017. Thesis, University of Tennessee – Knoxville. Accessed March 01, 2021. https://trace.tennessee.edu/utk_gradthes/4885.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kodituwakku, Hansaka Angel Dias Edirisinghe. “InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data.” 2017. Web. 01 Mar 2021.

Vancouver:

Kodituwakku HADE. InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data. [Internet] [Thesis]. University of Tennessee – Knoxville; 2017. [cited 2021 Mar 01]. Available from: https://trace.tennessee.edu/utk_gradthes/4885.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kodituwakku HADE. InSight2: An Interactive Web Based Platform for Modeling and Analysis of Large Scale Argus Network Flow Data. [Thesis]. University of Tennessee – Knoxville; 2017. Available from: https://trace.tennessee.edu/utk_gradthes/4885

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

23. Lambeth, Jacob Nelson. Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces.

Degree: MS, Mechanical Engineering, 2013, Virginia Tech

URL: http://hdl.handle.net/10919/19329

► Accurate terrain models provide the chassis designer with a powerful tool to make informed design decisions early in the design process. During this stage, engineers…
(more)

Subjects/Keywords: Terrain; Surfaces; Gridding; Modeling; Characterization; Markov Chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lambeth, J. N. (2013). Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/19329

Chicago Manual of Style (16^{th} Edition):

Lambeth, Jacob Nelson. “Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces.” 2013. Masters Thesis, Virginia Tech. Accessed March 01, 2021. http://hdl.handle.net/10919/19329.

MLA Handbook (7^{th} Edition):

Lambeth, Jacob Nelson. “Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces.” 2013. Web. 01 Mar 2021.

Vancouver:

Lambeth JN. Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/10919/19329.

Council of Science Editors:

Lambeth JN. Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces. [Masters Thesis]. Virginia Tech; 2013. Available from: http://hdl.handle.net/10919/19329

University of New South Wales

24. Tjakra, Javan Dave. Modeling and analysis of particulate system collective dynamical features.

Degree: Chemical Sciences & Engineering, 2013, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/52903 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11581/SOURCE01?view=true

► The majority of industrial particulate operations are highly energy intensive, whichleads to expensive operational costs. The fundamental particulate behavior mechanisms,which determine the system collective dynamical…
(more)

Subjects/Keywords: DEM; Collective Dynamics; Particulate System; Markov Chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tjakra, J. D. (2013). Modeling and analysis of particulate system collective dynamical features. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52903 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11581/SOURCE01?view=true

Chicago Manual of Style (16^{th} Edition):

Tjakra, Javan Dave. “Modeling and analysis of particulate system collective dynamical features.” 2013. Doctoral Dissertation, University of New South Wales. Accessed March 01, 2021. http://handle.unsw.edu.au/1959.4/52903 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11581/SOURCE01?view=true.

MLA Handbook (7^{th} Edition):

Tjakra, Javan Dave. “Modeling and analysis of particulate system collective dynamical features.” 2013. Web. 01 Mar 2021.

Vancouver:

Tjakra JD. Modeling and analysis of particulate system collective dynamical features. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2021 Mar 01]. Available from: http://handle.unsw.edu.au/1959.4/52903 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11581/SOURCE01?view=true.

Council of Science Editors:

Tjakra JD. Modeling and analysis of particulate system collective dynamical features. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/52903 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11581/SOURCE01?view=true

University of Cambridge

25. Thomas, Samuel. Universality of cutoff for random walks on random Cayley graphs.

Degree: PhD, 2020, University of Cambridge

URL: https://doi.org/10.17863/CAM.58736 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.818190

► Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random. This draws a Cayley graph uniformly…
(more)

Subjects/Keywords: Markov chains; mixing times; cutoff; universality

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Thomas, S. (2020). Universality of cutoff for random walks on random Cayley graphs. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.58736 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.818190

Chicago Manual of Style (16^{th} Edition):

Thomas, Samuel. “Universality of cutoff for random walks on random Cayley graphs.” 2020. Doctoral Dissertation, University of Cambridge. Accessed March 01, 2021. https://doi.org/10.17863/CAM.58736 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.818190.

MLA Handbook (7^{th} Edition):

Thomas, Samuel. “Universality of cutoff for random walks on random Cayley graphs.” 2020. Web. 01 Mar 2021.

Vancouver:

Thomas S. Universality of cutoff for random walks on random Cayley graphs. [Internet] [Doctoral dissertation]. University of Cambridge; 2020. [cited 2021 Mar 01]. Available from: https://doi.org/10.17863/CAM.58736 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.818190.

Council of Science Editors:

Thomas S. Universality of cutoff for random walks on random Cayley graphs. [Doctoral Dissertation]. University of Cambridge; 2020. Available from: https://doi.org/10.17863/CAM.58736 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.818190

University of Cambridge

26. Thomas, Samuel. Universality of Cutoff for Random Walks on Random Cayley Graphs.

Degree: PhD, 2020, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/311645

► Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random. This draws a Cayley graph uniformly…
(more)

Subjects/Keywords: Markov chains; mixing times; cutoff; universality

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Thomas, S. (2020). Universality of Cutoff for Random Walks on Random Cayley Graphs. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/311645

Chicago Manual of Style (16^{th} Edition):

Thomas, Samuel. “Universality of Cutoff for Random Walks on Random Cayley Graphs.” 2020. Doctoral Dissertation, University of Cambridge. Accessed March 01, 2021. https://www.repository.cam.ac.uk/handle/1810/311645.

MLA Handbook (7^{th} Edition):

Thomas, Samuel. “Universality of Cutoff for Random Walks on Random Cayley Graphs.” 2020. Web. 01 Mar 2021.

Vancouver:

Thomas S. Universality of Cutoff for Random Walks on Random Cayley Graphs. [Internet] [Doctoral dissertation]. University of Cambridge; 2020. [cited 2021 Mar 01]. Available from: https://www.repository.cam.ac.uk/handle/1810/311645.

Council of Science Editors:

Thomas S. Universality of Cutoff for Random Walks on Random Cayley Graphs. [Doctoral Dissertation]. University of Cambridge; 2020. Available from: https://www.repository.cam.ac.uk/handle/1810/311645

Louisiana State University

27. Parrott, Chester Ira. Distributed Load Testing by Modeling and Simulating User Behavior.

Degree: PhD, Artificial Intelligence and Robotics, 2020, Louisiana State University

URL: https://digitalcommons.lsu.edu/gradschool_dissertations/5436

► Modern human-machine systems such as microservices rely upon agile engineering practices which require changes to be tested and released more frequently than classically engineered…
(more)

Subjects/Keywords: Markov Chains; Load Testing; Clustering; Machine Learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Parrott, C. I. (2020). Distributed Load Testing by Modeling and Simulating User Behavior. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/5436

Chicago Manual of Style (16^{th} Edition):

Parrott, Chester Ira. “Distributed Load Testing by Modeling and Simulating User Behavior.” 2020. Doctoral Dissertation, Louisiana State University. Accessed March 01, 2021. https://digitalcommons.lsu.edu/gradschool_dissertations/5436.

MLA Handbook (7^{th} Edition):

Parrott, Chester Ira. “Distributed Load Testing by Modeling and Simulating User Behavior.” 2020. Web. 01 Mar 2021.

Vancouver:

Parrott CI. Distributed Load Testing by Modeling and Simulating User Behavior. [Internet] [Doctoral dissertation]. Louisiana State University; 2020. [cited 2021 Mar 01]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/5436.

Council of Science Editors:

Parrott CI. Distributed Load Testing by Modeling and Simulating User Behavior. [Doctoral Dissertation]. Louisiana State University; 2020. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/5436

28. Lopes, Fabio Marcellus Lima Sá Makiyama. Limite do fluído para o grafo aleatório de Erdos-Rényi.

Degree: Mestrado, Estatística, 2010, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;

►

Neste trabalho, aplicamos o algoritmo Breadth-First Search para encontrar o tamanho de uma componente conectada no grafo aleatório de Erdos-Rényi. Uma cadeia de *Markov* é…
(more)

Subjects/Keywords: Cadeias de Markov; Convergence; Convergência; Grafos aleatórios.; Markov chains; Random graphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lopes, F. M. L. S. M. (2010). Limite do fluído para o grafo aleatório de Erdos-Rényi. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;

Chicago Manual of Style (16^{th} Edition):

Lopes, Fabio Marcellus Lima Sá Makiyama. “Limite do fluído para o grafo aleatório de Erdos-Rényi.” 2010. Masters Thesis, University of São Paulo. Accessed March 01, 2021. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;.

MLA Handbook (7^{th} Edition):

Lopes, Fabio Marcellus Lima Sá Makiyama. “Limite do fluído para o grafo aleatório de Erdos-Rényi.” 2010. Web. 01 Mar 2021.

Vancouver:

Lopes FMLSM. Limite do fluído para o grafo aleatório de Erdos-Rényi. [Internet] [Masters thesis]. University of São Paulo; 2010. [cited 2021 Mar 01]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;.

Council of Science Editors:

Lopes FMLSM. Limite do fluído para o grafo aleatório de Erdos-Rényi. [Masters Thesis]. University of São Paulo; 2010. Available from: http://www.teses.usp.br/teses/disponiveis/45/45133/tde-05052010-155151/ ;

Universidade Estadual de Campinas

29.
Ramos, Yuri Tobias Aquiel Correa, 1991-.
Aplicações de cadeias de *Markov* no ensino médio: Applications of *Markov* *chains* in high school.

Degree: 2017, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322382

► Abstract: This study proposes two instigating problems for application in high school. Several aspects of such problems are discussed, with a proposed solution always focused…
(more)

Subjects/Keywords: Probabilidades; Matrizes (Matemática); Markov, Cadeias de; Probabilities; Matrices; Markov chains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ramos, Yuri Tobias Aquiel Correa, 1. (2017). Aplicações de cadeias de Markov no ensino médio: Applications of Markov chains in high school. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/322382

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ramos, Yuri Tobias Aquiel Correa, 1991-. “Aplicações de cadeias de Markov no ensino médio: Applications of Markov chains in high school.” 2017. Thesis, Universidade Estadual de Campinas. Accessed March 01, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/322382.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ramos, Yuri Tobias Aquiel Correa, 1991-. “Aplicações de cadeias de Markov no ensino médio: Applications of Markov chains in high school.” 2017. Web. 01 Mar 2021.

Vancouver:

Ramos, Yuri Tobias Aquiel Correa 1. Aplicações de cadeias de Markov no ensino médio: Applications of Markov chains in high school. [Internet] [Thesis]. Universidade Estadual de Campinas; 2017. [cited 2021 Mar 01]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322382.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ramos, Yuri Tobias Aquiel Correa 1. Aplicações de cadeias de Markov no ensino médio: Applications of Markov chains in high school. [Thesis]. Universidade Estadual de Campinas; 2017. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322382

Not specified: Masters Thesis or Doctoral Dissertation

30.
Zacharias, Leena.
An adiabatic approach to analysis of time inhomogeneous *Markov* *chains* : a queueing policy application.

Degree: MS, Electrical and Computer Engineering, 2011, Oregon State University

URL: http://hdl.handle.net/1957/23293

► In this thesis, convergence of time inhomogeneous *Markov* *chains* is studied using an adiabatic approach. The adiabatic framework considers slowly changing systems and the adiabatic…
(more)

Subjects/Keywords: Markov chains; Markov processes

…2.2
Reversible *Markov* *chains* . . . . . . . . . . . . . . . . . . . . . . . .
6
2.3… …Continuous time *Markov* *chains* . . . . . . . . . . . . . . . . . . . .
8
2.4
Other Results… …13
3.1
4
A General Result for Time Inhomogeneous *Markov* *Chains* . . . . .
14
Application… …Approach to Analysis of Time Inhomogeneous
*Markov* *Chains*: a Queueing Policy Application
Chapter… …inhomogeneous *Markov* chain. The theory of *Markov* *chains* is
extensively used in queueing theory [2…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zacharias, L. (2011). An adiabatic approach to analysis of time inhomogeneous Markov chains : a queueing policy application. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/23293

Chicago Manual of Style (16^{th} Edition):

Zacharias, Leena. “An adiabatic approach to analysis of time inhomogeneous Markov chains : a queueing policy application.” 2011. Masters Thesis, Oregon State University. Accessed March 01, 2021. http://hdl.handle.net/1957/23293.

MLA Handbook (7^{th} Edition):

Zacharias, Leena. “An adiabatic approach to analysis of time inhomogeneous Markov chains : a queueing policy application.” 2011. Web. 01 Mar 2021.

Vancouver:

Zacharias L. An adiabatic approach to analysis of time inhomogeneous Markov chains : a queueing policy application. [Internet] [Masters thesis]. Oregon State University; 2011. [cited 2021 Mar 01]. Available from: http://hdl.handle.net/1957/23293.

Council of Science Editors:

Zacharias L. An adiabatic approach to analysis of time inhomogeneous Markov chains : a queueing policy application. [Masters Thesis]. Oregon State University; 2011. Available from: http://hdl.handle.net/1957/23293