subject:(Markov chains)

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 Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Wicks JR. An Algorithm to Compute the Stochastically Stable Distribution of a Perturbed Markov Matrix. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2019 Mar 23]. 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/

University of Edinburgh

2. 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 Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Apted WDF. Modelling Tourist Movements and Trends in the City of Edinburgh. [Internet] [Thesis]. University of Edinburgh; 2012. [cited 2019 Mar 23]. 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

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

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 Cite « Share

❌

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 23, 2019. http://dspace.library.uu.nl:8080/handle/1874/307053.

MLA Handbook (7^th Edition):

Schelling, W D. “Analyzing a queueing network.” 2015. Web. 23 Mar 2019.

Vancouver:

Schelling WD. Analyzing a queueing network. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Mar 23]. 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

Georgia Tech

4. 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 Cite « Share

❌

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 23, 2019. http://hdl.handle.net/1853/55676.

MLA Handbook (7^th Edition):

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

Vancouver:

Paarporn K. Dynamics of epidemic spreading over networks with agent awareness. [Internet] [Masters thesis]. Georgia Tech; 2016. [cited 2019 Mar 23]. 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

5. 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)

▼ 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 science. To be a useful tool for sampling, the number of steps needed for a Markov chain to converge approximately to the target probability distribution, also known as the mixing time, should be a small polynomial in n, the size of a state. We study problems that arise from the design and analysis of Markov chains that sample from configurations of lattice structures. Specifically, we will be interested in settings where each state is sampled with a non-uniform weight that depends on the structure of the configuration. These weighted lattice models arise naturally in many contexts, and are typically more difficult to analyze than their unweighted counterparts. Our focus will be on exploiting these weightings both to develop new efficient algorithms for sampling and to prove new mixing time bounds for existing Markov chains. First, we will present an efficient algorithm for sampling fixed rank elements from a graded poset, which includes sampling integer partitions of n as a special case. Then, we study the problem of sampling weighted perfect matchings on lattices using a natural Markov chain based on "rotations", and provide evidence towards understanding why this Markov chain has empirically been observed to converge slowly. Finally, we present and analyze a generalized version of the Schelling Segregation model, first proposed in 1971 by economist Thomas Schelling to explain possible causes of racial segregation in cities. We identify conditions under which segregation, or clustering, is likely or unlikely to occur. Our analysis techniques for all three problems are drawn from the interface of theoretical computer science with discrete mathematics and statistical physics. Advisors/Committee Members: Randall, Dana (advisor), Mihail, Milena (committee member), Goldberg, David (committee member), Vigoda, Eric (committee member), Tetali, Prasad (committee member).

Subjects/Keywords: Markov chains; Mixing rates

Record Details Similar Records Cite « Share

❌

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 23, 2019. http://hdl.handle.net/1853/55689.

MLA Handbook (7^th Edition):

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

Vancouver:

Bhakta PJ. Markov chains for weighted lattice structures. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Mar 23]. 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

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 Cite « Share

❌

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/

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):

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

Note: this citation may be lacking information needed for this citation format:
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. 23 Mar 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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/

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

Boston University

7. 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 Cite « Share

❌

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 23, 2019. http://hdl.handle.net/2144/24603.

MLA Handbook (7^th Edition):

Stevens, Roger T. “An application of Markov chains.” 1959. Web. 23 Mar 2019.

Vancouver:

Stevens RT. An application of Markov chains. [Internet] [Masters thesis]. Boston University; 1959. [cited 2019 Mar 23]. 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

8. 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)

▼ 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 the need to coarse grain and focus on some average quantities. Often, the underlying stochastic processes are Markovian and so are the resulting mean-field models constructed as systems of ordinary differential equations (ODEs). However, the lack of memory (or memorylessness) does not accurately describe real disease dynamics. For instance, many epidemiological studies have shown that the true distribution of the infectious period is rather centred around its mean, whereas the memoryless assumption imposes an exponential distribution on the infectious period. Assumptions such as these greatly affect the predicted course of an epidemic and can lead to inaccurate predictions about disease spread. Such limitations of existing approaches to modelling epidemics on networks motivated my efforts to develop non-Markovian models which would be better suited to capture essential realistic features of disease dynamics. In the first part of my thesis I developed a pairwise, multi-stage SIR (susceptible-infected-recovered) model. Each infectious node goes through some K 2 N infectious stages, which for K > 1 means that the infectious period is gamma-distributed. Analysis of the model provided analytic expressions for the epidemic threshold and the expected final epidemic size. Using available epidemiological data on the infectious periods of various diseases, I demonstrated the importance of considering the shape of the infectious period distribution. The second part of the thesis expanded the framework of non-Markovian dynamics to networks with heterogeneous degree distributions with non-negligible levels of clustering. These properties are ubiquitous in many real-world networks and make model development and analysis much more challenging. To this end, I have derived and analysed a compact pairwise model with the number of equations being independent of the range of node degrees, and investigated the effects of clustering on epidemic dynamics. My thesis culminated with the third part where I explored the relationships between several different modelling methodologies, and derived an original non-Markovian Edge-Based Compartmental Model (EBCM) which allows both transmission and recovery to be arbitrary independent stochastic processes. The major result is a rigorous mathematical proof that the message passing (MP) model and the EBCM are equivalent, and thus, the EBCM is statistically exact on the ensemble of configuration model networks. From this consideration I derived a generalised pairwise-like model which I then used to build a model hierarchy, and to show that, given corresponding parameters and initial conditions, these models are identical to MP model or EBCM. In the final part of my thesis I considered the important problem of coupling epidemic dynamics with changes in network structure in response to the perceived risk of the epidemic. This was framed…

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Sherborne N. Non-Markovian epidemic dynamics on networks. [Internet] [Doctoral dissertation]. University of Sussex; 2018. [cited 2019 Mar 23]. 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

9. Birmpa, Panagiota. Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems.

Degree: PhD, 2018, University of Sussex

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

► The purpose of this PhD thesis is to study mesoscopic and macroscopic fluctuations in Interacting Particle Systems. The thesis is split into two main parts.… (more)

