We amend some results in the literature. We verify a formula for the integrity of the binomial tree, and correct formulas for the integrity of the complete k-ary tree. Dedicated to Henda Swart with the greatest thanks.

The paper shows that variables commonly used in takeover prediction models also help to explain the likelihood of several other restructuring events, including divestitures, bankruptcies and significant employee layoffs. This finding helps to explain the larger misclassification errors in binomial takeover prediction models commonly used in prior research. The results show that modelling takeov...

Modeling a nonlinear pay o¤ generating instrument is a challenging work. The models that are commonly used for pricing derivative might divided into two main classes; analytical and iterative models. This paper compares the Black-Scholes and binomial tree models.

We study a discrete time approximation scheme for the solution of a doubly reflected Backward Stochastic Differential Equation (DBBSDE in short) with jumps, driven by a Brownian motion and an independent compensated Poisson process. Moreover, we suppose that the obstacles are right continuous and left limited (RCLL) processes with predictable and totally inaccessible jumps and satisfy Mokobodzk...

The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)− |S| : S ⊆ V(G) and c(G−S)≠ 1} where c(G−S) denotes the number of components in G− S. It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly, some bounds on the scattering number are given. Further, scattering number of a binomial tree i...

This note contains two main results. (1) (Discrete time) Suppose S is a martingale whose marginal laws agree with a geometric simple random walk. (In financial terms, let S be a risk-neutral asset price and suppose the initial option prices agree with the Cox–Ross–Rubinstein binomial tree model.) Then S is a geometric simple random walk. (2) (Continuous time) Suppose S = S0eσX−σ 〈X〉/2 is a cont...

A wide range of graphs with regular structures are shown to be embeddable in an injured hypercube with faulty links. These include rings, linear paths, binomial trees, binary trees, meshes, tori, and many others. Unlike many existing algorithms which are capable of embedding only one type of graphs, our algorithm embeds the above graphs in a uniied way, all centered around a notion called edge ...

The binomial tree method, first proposed by Cox, Ross, and Rubinstein [Journal of Financial Economics, 7 (1979), pp. 229–263], is one of the most popular approaches to pricing options. By introducing an additional path-dependent variable, such methods can be readily extended to the valuation of path-dependent options. In this paper, using numerical analysis and the notion of viscosity solutions...