This PhD thesis consists of a summary and four papers which deal with stochastic approximation algorithms and first-passage percolation. Paper I deals with the a.s. limiting properties of bounded stochastic approximation algorithms in relation to the equilibrium points of the drift function. Applications are given to some generalized Pólya urn processes. Paper II continues the work of Paper I and investigates under what circumstances one gets asymptotic normality from a properly scaled algorithm. The algorithms are shown to converge in some other circumstances, although the limiting distribution is not identified. Paper III deals with the asymptotic speed of first-passage percolation on a graph called the ladder when the times associated to the edges are independent, exponentially distributed with the same intensity. Paper IV generalizes the work of Paper III in allowing more edges in the graph as well as not having all intensities equal.

In this thesis we focus on multiscale and multiphysics problems. We derive a posteriori error estimates for a one way coupled multiphysics problem, using the dual weighted residual method. Such estimates can be used to drive local mesh refinement in adaptive algorithms, in order to efficiently obtain good accuracy in a desired goal quantity, which we demonstrate numerically. Furthermore we prove existence and uniqueness of finite element solutions for a two way coupled multiphysics problem. The possibility of deriving dual weighted a posteriori error estimates for two way coupled problems is also addressed. For a two way coupled linear problem, we show numerically that unless the coupling of the equations is to strong the propagation of errors between the solvers goes to zero. We also apply a variational multiscale method to both an elliptic and a hyperbolic problem that exhibits multiscale features. The method is based on numerical solutions of decoupled local fine scale problems on patches. For the elliptic problem we derive an a posteriori error estimate and use an adaptive algorithm to automatically tune the resolution and patch size of the local problems. For the hyperbolic problem we demonstrate the importance of how to construct the patches of the local problems, by numerically comparing the results obtained for symmetric and directed patches.

Outcome dependent sampling may increase efficiency in observational studies. It is however not always obvious how to sample efficiently, and how to analyze the resulting data without introducing bias. This thesis describes a general framework for efficiency calculations in multistage sampling, with focus on what is sometimes referred to as ascertainment sampling. A method for correcting for the sampling scheme in analysis of ascertainment samples is also presented. Simulation based methods are used to overcome computational issues in both efficiency calculations and analysis of data. / At the time of doctoral defense, the following paper was unpublished and had a status as follows: Paper 1: Submitted.

In this thesis, we review some applications of random matrix theory in machine learning and theoretical deep learning. More specifically, we review data modelling in the regime of numerous and large dimensional data, a method for estimating covariance matrix distances in the aforementioned regime, as well as an asymptotic analysis of a simple neural network model in the limit where the number of neurons is large and the data is both numerous and large dimensional. We also review some recent research where random matrix models and methods have been applied to Hessian matrices of neural networks with interesting results. As becomes apparent, random matrix theory is a useful tool for various machine learning applications and it is a fruitful field of mathematics toexplore, in particular, in the context of theoretical deep learning. / I denna uppsatsen undersöker vi några tillämpningar av slumpmatristeori inom maskininlärning och teoretisk djupinlärning. Mer specifikt undersöker vi datamodellering i domänet där både datamängden och dimensionen på datan är stor, en metod för att uppskatta avstånd mellan kovariansmatriser i det tidigare nämnda domänet, samt en asymptotisk analys av en enkel neuronnätsmodell i gränsen där antalet neuroner är stort och både datamängden och dimensionen pådatan är stor. Vi undersöker också en del aktuell forskning där slumpmatrismodeller och metoder från slumpmatristeorin har tillämpats på Hessianska matriserför artificiella neuronnätverk med intressanta resultat. Det visar sig att slumpmatristeori är ett användbart verktyg för olika maskininlärningstillämpningaroch är ett område av matematik som är särskilt givande att utforska inom kontexten för teoretisk djupinlärning.

