A strong law of large numbers for random biased connected graphs

We consider a class of random connected graphs with random vertices and random edges in which the randomness of the vertices is determined by a continuous probability distribution and the randomness of the edges is determined by a connection function. We derive a strong law of large numbers on the total lengths of all random edges for a random biased connected graph that is a generalization of a directed k-nearest-neighbor graph.     

Product-form characterization for a two-dimensional reflecting random walk

We consider a two-dimensional skip-free reflecting random walk on the non-negative integers, which is referred to as a 2-d reflecting random walk. We give necessary and sufficient conditions for the stationary distribution to have a product-form. We also derive simpler sufficient conditions for the product-form for a restricted class of 2-d reflecting random walks. We apply these results and obtain a product-form approximation of the stationary distribution through a suitable modification of the parameters of the random walk.     

Quenched moderate deviations principle for random walk in random environment

We derive a quenched moderate deviations principle for the one-dimensional nearest random walk in random environment, where the environment is assumed to be stationary and ergodic. The approach is based on hitting time decomposition.     

Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions

We derive a uniform (strong) Law of Large Numbers (LLN) for random set-valued mappings. The result can be viewed as an extension of both, a uniform LLN for random functions and LLN for random sets. We apply the established results to a consistency analysis of stationary points of sample average approximations of nonsmooth stochastic programs.     

Equations for second moments of solutions of a system of linear differential equations with random semi-Markov coefficients and random input

We derive equations that determine second moments of a random solution of a system of Itô linear differential equations with coefficients depending on a finite-valued random semi-Markov process. We obtain necessary and sufficient conditions for the asymptotic stability of solutions in the mean square with the use of moment equations and Lyapunov stochastic functions.

     

Brownian Optimal Stopping and Random Walks

One way to compute the value function of an optimal stopping problem along Brownian paths consists of approximating Brownian motion by a random walk. We derive error estimates for this type of approximation under various assumptions on the distribution of the approximating random walk.     

Brownian Optimal Stopping and Random Walks

One way to compute the value function of an optimal stopping problem along Brownian paths consists of approximating Brownian motion by a random walk. We derive error estimates for this type of approximation under various assumptions on the distribution of the approximating random walk.     

Boundary homogenization in domains with randomly oscillating boundary

We consider a model homogenization problem for the Poisson equation in a domain with a rapidly oscillating boundary which is a small random perturbation of a fixed hypersurface. A Fourier boundary condition with random coefficients is imposed on the oscillating boundary. We derive the effective boundary condition, prove a convergence result, and establish error estimates.     

Simple random walk on the line in random environment

Summary We obtain strong limiting bounds for the maximal excursion and for the maximum reached by a random walk in a random environment. Our results derive from a simple proof of Pólya's theorem for the recurrence of the random walk on the line. As applications, we obtain bounds for the number of visits of the random walk at the origin.     

A law of the iterated logarithm for Markov chains on ℕ0 associated with orthogonal polynomials

We derive laws of the iterated logarithm for Markov chains on the nonnegative integers whose transition probabilities are associated with a sequence of orthogonal polynomials. These laws can be applied to a large class of birth and death random walks and random walks on polynomial hypergroups. In particular, the results of our paper lead immediately to a law of the iterated logarithm for the growth of the distance of isotropic random walks on infinite distance-transitive graphs as well as on certain finitely generated semigroups from their starting points.     

Random walks,totally unimodular matrices,and a randomised dual simplex algorithm

We discuss the application of random walks to generating a random basis of a totally unimodular matrix and to solving a linear program with such a constraint matrix. We also derive polynomial upper bounds on the combinatorial diameter of an associated polyhedron.Supported by NATO grant RG0088/89.Corresponding author. Supported by NSF grants CCR-8900112, CCR-9024935 and NATO grant RG0088/89.     

Stationary distributions of semistochastic processes with disturbances at random times and with random severity

We consider a semistochastic continuous-time continuous-state space random process that undergoes downward disturbances with random severity occurring at random times. Between two consecutive disturbances, the evolution is deterministic, given by an autonomous ordinary differential equation. The times of occurrence of the disturbances are distributed according to a general renewal process. At each disturbance, the process gets multiplied by a continuous random variable (“severity”) supported on [0,1). The inter-disturbance time intervals and the severities are assumed to be independent random variables that also do not depend on the history.We derive an explicit expression for the conditional density connecting two consecutive post-disturbance levels, and an integral equation for the stationary distribution of the post-disturbance levels. We obtain an explicit expression for the stationary distribution of the random process. Several concrete examples are considered to illustrate the methods for solving the integral equations that occur.     

Metastability of Nonreversible Random Walks in a Potential Field and the Eyring‐Kramers Transition Rate Formula

We consider nonreversible random walks in a bounded domain of ℝ^d evolving on a potential field. We describe the complete metastable behavior of the random walk among the landscape of valleys, and we derive the Eyring‐Kramers formula for the mean transition time from a metastable set to a stable set.© 2017 Wiley Periodicals, Inc.     

IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation

We present a new method for solving stochastic programs with joint chance constraints with random technology matrices and discretely distributed random data. The problem can be reformulated as a large-scale mixed 0–1 integer program. We derive a new class of optimality cuts called IIS cuts and apply them to our problem. The cuts are based on irreducibly infeasible subsystems (IIS) of an LP defined by requiring that all scenarios be satisfied. We propose a method for improving the upper bound of the problem when no cut can be found. We derive and implement a branch-and-cut algorithm based on IIS cuts, and refer to this algorithm as the IIS branch-and-cut algorithm. We report on computational results with several test instances from optimal vaccine allocation. The computational results are promising as the IIS branch-and-cut algorithm gives better results than a state-of-the-art commercial solver on one class of problems.     

Comparison and bounds for functionals of future lifetimes consistent with life tables

We derive a new crossing criterion of hazard rates to identify a stochastic order relation between two random variables. We apply this crossing criterion in the context of life tables to derive stochastic ordering results among three families of fractional age assumptions: the family of linear force of mortality functions, the family of quadratic survival functions and the power family. Further, this criterion is used to derive tight bounds for functionals of future lifetimes that exhibit an increasing force of mortality with given one-year survival probabilities. Numerical examples illustrate our findings.     

负相协D族广义Sparre-Andevsen模型下的大偏差及其应用

本文将经典的Sparre-Andevsen风险模型推广到保费收入过程不再是线性过程的一般风险过程,得到了一些关于负相协D族随机变量随机和的大偏差结果,以及破产概率的弱等价性.     

On symmetric random walks with random conductances on ℤ d

We study models of continuous time, symmetric, ℤ^d-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We consider the case of independent conductances with a polynomial tail near 0 and obtain precise asymptotics for the annealed return probability and convergence times for the random walk confined to a finite box.     

Average under the Iwasawa transformation

We derive an averaging property under the Iwasawa decomposition on a semisimple Lie group of noncompact type based on a limiting property of random walks in the Lie group.

     

On the distribution of the first exit time and overshoot in a two-sided boundary crossing problem

We consider a random walk generated by a sequence of independent identically distributed random variables. We assume that the distribution function of a jump of the random walk equals an exponential polynomial on the negative half-axis. For double transforms of the joint distribution of the first exit time from an interval and overshoot, we obtain explicit expressions depending on finitely many parameters that, in turn, we can derive from the system of linear equations. The principal difference of the present article from similar results in this direction is the rejection of using factorization components and projection operators connected with them.     

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one‐dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008