▼ The purpose of this PhD thesis is to study mesoscopic and macroscopic fluctuations in Interacting Particle Systems. The thesis is split into two main parts. In the first part, we consider a system of Ising spins interacting via Kac potential evolving with Glauber dynamics and study the macroscopic motion of an one-dimensional interface under forced displacement as the result of large scale fluctuations. In the second part, we consider a diffusive system modelled by a Simple Symmetric Exclusion Process (SSEP) which is driven out of equilibrium by the action of current reservoirs at the boundary and study the non-equilibrium fluctuations around the hydrodynamic limit for the SSEP with current reservoirs. We give a brief summary of the first part. In recent years, there has been significant effort to derive deterministic models describing two-phase materials and their dynamical properties. In this context, we investigate the law that governs the power needed to force a motion of a one dimensional macroscopic interface between two different phases of a given ferromagnetic sample with a prescribed speed V at low temperature. We show that given the mesoscopic deterministic non-local evolution equation for the magnetisation (a non local version of the Allen-Cahn equation), we consider a stochastic Ising spin system with Glauber dynamics and Kac interaction (the underlying microscopic stochastic process) whose mesoscopic scaling limit (intermediate scale between microscale and macroscale) is the given PDE, and we calculate the corresponding large deviations functional which would provide the action functional. We obtain that by deriving upper and lower bounds of the large deviation cost functional. Concepts from statistical mechanics such as contours, free energy, local equilibrium allow a better understanding of the structure of the cost functional. Then we characterise the limiting behaviour of the action functional under a parabolic rescaling, by proving that for small values of the ratio between the distance and the time, the interface moves with a constant speed, while for larger values the occurrence of nucleations is the preferred way to make the transition. This led to a production of two published papers [12] and [14] with my supervisor D. Tsagkarogiannis and N. Dirr. In the second part we study the non-equilibrium fluctuations of a system modelled by SSEP with current reservoirs around its hydrodynamic limit. In particular, we prove that, in the limit, the appropriately scaled fluctuation field is given by a Generalised Ornstein- Uhlenbeck process. For the characterisation of the limiting fluctuation field we implement the Holley-Stroock theory. This is not straightforward due to the boundary terms coming from the nature of the model. Hence, by following a martingale approach (martingale decomposition) and the derivation of the equation of the variance for this model combined with “good” enough correlation estimates (the so-called v-estimates), we reduce the problem to a form whose Holley-Stroock result in [45] is…

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Birmpa, P. (2018). Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems. (Doctoral Dissertation). University of Sussex. Retrieved from http://sro.sussex.ac.uk/id/eprint/76622/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.751856

Chicago Manual of Style (16^th Edition):

Birmpa, Panagiota. “Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems.” 2018. Doctoral Dissertation, University of Sussex. Accessed March 23, 2019. http://sro.sussex.ac.uk/id/eprint/76622/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.751856.

MLA Handbook (7^th Edition):

Birmpa, Panagiota. “Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems.” 2018. Web. 23 Mar 2019.

Vancouver:

Birmpa P. Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems. [Internet] [Doctoral dissertation]. University of Sussex; 2018. [cited 2019 Mar 23]. Available from: http://sro.sussex.ac.uk/id/eprint/76622/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.751856.

Council of Science Editors:

Birmpa P. Quantification of mesoscopic and macroscopic fluctuations in interacting particle systems. [Doctoral Dissertation]. University of Sussex; 2018. Available from: http://sro.sussex.ac.uk/id/eprint/76622/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.751856

10. 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

None

Appendices p.166-181, Bibliography p.151-165

Advisors/Committee Members: Kumaran, M.

Subjects/Keywords: Markov Chains; Statistics

Record Details Similar Records Cite « Share

❌

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

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):

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

Note: this citation may be lacking information needed for this citation format:
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. 23 Mar 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

Cornell University

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

Degree: 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 Cite « Share

❌

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 . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/31016

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):

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

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

MLA Handbook (7^th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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

University of Edinburgh

12. 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)

▼ 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 their properties. Stochastic process algebras are high-level formalisms, where systems are represented as collections of interacting components. This compositional approach to modelling allows us to describe complex Markov chains using a compact high-level specification. There is an increasing need to investigate the properties of complex systems, not only in the field of computer science, but also in computational biology. To explore the stochastic properties of large Markov chains is a demanding task in terms of computational resources. Approximating the stochastic properties can be an effective way to deal with the complexity of large models. In this thesis, we investigate methodologies to approximate the stochastic behaviour of Markovian process algebra models. The discussion revolves around two main topics: approximate state-space aggregation and stochastic simulation. Although these topics are different in nature, they are both motivated by the need to efficiently handle complex systems. Approximate Markov chain aggregation constitutes the formulation of a smaller Markov chain that approximates the behaviour of the original model. The principal hypothesis is that states that can be characterised as equivalent can be adequately represented as a single state. We discuss different notions of approximate state equivalence, and how each of these can be used as a criterion to partition the state-space accordingly. Nevertheless, approximate aggregation methods typically require an explicit representation of the transition matrix, a fact that renders them impractical for large models. We propose a compositional approach to aggregation, as a means to efficiently approximate complex Markov models that are defined in a process algebra specification, PEPA in particular. Regarding our contributions to Markov chain simulation, we propose an accelerated method that can be characterised as almost exact, in the sense that it can be arbitrarily precise. We discuss how it is possible to sample from the trajectory space rather than the transition space. This approach requires fewer random samples than a typical simulation algorithm. Most importantly, our approach does not rely on particular assumptions with respect to the model properties, in contrast to otherwise more efficient approaches.

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Milios D. On approximating the stochastic behaviour of Markovian process algebra models. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2019 Mar 23]. 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

University of Adelaide

13. 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)

