Algorithmic Methods in Queues and in the Exploration of Point Processes

This is a review of methodology for the algorithmic study of some useful models in point process and queueing theory, as discussed in three lectures at the Summer Institute at Sozopol, Bulgaria. We provide references to sources where the extensive details of this work are found. For future investigation, some open problems and new methodological approaches are proposed.

Large Deviations and Branching Processes

These lecture notes are devoted to present several uses of Large Deviation asymptotics in Branching Processes.

Scaling and Multiscaling Exponents in Networks and Flows

The main focus of this paper is on mathematical theory and methods which have a direct bearing on problems involving multiscale phenomena. Modern technology is refining measurement and data collection to spatio-temporal scales on which observed geophysical phenomena are displayed as intrinsically highly variable and intermittant heirarchical structures,e.g. rainfall, turbulence, etc. The heirarchical structure is reflected in the occurence of a natural separation of scales which collectively manifest at some basic unit scale. Thus proper data analysis and inference require a mathematical framework which couples the variability over multiple decades of scale in which basic theoretical benchmarks can be identified and calculated. This continues the main theme of the research in this area of applied probability over the past twenty years.

Monte Carlo Algorithms for Linear Problems

MSC Subject Classification: 65C05, 65U05.

Asymptotic Behaviour of a Supercritical Galton-Watson Process with Controlled Binomial Migration

AMS subject classification: 60J80, 62F12, 62P10.

Making Multiple Decisions Adaptively

The asymptotic behavior of multiple decision procedures is studied when the underlying distributions depend on an unknown nuisance parameter. An adaptive procedure must be asymptotically optimal for each value of this nuisance parameter, and it should not depend on its value. A necessary and sufficient condition for the existence of such a procedure is derived. Several examples are investigated in detail, and possible lack of adaptation of the traditional overall maximum likelihood rule is discussed.

Monte Carlo Algorithm for Solving Integral Equations with Polynomial Non-Linearity. Parallel Implementation

An iterative Monte Carlo algorithm for evaluating linear functionals of the solution of integral equations with polynomial non-linearity is proposed and studied. The method uses a simulation of branching stochastic processes. It is proved that the mathematical expectation of the introduced random variable is equal to a linear functional of the solution. The algorithm uses the so-called almost optimal density function. Numerical examples are considered. Parallel implementation of the algorithm is also realized using the package ATHAPASCAN as an environment for parallel realization.The computational results demonstrate high parallel efficiency of the presented algorithm and give a good solution when almost optimal density function is used as a transition density.

Statistical Numerical Methods for Eigenvalue Problem. Parallel Implementation

MSC subject classification: 65C05, 65U05.

A Characterization of the Negative Binomial Distribution

Only a few characterizations have been obtained in literatute for the negative binomial distribution (see Johnson et al., Chap. 5, 1992). In this article a characterization of the negative binomial distribution related to random sums is obtained which is motivated by the geometric distribution characterization given by Khalil et al. (1991). An interpretation in terms of an unreliable system is given.

On some Sufficient Conditions for High Breakdown Point of ML Estimators

High breakdown point estimators LME(k) and LT E(k) for location and scale are obtained for symmetrical exponentially decreasing density family.

The Maximal Number of Particles in a Branching Process with State-Dependent Immigration

AMS subject classification: 60J80, 60J15.

Large Distinct Part Sizes in a Random Integer Partition

A partition of a positive integer n is a way of writing it as the sum of positive integers without regard to order; the summands are called parts. The number of partitions of n, usually denoted by p(n), is determined asymptotically by the famous partition formula of Hardy and Ramanujan [5]. We shall introduce the uniform probability measure P on the set of all partitions of n assuming that the probability 1/p(n) is assigned to each n-partition. The symbols E and V ar will be further used to denote the expectation and variance with respect to the measure P . Thus, each conceivable numerical characteristic of the parts in a partition can be regarded as a random variable.

A System for Simulation and Estimation of Branching Processes

A computer code system for simulation and estimation of branching processes is proposed. Using the system, samples for some models with or without migration are generated. Over these samples we compare some properties of various estimators.

On Self-Similar Extremal Processes

We study the limit behaviour of the sequence of extremal processes under a regularity condition on the norming sequence ζn and asymptotic negligibility of the max-increments of Yn.

Evaluating the Risk in Selection Problems

The procedure used should guarantee that the risk of decision asserted from the observations is at most some specified value P*.