This thesis consists of five papers related to the theory of unequal probability sampling from a finite population. Generally, it is assumed that we wish to make modelassisted inference, i.e. the inclusion probability for each unit in the population is prescribed before the sample is selected. The sample is then selected using some random mechanism, the sampling design. Mostly, the thesis is focused on three particular unequal probability sampling designs, the conditional Poisson (CP-) design, the Sampford design, and the Pareto design. They have different advantages and drawbacks: The CP design is a maximum entropy design but it is difficult to determine sampling parameters which yield prescribed inclusion probabilities, the Sampford design yields prescribed inclusion probabilities but may be hard to sample from, and the Pareto design makes sample selection very easy but it is very difficult to determine sampling parameters which yield prescribed inclusion probabilities. These three designs are compared probabilistically, and found to be close to each other under certain conditions. In particular the Sampford and Pareto designs are probabilistically close to each other. Some effort is devoted to analytically adjusting the CP and Pareto designs so that they yield inclusion probabilities close to the prescribed ones. The result of the adjustments are in general very good. Some iterative procedures are suggested to improve the results even further. Further, balanced unequal probability sampling is considered. In this kind of sampling, samples are given a positive probability of selection only if they satisfy some balancing conditions. The balancing conditions are given by information from auxiliary variables. Most of the attention is devoted to a slightly less general but practically important case. Also in this case the inclusion probabilities are prescribed in advance, making the choice of sampling parameters important. A complication which arises in the context of choosing sampling parameters is that certain probability distributions need to be calculated, and exact calculation turns out to be practically impossible, except for very small cases. It is proposed that Markov Chain Monte Carlo (MCMC) methods are used for obtaining approximations to the relevant probability distributions, and also for sample selection. In general, MCMC methods for sample selection does not occur very frequently in the sampling literature today, making it a fairly novel idea.

<p>Brownian motion has met growing interest in mathematics, physics and particularly in finance since it was introduced in the beginning of the twentieth century. Stochastic processes generalizing Brownian motion have influenced many research fields theoretically and practically. Moreover, along with more refined techniques in measure theory and functional analysis more stochastic processes were constructed and studied. Lévy processes, with Brownian motionas a special case, have been of major interest in the recent decades. In addition, Lévy processes include a number of other important processes as special cases like Poisson processes and subordinators. They are also related to stable processes.</p><p>In this thesis we generalize a result by S. Chandrasekhar [2] and Edward Nelson who gave a detailed proof of this result in his book in 1967 [12]. In Nelson’s first result standard Ornstein-Uhlenbeck processes are studied. Physically this describes free particles performing a random and irregular movement in water caused by collisions with the water molecules. In a further step he introduces a nonlinear drift in the position variable, i.e. he studies the case when these particles are exposed to an external field of force in physical terms.</p><p>In this report, we aim to generalize the result of Edward Nelson to the case of α-stable Lévy processes. In other words we replace the driving noise of a standard Ornstein-Uhlenbeck process by an α-stable Lévy noise and introduce a scaling parameter uniformly in front of all vector fields in the cotangent space, even in front of the noise. This corresponds to time being sent to infinity. With Chandrasekhar’s and Nelson’s choice of the diffusion constant the stationary state of the velocity process (which is approached as time tends to infinity) is the Boltzmann distribution of statistical mechanics.The scaling limits we obtain in the absence and presence of a nonlinear drift term by using the scaling property of the characteristic functions and time change, can be extended to other types of processes rather than α-stable Lévy processes.</p><p>In future, we will consider to generalize this one dimensional result to Euclidean space of arbitrary finite dimension. A challenging task is to consider the geodesic flow on the cotangent bundle of a Riemannian manifold with scaled drift and scaled Lévy noise. Geometrically the Ornstein-Uhlenbeck process is defined on the tangent bundle of the real line and the driving Lévy noise is defined on the cotangent space.</p>

<p>In this thesis we present a new space-time model of interacting agents in the financial market. It is a combination of the Curie-Weiss model and a model introduced by Järpe. We investigate properties such as the critical temperature and magnetization of the system. The distribution of the Hamiltonian function is obtained and a hypothesis test of independence is derived. The results are illustrated in an example based on real data.</p>

