No abstract uploaded!

No abstract uploaded!

A simplicial complex Δ is called$flag$if all minimal nonfaces of Δ have at most two elements. The following are proved: First, if Δ is a flag simplicial pseudomanifold of dimension$d$−1, then the graph of Δ (i) is (2$d$−2)-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the$d$-dimensional cross-polytope. Second, the$h$-vector of a flag simplicial homology sphere Δ of dimension$d$−1 is minimized when Δ is the boundary complex of the$d$-dimensional cross-polytope.

Consider an age-dependent, single-species branching process defined by a progeny number distribution, and a lifetime distribution associated with each independent particle. In this paper, we focus on the associated inverse problem where one wishes to formally solve for the progeny number distribution or the lifetime distribution that defines the Bellman-Harris branching process. We derive results for the existence and uniqueness (the identifiability) of these two distributions given one of two types of information: the extinction time probability of the entire process (extinction time distribution), or the distribution of the total number of particles at one fixed time. We demonstrate that perfect knowledge of the distribution of extinction times allows us to formally determine either the progeny number distribution or the lifetime distribution. Furthermore, we show that these constructions are unique. We then consider “data” consisting of a perfectly known total number distribution given at one specific time. For a process with known progeny number distribution and exponentially distributed lifetimes, we show that the rate parameter is identifiable. For general lifetime distributions, we also show that the progeny distribution is globally unique. Our results are presented through four theorems, each describing the constructions in the four distinct cases.

No abstract uploaded!