▼ 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 recently, the Ebola epidemic in West Africa. The introduction of vaccines has managed to keep some infectious diseases under control and in the case of small-pox, eradicated it from the world's population. Hence, vaccines are a very effective method to control the spread of an infectious disease and where possible, the world's population should be vaccinated against all possible diseases. However, the production of vaccines is expensive and if there is a novel strain of a disease, it is often unlikely that a vaccine has been developed to combat the outbreak immediately. Instead, a vaccines must be developed during an epidemic. Both of these situations therefore result in a limited supply of vaccines. Thus, it is of great interest and importance to public health officials to be able to know how best to allocate a limited supply of vaccines to a population. This is the main idea and theme of this thesis. We investigate two possible questions that can arise from this problem. The first is to consider the case where there is a novel strain of a disease and vaccines are developed during an epidemic. For many public health officials in countries or cities around the world, the question is how best to allocate a limited supply of vaccines to the population to minimise the number of people that become infected, after the infection is already present in the population. That is, they are interested in determining the optimal allocation of limited vaccines which take into account the changing dynamics of the epidemic. This naturally lends itself to dynamic programming, which determines the optimal actions whilst accounting for the dynamics of a process. Hence, we explore the use of dynamic programming techniques, backward dynamic programming and approximate dynamic programming, to attempt to solve this problem. We observe that backward dynamic programming does not scale well with the size of the population and so an alternative method is to consider approximate dynamic programming. The approximate dynamic programming algorithms we consider fall under the category of lookup tables. We find, through order calculations, that these methods do not work efficiently for our problem and so other types of algorithms need to be explored in order for approximate dynamic programming to be applied. The second question of interest is to consider an epidemic occurring in some part of the world and government officials in a currently uninfected country have access to a limited supply of vaccines. Then, their interest lies in how best to distribute this supply of vaccines to the population to minimise the mean final epidemic size, that is, the number of people that become infected over the course of an epidemic, should an epidemic arise. Further, we also investigate whether vaccines should be withheld until the first onset of infection in the population or be distributed before infection is… Advisors/Committee Members: Bean, Nigel Geoffrey (advisor), Ross, Joshua (advisor), School of Mathematical Sciences (school).

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

Record Details Similar Records Cite « Share

❌

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

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):

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

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

MLA Handbook (7^th Edition):

Teo, Mingmei. “Optimal allocation of vaccines in metapopulations.” 2017. Web. 23 Mar 2019.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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

Washington University in St. Louis

14. 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 Cite « Share

❌

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 23, 2019. https://openscholarship.wustl.edu/etd/75.

MLA Handbook (7^th Edition):

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

Vancouver:

Cook S. Markov Chains Derived From Lagrangian Mechanical Systems. [Internet] [Doctoral dissertation]. Washington University in St. Louis; 2011. [cited 2019 Mar 23]. 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

Cornell University

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

Degree: 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)

▼ 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 divided into two parts. In the first part (Chapter 1) we consider Markov chains with bounded range, that is there exists R > 0 such that the Markov chain (Xn )n∈N satisfies d(Xn , Xn+1 ) < R for all n ∈ N). In the second part (Chapter 2 and 3) we consider Markov chains with heavy-tailed jumps. In Chapter 1, we characterize Gaussian estimates for transition probability of a discrete time Markov chain in terms of geometric properties of the underlying state space. In particular, we show that the following are equivalent: 1. Two sided Gaussian bounds on heat kernel 2. A scale invariant Parabolic Harnack inequality 3. Volume doubling property and a scale invariant Poincar´ inequality. e The underlying state space is metric measure space that includes both manifolds and graphs as special cases. Various applications and examples are provided. An important feature of our work is that our techniques are robust to small perturbations of the underlying space. In Chapter 2, we study the long-term behaviour of random walks with heavy tailed jumps. We focus on the case where the 'index of tail heaviness' (or jump index) [beta] ∈ (0, 2). Extending several existing work by other authors, we prove global upper and lower bounds for n-step transition probability density that is sharp up to constants. In Chapter 3, we study random walks with heavy tailed jumps where the index of tail heaviness [beta] is allowed to take any positive value. We assume that the state space in this case is a graph satisfying a sub-Gaussian estimate, which is typical of many fractal-like graphs. On such graphs, we establish a threshold behavior of heavy-tailed Markov chains when the index governing the tail heaviness equals the escape time exponent of the simple random walk. In a certain sense, this generalizes the classical threshold corresponding to the second moment condition. This thesis is based on joint work with Laurent Saloff-Coste. Advisors/Committee Members: Levine,Lionel (committeeMember), Samorodnitsky,Gennady (committeeMember).

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

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

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

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):

Murugan, Mathav. “Random Walks On Metric Measure Spaces .” 2015. Thesis, Cornell University. Accessed March 23, 2019. http://hdl.handle.net/1813/40684.

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

MLA Handbook (7^th Edition):

Murugan, Mathav. “Random Walks On Metric Measure Spaces .” 2015. Web. 23 Mar 2019.

Vancouver:

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

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

Council of Science Editors:

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

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

University of Tennessee – Knoxville

16. 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 Cite « Share

❌

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

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):

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 23, 2019. https://trace.tennessee.edu/utk_gradthes/4885.

Note: this citation may be lacking information needed for this citation format:
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. 23 Mar 2019.

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 2019 Mar 23]. Available from: https://trace.tennessee.edu/utk_gradthes/4885.

Note: this citation may be lacking information needed for this citation format:
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

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

University of New South Wales

17. 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)

▼ 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 behavior, is not fullyunderstood. Hence, it is difficult to optimize and control particulate processes.This thesis aims to develop a systematic approach to modeling and analyzingthe overall/collective dynamical features of particulate systems. The dynamicsof particulate systems are modeled based on a stochastic approach in the formof Markov chains. The models can be developed using particle behavior dataobtained from either experimental or numerical based approaches. A numericalapproach, in particular Discrete Element Method, is used in this work.The collective dynamics of particle movement influences the effectiveness ofparticulate operations. The Markov chains approach is used to model the collectivemovement of monodisperse particulate systems under constant operatingconditions. The key operator represents the probability of particle movement fromone location to another, which can estimate particle trajectory. In addition, anapproach to analyzing the collective dynamics of particle movement is also developed,in particular the oscillatory behavior and spatial distribution of particlemovements. The proposed model is then extended for systems with time-varyingoperating conditions. This provides a way to optimize and control the system behaviorby manipulating the operating conditions. The Markov chains models for polydisperse particulate systems under both constant and time-varying operatingconditions are also developed. The model performs a parallel analysis of each typeof particle. This opens a pathway to monitor and analyze polydisperse particulatesystems. Additionally, the model has the potential to aid the implementation ofprocess control of polydisperse systems.The development of a Markov chains model for a non-spatial distribution analysisis also introduced. The operator represents the probability of non-locationalmovements of a particle property between or within arbitrary intervals. This canbe used to model the collective dynamics of particle energy distributions. Additionally,a measure to relate particle impact energy (which is unmeasurable duringoperation) to kinetic energy (which can be estimated during operation) is proposed.This provides a foundation for the development of an indirect impactenergy sensor which is useful for real-time monitoring and process control. Advisors/Committee Members: Bao, Jie, Chemical Sciences & Engineering, Faculty of Engineering, UNSW, Yang, Runyu, Materials Science & Engineering, Faculty of Science, UNSW.

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Tjakra JD. Modeling and analysis of particulate system collective dynamical features. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2019 Mar 23]. 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