<p>This study is based on three models, Markov model, Hidden Markov model and the Radial basis function neural network. A number of work has been done before about application of these three models to the stock market. Though, individual researchers have developed their own techniques to design and test the Radial basis function neural network. This paper aims to show the different ways and precision of applying these three models to predict price processes of the stock market. By comparing the same group of data, authors get different results. Based on Markov model, authors find a tendency of stock market in future and, the Hidden Markov model behaves better in the financial market. When the fluctuation of the stock price index is not drastic, the Radial basis function neural network has a nice prediction.</p>

<p>In this thesis we study a scalar uniform and non-uniform quantization of random processes (or signals) in average case setting. Quantization (or discretization) of a signal is a standard task in all nalog/digital devices (e.g., digital recorders, remote sensors etc.). We evaluate the necessary memory capacity (or quantization rate) needed for quantized process realizations by exploiting the correlation structure of the model random process. The thesis consists of an introductory survey of the subject and related theory followed by four included papers (A-D).</p><p>In Paper A we develop a quantization coding method when quantization levels crossings by a process realization are used for its coding. Asymptotical behavior of mean quantization rate is investigated in terms of the correlation structure of the original process. For uniform and non-uniform quantization, we assume that the quantization cellwidth tends to zero and the number of quantization levels tends to infinity, respectively.</p><p>In Papers B and C we focus on an additive noise model for a quantized random process. Stochastic structures of asymptotic quantization errors are derived for some bounded and unbounded non-uniform quantizers when the number of quantization levels tends to infinity. The obtained results can be applied, for instance, to some optimization design problems for quantization levels.</p><p>Random signals are quantized at sampling points with further compression. In Paper D the concern is statistical inference for run-length encoding (RLE) method, one of the compression techniques, applied to quantized stationary Gaussian sequences. This compression method is widely used, for instance, in digital signal and image processing. First, we deal with mean RLE quantization rates for various probabilistic models. For a time series with unknown stochastic structure, we investigate asymptotic properties (e.g., asymptotic normality) of two estimates for the mean RLE quantization rate based on an observed sample when the sample size tends to infinity.</p><p>These results can be used in communication theory, signal processing, coding, and compression applications. Some examples and numerical experiments demonstrating applications of the obtained results for synthetic and real data are presented.</p>

Brownian motion has met growing interest in mathematics, physics and particularly in finance since it was introduced in the beginning of the twentieth century. Stochastic processes generalizing Brownian motion have influenced many research fields theoretically and practically. Moreover, along with more refined techniques in measure theory and functional analysis more stochastic processes were constructed and studied. Lévy processes, with Brownian motionas a special case, have been of major interest in the recent decades. In addition, Lévy processes include a number of other important processes as special cases like Poisson processes and subordinators. They are also related to stable processes. In this thesis we generalize a result by S. Chandrasekhar [2] and Edward Nelson who gave a detailed proof of this result in his book in 1967 [12]. In Nelson’s first result standard Ornstein-Uhlenbeck processes are studied. Physically this describes free particles performing a random and irregular movement in water caused by collisions with the water molecules. In a further step he introduces a nonlinear drift in the position variable, i.e. he studies the case when these particles are exposed to an external field of force in physical terms. In this report, we aim to generalize the result of Edward Nelson to the case of α-stable Lévy processes. In other words we replace the driving noise of a standard Ornstein-Uhlenbeck process by an α-stable Lévy noise and introduce a scaling parameter uniformly in front of all vector fields in the cotangent space, even in front of the noise. This corresponds to time being sent to infinity. With Chandrasekhar’s and Nelson’s choice of the diffusion constant the stationary state of the velocity process (which is approached as time tends to infinity) is the Boltzmann distribution of statistical mechanics.The scaling limits we obtain in the absence and presence of a nonlinear drift term by using the scaling property of the characteristic functions and time change, can be extended to other types of processes rather than α-stable Lévy processes. In future, we will consider to generalize this one dimensional result to Euclidean space of arbitrary finite dimension. A challenging task is to consider the geodesic flow on the cotangent bundle of a Riemannian manifold with scaled drift and scaled Lévy noise. Geometrically the Ornstein-Uhlenbeck process is defined on the tangent bundle of the real line and the driving Lévy noise is defined on the cotangent space.