Lattice path combinatorics for multiple product identities

Lattice paths are enumerated as walks on a lattice under the Delannoy criterion of vertical, horizontal and upward diagonal steps. Delannoy recursions are generalized for arbitrary weights in each of these directions, where the row elements of the Delannoy triangles correspond to lattice paths for all walks at a given length.     

Lattice path counting and the theory of queues

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like M^a/M^b/1$M^a/M^b/1$ systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto–Hahn model or systems with preemptive priorities.     

István Vincze (1912–1999) and his contribution to lattice path combinatorics and statistics

A brief account of the life and work of István Vincze, a prominent Hungarian statistician, is given. His contributions in various topics are discussed. They include empirical distribution, Kolmogorov–Smirnov statistics, information theory, Cramér–Fréchet–Rao inequality, estimation of density, and a characterization problem.     

The combinatorics of binary arrays

This paper gives an account of the combinatorics of binary arrays, mainly concerning their randomness properties. In many cases the problem reduces to the investigation on difference sets.     

The interplay of optimality and combinatorics in experimental design

The design of statistical experiments, as developed by R. A. Fisher and his followers, often used combinatorial structures that yielded simple calculation of estimates and/or symmetric variances and covariances. Examples are block designs with balance, regression experiments with equally spaced observations, etc. More recently, considerations of optimality (choosing a design that achieves most accurate inference in some sense) have sometimes justified the traditional designs, but have sometimes led to new combinatorial investigations. Illustrations are given.     

Lattice paths combinatorics applied to transient queue length distribution of C2/M/1 queues and busy period analysis of bulk queues C2/M/1

This paper aims at deriving explicit transient queue length distribution for GI/M/1 system and busy period analysis of bulk queue GI^b/M/1 through lattice paths (LPs) combinatorics. The general interarrival time distribution is approximated by two-phase Cox distribution, C₂, that has Markovian property, enabling us to represent the processes by two-dimensional LPs. As distributions C₂ cover a wide class of distributions that have rational Laplace–Stieltjes transforms (LSTs) with square coefficient of variation lying in , the results obtained are applicable to a large class of real life situations. Some numerical results for the C₂^b/M/1 model are also given.     

Projectors and linear estimation in general linear models

The paper gives a self-contained account of minimum disper­sion linear unbiased estimation of the expectation vector in a linear model with the dispersion matrix belonging to some, rather arbitrary, set of nonnegative definite matrices. The approach to linear estimation in general linear models recommended here is a direct generalization of some ideas and results presented by Rao (1973, 19 74) for the case of a general Gauss-Markov model

A new insight into the nature of some estimation problems originaly arising in the context of a general Gauss-Markov model as well as the correspondence of results known in the literature to those obtained in the present paper for general linear models are also given. As preliminary results the theory of projectors defined by Rao (1973) is extended.     

Ballot theorem and lattice path crossings

We consider lattice paths which cross the diagonal exactly r times, and by a simple method determine the number of such paths when the endpoint is given. Then as a byproduct we easily obtain Feller's (1968, p.84) result for crossings when the length is given.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.     

On f-tests and linear hypothesis in a general linear model

A simple method of setting linear hypotheses testable by F-tests in a general linear model when the covariance matrix has a general form and is completely unknown, is provided. With some additional conditions imposed on the covariance matrix, there exist the UMP invariant tests of certain linear hypotheses. We derive them to compare the powers with those of F-tests obtained under no restrictions on the covariance matrix. The results are illustrated in a multiple regression model with some examples.     

Admissibility and linear sufficiency in linear model with nuisance parameters

In this paper, we derive characterization of admissible and linearly sufficient estimators of a vector of linear estimable functions of parameters in a partitioned linear model. Then, we compare this class of estimators with the class of admissible and linearly sufficient estimators of the same vector of linear parametric functions in a reduced linear model. We show that these classes are equal with probability one.     

Calibrated path sampling and stepwise bridge sampling

A computational problem in many fields is to evaluate multiple integrals and expectations simultaneously. Consider probability distributions with unnormalized density functions indexed by parameters on a 2-dimensional grid, and assume that samples are simulated from distributions on a subgrid. Examples of such unnormalized density functions include the observed-data likelihoods in the presence of missing data and the prior times the likelihood in Bayesian inference. There are various methods using a single sample only or multiple samples jointly to compute each integral. Path sampling seems a compromise, using samples along a 1-dimensional path to compute each integral. However, different choices of the path lead to different estimators, which should ideally be identical. We propose calibrated estimators by the method of control variates to exploit such constraints for variance reduction. We also propose biquadratic interpolation to approximate integrals with parameters outside the subgrid, consistently with the calibrated estimators on the subgrid. These methods can be extended to compute differences of expectations through an auxiliary identity for path sampling. Furthermore, we develop stepwise bridge-sampling methods in parallel but complementary to path sampling. In three simulation studies, the proposed methods lead to substantially reduced mean squared errors compared with existing methods.     

Optimal allocation for linear combinations of linear predictors in generalized linear models

The problem of the allocation of experimental units to experimental groups is studied within the context of generalized linear models. Optimal designs for the estimation of linear combinations of linear predictors are characterized, using concepts from the theory of optimal design. If there is only one linear combination of interest, then the D-optimal allocation is equivalent to the well-known Neyman allocation of subsamples in stratified sampling. However, if the number of linear combinations equals the number of design points, or experimental groups, then the equal replication of all design points is D-optimal. For cases in between, there are no easily accessible general solutions to the problem, although some particular cases are solved, including: i estimation of the n- 1 possible comparisons with a control group in an n-point, one-factor design; and ii estimation of 2 one or two of the four natural parameters of a 2 factorial design. The A-optimal allocations are determined in general.     

Admissible linear estimation in singular linear models

The admissibility results of Rao (1976), proved in the context of a nonsingular covariance matrix, are exteneded to the situation where the covariance matrix is singular. Admi.s s Lb Le linear estimators in the Gauss-Markoff model are characterized and admis-sibility of the best linear unbiased estimator is investigated.     

A generating algorithm for linear trend-free and nearly linear trend-free block designs

The theory and properties of trend-free (TF) and nearly trend-free (NTF) block designs are wel1 developed. Applications have been hampered because a methodology for design construction has not been available.

This article begins with a short review of concepts and properties of TF and NTF block designs. The major contribution is provision of an algorithm for the construction of linear and nearly linear TF block designs. The algorithm is incorporated in a computer program in FORTRAN 77 provided in an appendix for the IBM PC or compatible microcomputer, a program adaptable also to other computers. Three sets of block designs generated by the program are given as examples.

A numerical example of analysis of a linear trend-free balanced incomplete block design is provided.     

Reversible jump methods for generalised linear models and generalised linear mixed models

A reversible jump algorithm for Bayesian model determination among generalised linear models, under relatively diffuse prior distributions for the model parameters, is proposed. Orthogonal projections of the current linear predictor are used so that knowledge from the current model parameters is used to make effective proposals. This idea is generalised to moves of a reversible jump algorithm for model determination among generalised linear mixed models. Therefore, this algorithm exploits the full flexibility available in the reversible jump method. The algorithm is demonstrated via two examples and compared to existing methods.