Victoria University of Wellington

18. Welsh, Melissa. The Economics of Traceability in the New Zealand Dairy Industry.

Degree: 2018, Victoria University of Wellington

URL: http://hdl.handle.net/10063/7707

► Dairy is an important dietary component, particularly for young children. Because of this the dairy industry is especially sensitive to contamination scares. Dairy is of… (more)

Subjects/Keywords: Dairy; Traceability; Markov chains; Event study

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Welsh, M. (2018). The Economics of Traceability in the New Zealand Dairy Industry. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/7707

Chicago Manual of Style (16^th Edition):

Welsh, Melissa. “The Economics of Traceability in the New Zealand Dairy Industry.” 2018. Doctoral Dissertation, Victoria University of Wellington. Accessed March 23, 2019. http://hdl.handle.net/10063/7707.

MLA Handbook (7^th Edition):

Welsh, Melissa. “The Economics of Traceability in the New Zealand Dairy Industry.” 2018. Web. 23 Mar 2019.

Vancouver:

Welsh M. The Economics of Traceability in the New Zealand Dairy Industry. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2018. [cited 2019 Mar 23]. Available from: http://hdl.handle.net/10063/7707.

Council of Science Editors:

Welsh M. The Economics of Traceability in the New Zealand Dairy Industry. [Doctoral Dissertation]. Victoria University of Wellington; 2018. Available from: http://hdl.handle.net/10063/7707

North Carolina State University

19. 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)

▼ 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 Fiedler who shows that an eigenvector of the Laplacian matrix of an undirected graph (symmetric system) provides the minimum cut of graph nodes. The spectral technique can also be applied to a Markov chain to cluster states and, in general, is more broadly applicable to nonsymmetric systems. Enlightened by these facts, we combine them to show that Markov chains, due to two different clustering techniques they offer, are effective approaches for clustering in more general situations. In this dissertation, we advance the state of the art of spectral clustering and introduce a new algorithm to decompose matrices into blocks. We first prove that the second eigenvector of the signless Laplacian provides a heuristic solution to the NP-complete state clustering problem which is the dual problem of graph partitioning. A new method for clustering nodes of a graph that have negative edge weights is also proposed. Second, a connection between the singular vectors obtained from an SVD decomposition and the eigenvectors from spectral algorithms on data clustering is revealed. We show that the singular vectors of the node-edge incidence matrix generate not only clusters on the nodes but also clusters on the edges. Third, relating spectral clustering and state clustering of Markov chains, we present two clustering techniques for Markov chains based on two different measures and suggest a mean of incorporating both techniques to obtain comprehensive information concerning state clusters. Fourth, we display the connection between spectral clustering and dimension reduction techniques in statistical clustering. Also, the results obtained from spectral and statistical clustering are shown to be related. Finally, we develop a new improved spectral clustering procedure for decomposing matrices into blocks. This algorithm works well in several applications, especially in problems of detecting communities in complex networks, where some existing methods, e.g. MARCA and TPABLO, fail. Advisors/Committee Members: Dr. William J. Stewart, Committee Chair (advisor), Dr. Harry G. Perros, Committee Co-Chair (advisor), Dr. Laurie Williams, Committee Member (advisor), Dr. Michael Devetsikiotis, Committee Member (advisor).

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Liu N. Spectral Clustering for Graphs and Markov Chains. [Internet] [Doctoral dissertation]. North Carolina State University; 2010. [cited 2019 Mar 23]. 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

Virginia Tech

20. 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)

▼ 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 are challenged with predicting vehicle loads through modeling and simulation. The accuracy of these simulation results depends not only on the fidelity of the model, but also on the excitation to the model. It is clear that the terrain is the main excitation to the vehicle [1]. The inputs to these models are often based directly on physical measurements (terrain profiles); therefore, the terrain measurements must be as accurate as possible. A collection of novel methods can be developed to aid in the study and application of 3D terrain measurements, which are dense and non-uniform, including efficient gridding, stochastic modeling, and compact characterization. Terrain measurements are not collected with uniform spacing, which is necessary for efficient data storage and simulation. Many techniques are developed to help effectively grid dense terrain point clouds in a curved regular grid (CRG) format, including center and random vehicle paths, sorted gridding methods, and software implementation. In addition, it is beneficial to characterize the terrain as a realization of an underlying stochastic process and to develop a mathematical model of that process. A method is developed to represent a continuous-state Markov chain as a collection of univariate distributions, to be applied to terrain road profiles. The resulting form is extremely customizable and significantly more compact than a discrete-state Markov chain, yet it still provides a viable alternative for stochastically modeling terrain. Many new simulation techniques take advantage of 3D gridded roads along with traditional 2D terrain profiles. A technique is developed to model and synthesize 3D terrain surfaces by applying a variety of 2D stochastic models to the topological components of terrain, which are also decomposed into frequency bandwidths and down-sampled. The quality of the synthetic surface is determined using many statistical tests, and the entire work is implemented into a powerful software suite. Engineers from many disciplines who work with terrain surfaces need to describe the overall physical characteristics compactly and consistently. A method is developed to characterize terrain surfaces with a few coefficients by performing a principal component analysis, via singular value decomposition (SVD), to the parameter sets that define a collection of surface models. Advisors/Committee Members: Ferris, John B. (committeechair), Tjhung, Tana (committee member), Taheri, Saied (committee member).

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

