The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

Journal of Statistical Mechanics: theory and experiment

Thank you very much for reading methods of modern mathematical physics. Maybe you have knowledge that, people have look numerous times for their favorite novels like this methods of modern mathematical physics, but end up in harmful downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they are facing with some infectious virus inside their desktop computer. methods of modern mathematical physics is available in our digital library an online access to it is set as public so you can download it instantly. Our books collection saves in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Merely said, the methods of modern mathematical physics is universally compatible with any devices to read.

Methods Of Modern Mathematical Physics

We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distributions centered at the uniform distribution on the training samples, and we seek decisions that perform best in view of the worst-case distribution within this Wasserstein ball. The state-of-the-art methods for solving the resulting distributionally robust optimization problems rely on global optimization techniques, which quickly become computationally excruciating. In this paper we demonstrate that, under mild assumptions, the distributionally robust optimization problems over Wasserstein balls can in fact be reformulated as finite convex programs—in many interesting cases even as tractable linear programs. Leveraging recent measure concentration results, we also show that their solutions enjoy powerful finite-sample performance guarantees. Our theoretical results are exemplified in mean-risk portfolio optimization as well as uncertainty quantification.

/pdf/data-driven-distributionally-robust-optimization-using-the-45pptqtbnc.pdf

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations

Thank you for downloading an introduction to the theory of point processes. As you may know, people have search hundreds times for their chosen novels like this an introduction to the theory of point processes, but end up in infectious downloads. Rather than enjoying a good book with a cup of coffee in the afternoon, instead they juggled with some harmful virus inside their computer. an introduction to the theory of point processes is available in our digital library an online access to it is set as public so you can download it instantly. Our book servers hosts in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the an introduction to the theory of point processes is universally compatible with any devices to read.

An Introduction To The Theory Of Point Processes

In this article we prove local well-posedness of the system of equations $\partial_t h_{i}= \sum_{j=1}^{i}\partial_x^2 h_{i}+ (\partial_x h_{i})^2 + \xi $ on the circle where $1\leq i\leq N$ and $\xi$ is a space-time white noise. We attempt to generalize the renormalization procedure which gives the Hopf-Cole solution for the single layer equation and our $h_1$ (solution to the first layer) coincides with this solution. However, we observe that cancellation of logarithmic divergences that occurs at the first layer does not hold at higher layers and develop explicit combinatorial formulae for them.

Local solution to the multi-layer KPZ equation

We provide a full description for the joint fluctuations of current and occupation time in the one-dimensional nonequilibrium simple symmetric exclusion process, furnishing explicit formulas for the covariances of the limiting Gaussian process. The main novelties consist of a proof of the tightness of the nonequilibrium current based on new correlation estimates, refined estimates on the discrete gradient of the transition probabilities of the SSEP, and a nonequilibrium Kipnis-Varadhan Lemma based on a Fourier approach.

Nonequilibrium Joint Fluctuations for Current and Occupation Time in The Symmetric Exclusion Process

We introduce a simple but powerful technique to study processes driven by two or more reinforcement mechanisms in competition. We apply our method to two types of models: to non conservative zero range processes on finite graphs, and to multi-particle random walks with positive and negative reinforcement on the edges. The results hold for a broad class of reinforcement functions, including those with superlinear growth. Our technique consists in a comparison of the original processes with suitable reference models. To implement the comparison we estimate a Radon-Nikodym derivative on a carefully chosen set of trajectories. Our results describe the almost surely long time behaviour of the processes. We also prove a phase transition depending on the strength of the reinforcement functions.

Stochastic processes with competing reinforcements.

We continue our study of the parabolic Anderson equation $\partial u(x,t)/\partial t = \kappa\Delta u(x,t) + \xi(x,t)u(x,t)$, $x\in\Z^d$, $t\geq 0$, where $\kappa \in [0,\infty)$ is the diffusion constant, $\Delta$ is the discrete Laplacian, and $\xi$ plays the role of a \emph{dynamic random environment} that drives the equation. The initial condition $u(x,0)=u_0(x)$, $x\in\Z^d$, is taken to be non-negative and bounded. The solution of the parabolic Anderson equation describes the evolution of a field of particles performing independent simple random walks with binary branching: particles jump at rate $2d\kappa$, split into two at rate $\xi \vee 0$, and die at rate $(-\xi) \vee 0$. We assume that $\xi$ is stationary and ergodic under translations in space and time, is not constant and satisfies $\E(|\xi(0,0)|) \E(\xi(0,0))$ for $\kappa \in (0,\infty)$.In the present paper we show that $\lim_{\kappa\to\infty} \lambda_0(\kappa) =\E(\xi(0,0))$ under an additional space-time mixing condition on $\xi$. This result shows that the parabolic Anderson model exhibits space-time ergodicity in the limit of large diffusivity. This fact is interesting because there are choices of $\xi$ that fulfill our assumption for which the annealed Lyapunov exponent $\lambda_1(\kappa) = \lim_{t\to\infty} \frac{1}{t}\log \E(u(0,t))$ is infinite on $[0,\infty)$, a situation that is referred to as strongly catalytic behavior.

The parabolic Anderson model in a dynamic random environment: space-time ergodicity for the quenched Lyapunov exponent

In this paper we introduce a new topology under which the pair empirical measure of a large class of random walks satisfies a strong large deviation principle. The definition of the topology is inspired by the recent article by Mukherjee and Varadhan [12]. This topology is natural for many translation-invariant problems such as the Swiss cheese model [14]. We also adapt our result to certain rescaled random walks. Contents

Dirk Erhard

Papers

Local solution to the multi-layer KPZ equation

Nonequilibrium Joint Fluctuations for Current and Occupation Time in The Symmetric Exclusion Process

Stochastic processes with competing reinforcements.

The parabolic Anderson model in a dynamic random environment: space-time ergodicity for the quenched Lyapunov exponent

Strong large deviation principles for pair empirical measures of random walks in the Mukherjee-Varadhan topology