On minimising the maximum expected verification time

On minimising the maximum expected verification time

Bounds on the Expected Size of the Maximum Agreement Subtree

We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem.

On the Expected Maximum Degree of Gabriel and Yao Graphs

Motivated by applications of Gabriel graphs andYao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on n points drawn uniformly at random from a unit square grows as (log n/ log log n) in probability.

Useful Bounds on the Expected Maximum of Correlated Normal Variables

We compute useful upper and lower bounds on the expected maximum of up to a few hundred correlated Normal variables with arbitrary means and variances. Two types of bounding processes are used: perfectly dependent Normal variables, and independent Normal variables, both with arbitrary mean values. The expected maximum for the perfectly dependent variables can be evaluated in closed form; for th...

On Optimal Investment in the Long Run: Rank Dependent Expected Utility as a “Bridge” between the Maximum-Expected-Log and Maximum- Expected-Utility Criteria

This paper concerns the well known paradox of inconsistency of the maximum-expected-utility (MEU) and the maximum-expected-log (MEL) criteria in investment dynamic models. The goal of the paper is to consider this phenomenon at the level of premises, and to suggest a generalized criterion, namely the rank dependent expected utility (RDEU) approach which allows to “bridge the gap” between the ME...