Vancouver:

Lambeth JN. Improved Methods for Gridding, Stochastic Modeling, and Compact Characterization of Terrain Surfaces. [Internet] [Masters thesis]. Virginia Tech; 2013. [cited 2019 Mar 23]. 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

21. 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)

▼

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 é obtida deste procedimento. Apresentamos alguns resultados bem conhecidos sobre o comportamento dessa cadeia de Markov. Combinamos alguns destes resultados para obter uma proposição sobre a probabilidade da componente atingir um determinado tamanho e um resultado de convergência do estado da cadeia neste instante. Posteriormente, aplicamos o teorema de convergência de Darling (2002) a sequência de cadeias de Markov reescaladas e indexadas por N, o número de vértices do grafo, para mostrar que as trajetórias dessas cadeias convergem uniformemente em probabilidade para a solução de uma equação diferencial ordinária. Deste resultado segue a bem conhecida lei fraca dos grandes números para a componente gigante do grafo aleatório de Erdos-Rényi, no caso supercrítico. Além disso, obtemos o limite do fluído para um modelo epidêmico que é uma extensão daquele proposto em Kurtz et al. (2008).

In this work, we apply the Breadth-First Search algorithm to find the size of a connected component of the Erdos-Rényi random graph. A Markov chain is obtained of this procedure. We present some well-known results about the behavior of this Markov chain, and combine some of these results to obtain a proposition about the probability that the component reaches a certain size and a convergence result about the state of the chain at that time. Next, we apply the convergence theorem of Darling (2002) to the sequence of rescaled Markov chains indexed by N, the number of vertices of the graph, to show that the trajectories of these chains converge uniformly in probability to the solution of an ordinary dierential equation. From the latter result follows the well-known weak law of large numbers of the giant component of the Erdos-Renyi random graph, in the supercritical case. Moreover, we obtain the uid limit for an epidemic model which is an extension of that proposed in Kurtz et al. (2008).

Advisors/Committee Members: Machado, Fabio Prates.

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

Record Details Similar Records Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

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 2019 Mar 23]. 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/ ;

22. 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 Cite « Share

❌

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 23, 2019. 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. 23 Mar 2019.

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 2019 Mar 23]. 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

University of Vienna

23. Azesberger, Dietmar. Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht.

Degree: 2010, University of Vienna

URL: http://othes.univie.ac.at/9769/

►

Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht - Der Titel bezieht sich auf (nicht ganz ernst zu nehmende) praktische Anwendungen des eigentlichen Inhalts dieser… (more)

▼

Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht - Der Titel bezieht sich auf (nicht ganz ernst zu nehmende) praktische Anwendungen des eigentlichen Inhalts dieser Arbeit: Irrfahrten und Markov-Ketten. Da für die Behandlung eines wahrscheinlichkeitstheoretischen Themas ein Basiswissen zur Stochastik nötig ist, liefert das erste Kapitel diese Grundlagen und spezielle Inhalte, die für die weiteren Kapitel notwendig sind bzw. dort den logischen Aufbau unterbrechen würden. Außerdem dient das erste Kapitel dazu, mit den hier verwendeten Symbolen und Begriffen vertraut zu werden. Das zweite Kapitel beschäftigt sich dann mit Markov-Ketten. Man könnte Markov-Ketten beschreiben als stochastische Prozesse mit extremem Kurzzeitgedächtnis, deren Verhalten im nächsten Schritt nur vom gegenwärtigen Zustand und nicht von der Vergangenheit abhängt. Betrachtet wird vor allem das Langzeitverhalten von Markov-Ketten: Die Wahrscheinlichkeit einer Absorption im Fall existierender absorbierender Zustände, die Wahrscheinlichkeit eines Eintritts in einen Zustand in endlicher Zeit, die Rückkehr zum Startpunkt in endlicher Zeit und stationäre Verteilungen. Den Abschluss bildet ein Satz über die Konvergenz gegen die stationäre Verteilung. Den einfachen Irrfahrten auf Z^d widmet sich das dritte Kapitel. Es handelt sich dabei um Markov-Ketten, die zu jedem Zeitpunkt die Möglichkeiten eines Schritts mit konstanter Länge in eine Richtung haben und dabei unabhängig davon entscheiden, woher sie gekommen sind. Für den nächsten Schritt ist nur der momentane Zustand ausschlaggebend. Nacheinander werden Irrfahrten in einer, zwei und in drei oder mehr Dimensionen behandelt. Insbesondere wird dem Langzeitverhalten Beachtung geschenkt. Man interessiert sich dafür, ob der Betrunkene (eine praktische Situation der ein- und zweidimensionalen Irrfahrt) zurückfindet und ob man Kinder im unendlichen Klettergerüst alleine lassen darf. Das Resultat steckt schon im Titel: Der Betrunkene kehrt mit Wahrscheinlichkeit 1 zurück, das Kind nicht unbedingt. Im letzten Kapitel wird dann eine Möglichkeit beschrieben, die Irrfahrten des dritten Kapitels zu simulieren. Dazu wird das CAS Mathematica verwendet. Neben den Eingabebefehlen und ihren Erklärungen finden sich Plots verschiedener Irrfahrten.

Why drunks find back but children in a jungle gym don't - The title refers to real life-applications (not to be taken too seriously) of the thesis' content: Random walks and Markov chains. In order to treat probabilistic problems some stochastic knowledge is necessary. Chapter one contains this basics and, additionally, special issues, which are necessary for following chapters and would probably interrupt the progress later on. Furthermore chapter one explains symbols, terms and definitions. Chapter two deals with Markov chains. Markov chains can be described as stochastic processes, whose short time memory doesn't work very well. They only remember their present state, when they decide what to do in the next step. The past has no relevance.…

Subjects/Keywords: 31.70 Wahrscheinlichkeitsrechnung; Irrfahrtsproblem / Markov-Kette; Random walks / Markov chains

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Azesberger, D. (2010). Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/9769/

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):

