We present new families of lower bounds for the price of the American put option on a dividend paying stock when the stock follows a log normal process and the option can be exercised continuously to a finite horizon . By put call parity, these bounds can be easily converted to bounds on the price of the Ameican call option on a dividend paying stock. By numerically optimizing these bounds, we ...

Given a simple connected undirected graph G = (V , E), the Wiener index W (G) of G is defined as half the sum of the distances d(u, v) between all pairs of vertices u, v of G, where d(u, v) denotes the distance (the number of edges on a shortest path between u and v) between u, v in G. We obtain an expression for W (G), where G is a binomial tree. For Fibonacci trees and binary Fibonacci trees ...

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.

Background: Previous literatures have indicated that log-binomial regression model is an alternative for the logistic frequent occurrence of event outcome. The comparison performance these two models has been found with reference to clinical/epidemiological data. Nonetheless, application and its poverty data not described. 
 Objective: To compare in terms variable selection, effect size, p...

abstract background: the increase in breast cancer incidence has enhanced attention towards breast cancer risk. the aim of this study was to determine the risk of breast cancer and risk perception of women, factors that affect risk perception, and to determine differences between absolute risk and the perception of risk. methods: this cross-sectional study was carried out among 346 women whose ...

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...

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 ...