Rozprawy doktorskie na temat „Random processes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Random processes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Makai, Tamas. "Random graph processes". Thesis, Royal Holloway, University of London, 2012. http://repository.royalholloway.ac.uk/items/b24b89af-3fc1-4d2f-a673-64483a3bc2f2/8/.
Pełny tekst źródłaKang, Mihyun. "Random planar structures and random graph processes". Doctoral thesis, [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985516585.
Pełny tekst źródłaZielen, Frank H. "Asymmetric random average processes". [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965270475.
Pełny tekst źródłaTimar, Adam. "Group-invariant random processes". [Bloomington, Ind.] : Indiana University, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3204537.
Pełny tekst źródłaSource: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0308. Adviser: Russell Lyons. "Title from dissertation home page (viewed Feb. 9, 2007)."
Ortgiese, Marcel. "Stochastic processes in random environment". Thesis, University of Bath, 2009. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.507234.
Pełny tekst źródłaWarnke, Lutz. "Random graph processes with dependencies". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:71b48e5f-a192-4684-a864-ea9059a25d74.
Pełny tekst źródłaDing, Xinhong Carleton University Dissertation Mathematics. "Diffusion processes with random interactions". Ottawa, 1992.
Znajdź pełny tekst źródłaSeierstad, Taral Guldahl. "The phase transition in random graphs and random graph processes". Doctoral thesis, [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985760044.
Pełny tekst źródłaHu, Yilei. "Essays on random processes with reinforcement". Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.669991.
Pełny tekst źródłaFigwer, Jarosław. "Synthesis and simulation of random processes". Praca habilitacyjna, Wydawnictwo Politechniki Śląskiej, 1999. https://delibra.bg.polsl.pl/dlibra/docmetadata?showContent=true&id=8070.
Pełny tekst źródłaHannigan, Patrick. "Random polynomials". Thesis, University of Ulster, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263248.
Pełny tekst źródłaYeo, Dominic. "Self-organised criticality in random graph processes". Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:23af1abc-2128-4315-9b25-55ed8f290875.
Pełny tekst źródłap(N) = | 1+λN-1/3 |
N |
Jones, Elinor Mair. "Large deviations of random walks and levy processes". Thesis, University of Manchester, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.491853.
Pełny tekst źródłaKandler, Anne, Matthias Richter, Scheidt Jürgen vom, Hans-Jörg Starkloff i Ralf Wunderlich. "Moving-Average approximations of random epsilon-correlated processes". Universitätsbibliothek Chemnitz, 2004. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200401266.
Pełny tekst źródłaSchmid, Patrick. "Random processes in truncated and ordinary Weyl chambers". Doctoral thesis, Universitätsbibliothek Leipzig, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-66394.
Pełny tekst źródłaShykula, Mykola. "Quantization of Random Processes and Related Statistical Problems". Doctoral thesis, Umeå : Department of Mathematics and Mathematical Statistics, Umeå University, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-883.
Pełny tekst źródłaPadgett, Wayne Thomas. "Detection of low order nonstationary gaussian random processes". Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/13523.
Pełny tekst źródłaJones, Owen Dafydd. "Random walks on pre-fractals and branching processes". Thesis, University of Cambridge, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388440.
Pełny tekst źródłaSmith, Jason Marko. "Discrete properties of continuous, non-Gaussian random processes". Thesis, University of Nottingham, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438330.
Pełny tekst źródłaEl-Feghi, Farag Abdulrazzak. "Miscible flooding in correlated random fields". Thesis, Heriot-Watt University, 1992. http://hdl.handle.net/10399/1506.
Pełny tekst źródłaBuckley, Stephen Philip. "Problems in random walks in random environments". Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:06a12be2-b831-4c2a-87b1-f0abccfb9b8b.
Pełny tekst źródłaNaumov, Alexey [Verfasser]. "Universality of some models of random matrices and random processes / Alexey Naumov. Fakultät für Mathematik". Bielefeld : Universitätsbibliothek Bielefeld, Hochschulschriften, 2013. http://d-nb.info/1032454121/34.
Pełny tekst źródłaLing, Hong. "Implementation of Stochastic Neural Networks for Approximating Random Processes". Master's thesis, Lincoln University. Environment, Society and Design Division, 2007. http://theses.lincoln.ac.nz/public/adt-NZLIU20080108.124352/.
Pełny tekst źródłaGrobys, Sebastian. "Random generation of Bayesian Networks and Markov Decision Processes". Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=81336.
Pełny tekst źródłaTokushige, Yuki. "Random Walks on random trees and hyperbolic groups: trace processes on boundaries at infinity and the speed of biased random walks". Kyoto University, 2019. http://hdl.handle.net/2433/242580.
Pełny tekst źródłaHägg, Jonas. "Gaussian fluctuations in some determinantal processes". Doctoral thesis, KTH, Matematik (Inst.), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4343.
Pełny tekst źródłaQC 20100716
Kang, Sungyeol. "Extreme values of random times in stochastic networks". Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24305.
Pełny tekst źródłaHermann, Felix [Verfasser], i Peter [Akademischer Betreuer] Pfaffelhuber. "On dualities of random graphs and branching processes with disasters to Piecewise deterministic Markov processes". Freiburg : Universität, 2019. http://d-nb.info/1182225985/34.
Pełny tekst źródłaYu, Jihnhee. "Approaches to the multivariate random variables associated with stochastic processes". Texas A&M University, 2003. http://hdl.handle.net/1969.1/1209.
Pełny tekst źródłaFrings, René [Verfasser]. "Interlacing Patterns in Exclusion Processes and Random Matrices / René Frings". Bonn : Universitäts- und Landesbibliothek Bonn, 2014. http://d-nb.info/1047622793/34.
Pełny tekst źródłaGabrysch, Katja. "On Directed Random Graphs and Greedy Walks on Point Processes". Doctoral thesis, Uppsala universitet, Analys och sannolikhetsteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-305859.
Pełny tekst źródłaBelu, Alexandru C. "Multivariate Measures of Dependence for Random Variables and Levy Processes". Case Western Reserve University School of Graduate Studies / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=case1333396376.
Pełny tekst źródłaMogharehabed, Saeideh. "A Suboptimal Multi-Clustering Algorithm for Random Labeled Point Processes". The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1483010792818099.
Pełny tekst źródłaFu, Zuopeng. "Karlin Random Fields: Limit Theorems, Representations and Simulations". University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1613754836854037.
Pełny tekst źródłaFedorov, Valery V., i Werner Müller. "Optimum design for correlated processes via eigenfunction expansions". Institut für Statistik und Mathematik, WU Vienna University of Economics and Business, 2004. http://epub.wu.ac.at/622/1/document.pdf.
Pełny tekst źródłaSeries: Research Report Series / Department of Statistics and Mathematics
Abramowicz, Konrad. "Numerical analysis for random processes and fields and related design problems". Doctoral thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-46156.
Pełny tekst źródłaJones, Brian Douglas. "Tree components in random graph processes with non-uniform edge probabilities /". The Ohio State University, 1995. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487867541733461.
Pełny tekst źródłaStrang, Alexander. "Applications of the Helmholtz-Hodge Decomposition to Networks and Random Processes". Case Western Reserve University School of Graduate Studies / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1595596768356487.
Pełny tekst źródłaOosthuizen, Joubert. "Random walks on graphs". Thesis, Stellenbosch : Stellenbosch University, 2014. http://hdl.handle.net/10019.1/86244.
Pełny tekst źródłaENGLISH ABSTRACT: We study random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time. We nd novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times. Lastly we look at a connection between random walks on graphs and electrical networks, where the hitting time between two vertices of a graph is expressed in terms of a weighted sum of e ective resistances. This expression in turn proves useful when we study the cover cost, a parameter related to the cover time.
AFRIKAANSE OPSOMMING: Ons bestudeer toevallige wandelings op eindige gra eke in hierdie tesis. Eers word algemene Markov kettings beskou voordat ons meer spesi ek aanbeweeg na toevallige wandelings op gra eke. 'n Toevallige wandeling is net 'n Markov ketting wat tyd herleibaar is. Die hoof paramaters wat ons bestudeer is die treftyd, pendeltyd en dektyd. Ons vind oorspronklike formules vir die dektyd van die verdeelde stergra ek sowel as die besemgra ek en kyk daarna na die twee bome met uiterste dektye. Laastens kyk ons na 'n verband tussen toevallige wandelings op gra eke en elektriese netwerke, waar die treftyd tussen twee punte op 'n gra ek uitgedruk word in terme van 'n geweegde som van e ektiewe weerstande. Hierdie uitdrukking is op sy beurt weer nuttig wanneer ons die dekkoste bestudeer, waar die dekkoste 'n paramater is wat verwant is aan die dektyd.
Peng, Man Kallenberg Olav. "Palm measure invariance and exchangeability for marked point processes". Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/FALL/Mathematics_and_Statistics/Dissertation/Peng_Man_3.pdf.
Pełny tekst źródłaBreen, Barbara J. "Computational nonlinear dynamics monostable stochastic resonance and a bursting neuron model /". Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04082004-180036/unrestricted/breen%5Fbarbara%5Fj%5F200312%5Fphd.pdf.
Pełny tekst źródłaVan, Zyl Alexis J. "Basic concepts of random matrix theory". Thesis, Stellenbosch : University of Stellenbosch, 2005. http://hdl.handle.net/10019.1/1624.
Pełny tekst źródłaIt was Wigner that in the 1950’s first introduced the idea of modelling physical reality with an ensemble of random matrices while studying the energy levels of heavy atomic nuclei. Since then, the field of Random Matrix Theory has grown tremendously, with applications ranging from fluctuations on the economic markets to M-theory. It is the purpose of this thesis to discuss the basic concepts of Random Matrix Theory, using the ensembles of random matrices originally introduced by Wigner, the Gaussian ensembles, as a starting point. As Random Matrix Theory is classically concerned with the statistical properties of levels sequences, we start with a brief introduction to the statistical analysis of a level sequence before getting to the introduction of the Gaussian ensembles. With the ensembles defined, we move on to the statistical properties that they predict. In the light of these predictions, a few of the classical applications of Random Matrix Theory are discussed, and as an example of some of the important concepts, the Anderson model of localization is investigated in some detail.
Wong, Ka Yiu. "Model-free tests for isotropy, equal distribution and random superposition in spatial point pattern analysis". HKBU Institutional Repository, 2015. https://repository.hkbu.edu.hk/etd_oa/202.
Pełny tekst źródłaGreenberg, Sam. "Random sampling of lattice configurations using local Markov chains". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/28090.
Pełny tekst źródłaCommittee Chair: Randall, Dana; Committee Member: Heitsch, Christine; Committee Member: Mihail, Milena; Committee Member: Trotter, Tom; Committee Member: Vigoda, Eric.
Vo, Ba Tuong. "Random finite sets in Multi-object filtering". University of Western Australia. School of Electrical, Electronic and Computer Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2009.0045.
Pełny tekst źródłaAltay, Suhan. "On Forward Interest Rate Models: Via Random Fields And Markov Jump Processes". Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608342/index.pdf.
Pełny tekst źródłaPuplinskaitė, Donata. "Aggregation of autoregressive processes and random fields with finite or infinite variance". Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917.
Pełny tekst źródłaAgreguoti duomenys naudojami daugelyje mokslo sričių tokių kaip ekonomika, sociologija, geografija ir kt. Tai motyvuoja tirti (de)agregavimo uždavinį. Viena iš pagrindinių priežasčių kodėl vienalaikis agregavimas tapo tyrimų objektu yra galimybė gauti ilgos atminties procesus. Agregavimas paaiškina ilgos atminties atsiradima procesuose ir yra vienas iš būdų tokius procesus generuoti. Agreguodami trumpos atminties neergodiškus atsitiktinius procesus, galime gauti ilgos atminties ergodišką procesą, kuris gali būti naudojamas mikro ir makro kintamųjų prognozavimui. Disertacijoje nagrinėjama AR(1) procesų bei artimiausio kaimyno atsitiktinių laukų, turinčių begalinę dispersiją, agregavimo schema, randamos sąlygos, kurioms esant ribinis agreguotas procesas egzistuoja, ir turi ilgąją atmintį tam tikra prasme. Atsitiktinių laukų atveju, įvedamas anizotropinės/izotropinės ilgos atminties apibrėžimas, kuris yra paremtas dalinių sumų elgesiu. Baigtinės dispersijos atveju yra gerai žinoma nepriklausomų AR(1) procesų schema, kuri rezultate duoda Gauso ribinį agreguotą procesą. Disertacijoje aprašoma trikampio masyvo agregavimo modelis, kuris baigtinės dispersijos atveju duoda nebūtinai Gauso ribinį agreguotą procesą. Taip pat disertacijoje nagrinėjama bankroto tikimybės asimptotika, kai žalos yra aprašomos sunkiauodegiu agreguotu procesu, nusakoma priklausomybė tarp žalų, apibūdinama žalų ilga atmintis.
Bernergård, Zandra. "Connection between discrete time random walks and stochastic processes by Donsker's Theorem". Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-48719.
Pełny tekst źródłaFellenberg, Benno, Jürgen vom Scheidt i Matthias Richter. "Simulation of Weakly Correlated Functions and its Application to Random Surfaces and Random Polynomials". Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801258.
Pełny tekst źródłaBrown, Martin Lloyd. "Stochastic process approximation method with application to random volterra integral equations". Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/29222.
Pełny tekst źródła