Azesberger, Dietmar. “Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht.” 2010. Thesis, University of Vienna. Accessed March 23, 2019. http://othes.univie.ac.at/9769/.

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

MLA Handbook (7^th Edition):

Azesberger, Dietmar. “Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht.” 2010. Web. 23 Mar 2019.

Vancouver:

Azesberger D. Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht. [Internet] [Thesis]. University of Vienna; 2010. [cited 2019 Mar 23]. Available from: http://othes.univie.ac.at/9769/.

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

Council of Science Editors:

Azesberger D. Warum Betrunkene zurückfinden, Kinder im Klettergerüst hingegen nicht. [Thesis]. University of Vienna; 2010. Available from: http://othes.univie.ac.at/9769/

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

24. Ben Mabrouk, Mohamed. Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals.

Degree: Docteur es, Mathématiques appliquées, 2011, Evry, Institut national des télécommunications

URL: http://www.theses.fr/2011TELE0014

► La restauration statistique non-supervisée de signaux admet d'innombrables applications dans les domaines les plus divers comme économie, santé, traitement du signal, ... Un des problèmes… (more)

▼ La restauration statistique non-supervisée de signaux admet d'innombrables applications dans les domaines les plus divers comme économie, santé, traitement du signal, ... Un des problèmes de base, qui est au coeur de cette thèse, est d'estimer une séquence cachée (Xn)1:N à partir d'une séquence observée (Yn)1:N. Ces séquences sont considérées comme réalisations, respectivement, des processus (Xn)1:N et (Yn)1:N. Plusieurs techniques ont été développées pour résoudre ce problème. Le modèle parmi le plus répandu pour le traiter est le modèle dit "modèle de Markov caché" (MMC). Plusieurs extensions de ces modèles ont été proposées depuis 2000. Dans les modèles de Markov couples (MMCouples), le couple (X, Y) est markovien, ce qui implique que p(x|y) est également markovienne (alors que p(x) ne l'est plus nécessairement), ce qui permet les mêmes traitements que dans les MMC. Plus récemment (2002) les MMCouples ont été étendus aux "modèles de Markov triplet" (MMT), dans lesquels on introduit un processus auxiliaire U et suppose que le triplet T = (X, U, Y) est markovien. Là encore il est possible, dans un cadre plus général que celui des MMCouples, d'effectuer des traitements avec une complexité raisonnable. L'objectif de cette thèse est de proposer des nouvelles modélisations faisant partie des MMT et d'étudier leur pertinence et leur intérêt. Nous proposons deux types de nouveautés: (i) Lorsque la chaîne cachée est discrète et lorsque le couple (X, Y) n'est pas stationnaire, avec un nombre fini de "sauts" aléatoires dans les paramètres, l'utilisation récente des MMT dans lesquels les sauts sont modélisés par un processus discret U a donné des résultats très convaincants (Lanchantin, 2006). Notre première idée est d'utiliser cette démarche avec un processus U continu, qui modéliserait des non-stationnarités "continues" de(X, Y). Nous proposons des chaînes et des champs triplets et présentons quelques expériences. Les résultats obtenus dans la modélisation de la non-stationnarité continue semblent moins intéressants que dans le cas discret. Cependant, les nouveaux modèles peuvent présenter d'autres intérêts; en particulier, ils semblent plus efficaces que les modèles "chaînes de Markov cachées" classiques lorsque le bruit est corrélé; (ii) Soit un MMT T = (X, U, Y) tel que X et Y sont continu et U est discret fini. Nous sommes en présence du problème de filtrage, ou du lissage, avec des sauts aléatoires. Dans les modélisations classiques le couple caché (X, U) est markovien mais le couple (U, Y) ne l'est pas, ce qui est à l'origine de l'impossibilité des calculs exacts avec une complexité linéaire en temps. Il est alors nécessaire de faire appel à diverses méthodes approximatives, dont celles utilisant le filtrage particulaire sont parmi les plus utilisées. Dans des modèles MMT récents le couple caché (X, U) n'est pas nécessairement markovien, mais le couple (U, Y) l'est, ce qui permet des traitements exacts avec une complexité raisonnable (Pieczynski 2009). Notre deuxième idée est d'étendre ces derniers modèles aux… Advisors/Committee Members: Pieczynski, Wojciech (thesis director).

