Abstract We consider a decision maker with randomly evolving tastes who faces dynamic situations that involve intertemporal tradeoffs, such as those in consumption savings problems. axiomatize recursive representation of choice features uncertain utilities, which evolve according to subjective Markov process. The parameters the representation, are process governing evolution and discount factor...

We study the problem of finding pairwise vertex-disjoint copies ?-vertex cycle C? in randomly perturbed graph model, which is union a deterministic n-vertex G and binomial random G(n, p). For ? ? 3 we prove that asymptotically almost surely U p) contains min{?(G), [n/l]} cycles C?, provided p C log n/n for sufficiently large. Moreover, when ?(G) ?n with 0 ? ?/l not ‘close’ to complete bipartite...

An intersecting hypergraph is one in which each pair of edges has a nonempty intersection. Here, we consider r-uniform hypergraphs which are those for which all edges contain r vertices. ∗Supported in part by NSF grant DMS-0100400. †Supported in part by NSF grant CCR-9818411. ‡Supported in part by NSF VIGRE grant DMS-9819950. §Research was partially supported by OTKA Grants T 030059, T 029074, ...

We present a computational study of the transport properties of campylotic (intrinsically curved) media. It is found that the relation between the flow through a campylotic media, consisting of randomly located curvature perturbations, and the average Ricci scalar of the system, exhibits two distinct functional expressions, depending on whether the typical spatial extent of the curvature pertur...