Subjects/Keywords: Chaînes Markov cachées; Chaînes couple et triplet; Chaîne partiellement de Markov; Hidden Markov chains; Markov models couples and triplet; Partially markov chains

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ben Mabrouk, M. (2011). Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals. (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2011TELE0014

Chicago Manual of Style (16^th Edition):

Ben Mabrouk, Mohamed. “Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals.” 2011. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed March 23, 2019. http://www.theses.fr/2011TELE0014.

MLA Handbook (7^th Edition):

Ben Mabrouk, Mohamed. “Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals.” 2011. Web. 23 Mar 2019.

Vancouver:

Ben Mabrouk M. Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals. [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2011. [cited 2019 Mar 23]. Available from: http://www.theses.fr/2011TELE0014.

Council of Science Editors:

Ben Mabrouk M. Modèles de Markov triplets en restauration des signaux : Triplet Markov models in restoration signals. [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2011. Available from: http://www.theses.fr/2011TELE0014

25. Maria Aparecida da Silva Soares. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral.

Degree: 2010, Universidade Federal do Rio Grande do Norte

URL: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=3293

►

Neste trabalho vamos estudamos a consistência para uma classe de estimadores núcleo de f (.) em cadeias de Markov com espaço de estados geral E… (more)

Subjects/Keywords: Ergodicidade geométrica; MATEMATICA APLICADA; Markov chains; kernel estimates; Geometrically ergodic; Cadeias de Markov; Estimadores núcleo

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Soares, M. A. d. S. (2010). Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral. (Thesis). Universidade Federal do Rio Grande do Norte. Retrieved from http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=3293

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):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral.” 2010. Thesis, Universidade Federal do Rio Grande do Norte. Accessed March 23, 2019. http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=3293.

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

MLA Handbook (7^th Edition):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral.” 2010. Web. 23 Mar 2019.

Vancouver:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral. [Internet] [Thesis]. Universidade Federal do Rio Grande do Norte; 2010. [cited 2019 Mar 23]. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=3293.

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

Council of Science Editors:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral. [Thesis]. Universidade Federal do Rio Grande do Norte; 2010. Available from: http://bdtd.bczm.ufrn.br/tedesimplificado//tde_busca/arquivo.php?codArquivo=3293

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

26. Kepler, Fábio Natanael. Modelagem de contextos para aprendizado automático aplicado à análise morfossintática.

Degree: PhD, Ciência da Computação, 2010, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05082010-223515/ ;

►

A etiquetagem morfossintática envolve atribuir às palavras de uma sentença suas classes morfossintáticas de acordo com os contextos em que elas aparecem. Cadeias de Markov… (more)

▼

A etiquetagem morfossintática envolve atribuir às palavras de uma sentença suas classes morfossintáticas de acordo com os contextos em que elas aparecem. Cadeias de Markov de Tamanho Variável (VLMCs, do inglês \"Variable-Length Markov Chains\") oferecem uma forma de modelar contextos maiores que trigramas sem sofrer demais com a esparsidade de dados e a complexidade do espaço de estados. Mesmo assim, duas palavras do português apresentam um alto grau de ambiguidade: \'queé \'a\'. O número de erros na etiquetagem dessas palavras corresponde a um quarto do total de erros cometidos por um etiquetador baseado em VLMCs. Além disso, essas palavras parecem apresentar dois diferentes tipos de ambiguidade: um dependendo de contexto não local e outro de contexto direito. Exploramos maneiras de expandir o modelo baseado em VLMCs através do uso de diferentes modelos e métodos, a fim de atacar esses problemas. As abordagens mostraram variado grau de sucesso, com um método em particular (aprendizado guiado) se mostrando capaz de resolver boa parte da ambiguidade de \'a\'. Discutimos razões para isso acontecer. Com relação a \'que\', ao longo desta tese propusemos e testamos diversos métodos de aprendizado de informação contextual para tentar desambiguá-lo. Mostramos como, em todos eles, o nível de ambiguidade de \'queṕermanece praticamente constante.

Part-of-speech tagging involves assigning to words in a sentence their part-of-speech class based on the contexts they appear in. Variable-Length Markov Chains (VLMCs) offer a way of modeling contexts longer than trigrams without suffering too much from data sparsity and state space complexity. Even so, two words in Portuguese show a high degree of ambiguity: \'queánd \'a\'. The number of errors tagging these words corresponds to a quarter of the total errors made by a VLMC-based tagger. Moreover, these words seem to show two different types of ambiguity: one depending on non-local context and one on right context. We searched ways of expanding the VLMC-based model with a number of different models and methods in order to tackle these issues. The approaches showed variable degrees of success, with one particular method (Guided Learning) solving much of the ambiguity of \'a\'. We explore reasons why this happened. Rega rding \'que\', throughout this thesis we propose and test various methods for learning contextual information in order to try to disambiguate it. We show how, in all of them, the level of ambiguity shown by \'queŕemains practically c onstant.

Advisors/Committee Members: Finger, Marcelo.

Subjects/Keywords: Cadeias de markov; Computational linguistics; Etiquetagem morfossintática; Linguística computacional; Markov chains; Part-of-speech tagging

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kepler, F. N. (2010). Modelagem de contextos para aprendizado automático aplicado à análise morfossintática. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05082010-223515/ ;

Chicago Manual of Style (16^th Edition):

Kepler, Fábio Natanael. “Modelagem de contextos para aprendizado automático aplicado à análise morfossintática.” 2010. Doctoral Dissertation, University of São Paulo. Accessed March 23, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05082010-223515/ ;.

MLA Handbook (7^th Edition):

Kepler, Fábio Natanael. “Modelagem de contextos para aprendizado automático aplicado à análise morfossintática.” 2010. Web. 23 Mar 2019.

Vancouver:

Kepler FN. Modelagem de contextos para aprendizado automático aplicado à análise morfossintática. [Internet] [Doctoral dissertation]. University of São Paulo; 2010. [cited 2019 Mar 23]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05082010-223515/ ;.

Council of Science Editors:

Kepler FN. Modelagem de contextos para aprendizado automático aplicado à análise morfossintática. [Doctoral Dissertation]. University of São Paulo; 2010. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-05082010-223515/ ;

Universidade do Rio Grande do Norte

27. Soares, Maria Aparecida da Silva. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .

Degree: 2010, Universidade do Rio Grande do Norte

URL: http://repositorio.ufrn.br/handle/123456789/18631

► In this work we studied the consistency for a class of kernel estimates of f f (.) in the Markov chains with general state space… (more)

Subjects/Keywords: Cadeias de Markov; Estimadores núcleo; Ergodicidade geométrica; Markov chains; kernel estimates; Geometrically ergodic

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Soares, M. A. d. S. (2010). Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18631

Chicago Manual of Style (16^th Edition):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .” 2010. Masters Thesis, Universidade do Rio Grande do Norte. Accessed March 23, 2019. http://repositorio.ufrn.br/handle/123456789/18631.

MLA Handbook (7^th Edition):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .” 2010. Web. 23 Mar 2019.

Vancouver:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2010. [cited 2019 Mar 23]. Available from: http://repositorio.ufrn.br/handle/123456789/18631.

Council of Science Editors:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . [Masters Thesis]. Universidade do Rio Grande do Norte; 2010. Available from: http://repositorio.ufrn.br/handle/123456789/18631

Universidade Federal de Viçosa

28. Cecilia Félix Andrade. Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC.

Degree: 2008, Universidade Federal de Viçosa

URL: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=1538

►

Amazon colonization has been carried out in a disordered way with major environmental impacts and low economic and social returns. Aiming to minimize impacts and… (more)

▼

Amazon colonization has been carried out in a disordered way with major environmental impacts and low economic and social returns. Aiming to minimize impacts and growth of periphery of cities, the State of Acre has the Agroforestry Systems (SAF s) as a means of improving rural production and consequently reducing deforestation in the state, seeking equilibrium and environmental, economic and social sustainability. However, a number of these projects, lacking technical support, have been losing their features and being neglected. The objective of this study was to analyze the Custodio Freire Agroflorestry Pole, municipality of Rio Branco - AC and, starting from environmental impacts and socioeconomic indicators to seek alternatives that can resolve or mitigate them. TM/Landsat-5 (1986.1993, 2002 and 2007) and ETM + / Landsat-7 (1999 and 2002) images were used to interpret the vegetation cover for the mentioned years, and the Markov Chain model was applied to shape this change, using the two previous years to predict the future ones. Fieldwork was the basis for a qualitative analysis of environmental impacts using "ad hoc", "check-list" and interaction matrix. During the work, settlers were interviewed through participatory techniques about the main socioeconomic problems. The results showed that between 1999 and 2002 there was the greatest loss of vegetation cover in the Pole (30.16%) and this lack of cover disqualifies the agroforestry use. Change in cover is dynamic and the Markovs forecast differed by 1554 % from the visual interpretation, showing that the transition matrix is not stationary. The main negative impact on the Pole is related to improper soil management, since physical characteristics make the soil difficult to manage under drought or flooding. The participatory survey of farmers elucidated the real problems affecting the settlers, such as lack of paved road to access the main road, since shipping produce is impossible in the rainy season, to the complete lack of knowledge of what a SAF is and its production characteristics. Adding to these problems, the small area of lots (2.5 ha) and the lack of technical support contribute to that settlers seek work outside the Pole for extra income. Custodio Freire Pole has, at the present, a large number of problems and has totally lost its features. In this work, suggestions for resumption of the original aims are presented for this production system, which, according to a number of studies, has been one of the most viable for the small farmers of the Amazon Region.

O objetivo do trabalho foi analisar o Pólo Agroflorestal Custódio Freire, município de Rio Branco - AC a partir dos impactos ambientais e indicadores socioeconômicos. Por meio da análise multitemporal das imagens Landsat 5 e 7, conjuntamente com aplicação da Cadeia de Markov, analisou- se a alteração na cobertura florestal. Observou-se um aumento da área desflorestada em relação à floresta. Apesar dos resultados serem diferenciados em relação à interpretação analógica, o modelo de Markov serviu…

Advisors/Committee Members: João Luiz Lani, José Marinaldo Gleriani, Vicente Paulo Soares, Elias Silva, Guido Assunção Ribeiro.

Subjects/Keywords: Técnicas participativas; Cadeias de Markov; Fotointerpretação; MANEJO FLORESTAL; Photointerpretation; Markov chains; Participatory techniques

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Andrade, C. F. (2008). Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC. (Thesis). Universidade Federal de Viçosa. Retrieved from http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=1538

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):

Andrade, Cecilia Félix. “Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC.” 2008. Thesis, Universidade Federal de Viçosa. Accessed March 23, 2019. http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=1538.

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

MLA Handbook (7^th Edition):

Andrade, Cecilia Félix. “Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC.” 2008. Web. 23 Mar 2019.

Vancouver:

Andrade CF. Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC. [Internet] [Thesis]. Universidade Federal de Viçosa; 2008. [cited 2019 Mar 23]. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=1538.

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

Council of Science Editors:

Andrade CF. Análise multitemporal da cobertura e uso da terra, impactos ambientais e aspectos socioeconômicos do Pólo Agroflorestal Custódio Freire, Rio Branco AC. [Thesis]. Universidade Federal de Viçosa; 2008. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=1538

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

Brunel University

29. Erlwein, Christina. Applications of hidden Markov models in financial modelling.

Degree: 2008, Brunel University

URL: http://bura.brunel.ac.uk/handle/2438/7898 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445607

► Various models driven by a hidden Markov chain in discrete or continuous time are developed to capture the stylised features of market variables whose levels… (more)

Subjects/Keywords: 332.01519233; Markov chains : Hidden Markov models : Commodity prices : Interest rates : Asset allocation

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Erlwein, C. (2008). Applications of hidden Markov models in financial modelling. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/7898 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445607

Chicago Manual of Style (16^th Edition):

Erlwein, Christina. “Applications of hidden Markov models in financial modelling.” 2008. Doctoral Dissertation, Brunel University. Accessed March 23, 2019. http://bura.brunel.ac.uk/handle/2438/7898 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445607.

MLA Handbook (7^th Edition):

Erlwein, Christina. “Applications of hidden Markov models in financial modelling.” 2008. Web. 23 Mar 2019.

Vancouver:

Erlwein C. Applications of hidden Markov models in financial modelling. [Internet] [Doctoral dissertation]. Brunel University; 2008. [cited 2019 Mar 23]. Available from: http://bura.brunel.ac.uk/handle/2438/7898 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445607.

Council of Science Editors:

Erlwein C. Applications of hidden Markov models in financial modelling. [Doctoral Dissertation]. Brunel University; 2008. Available from: http://bura.brunel.ac.uk/handle/2438/7898 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445607

Universidade do Rio Grande do Norte

30. Soares, Maria Aparecida da Silva. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .

Degree: 2010, Universidade do Rio Grande do Norte

URL: http://repositorio.ufrn.br/handle/123456789/18631

► In this work we studied the consistency for a class of kernel estimates of f f (.) in the Markov chains with general state space… (more)

Subjects/Keywords: Cadeias de Markov; Estimadores núcleo; Ergodicidade geométrica; Markov chains; kernel estimates; Geometrically ergodic

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Soares, M. A. d. S. (2010). Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18631

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):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .” 2010. Thesis, Universidade do Rio Grande do Norte. Accessed March 23, 2019. http://repositorio.ufrn.br/handle/123456789/18631.

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

MLA Handbook (7^th Edition):

Soares, Maria Aparecida da Silva. “Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral .” 2010. Web. 23 Mar 2019.

Vancouver:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2010. [cited 2019 Mar 23]. Available from: http://repositorio.ufrn.br/handle/123456789/18631.

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

Council of Science Editors:

Soares MAdS. Estimador do Tipo Núcleo para Densidades Limites de Cadeias de Markov com Espaço de Estados Geral . [Thesis]. Universidade do Rio Grande do Norte; 2010. Available from: http://repositorio.ufrn.br/handle/123456789/18631

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

Open Access Theses and Dissertations