getdoc7582. 461KB Jun 04 2011 12:04:31 AM
Teks penuh
Gambar
Garis besar
Dokumen terkait
In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask for the minimum total cost of a set of edges of which each vertex is incident to
It is known from the multiplicative ergodic theorem that the norm of the derivative of certain stochastic flows at a previously fixed point grows exponentially fast in time as the
Metric entropy of the class of probability distribution functions on [0, 1] with a k-monotone density is studied through its connection with the small ball probability of
The main purpose of this paper is to generalize the above-mentioned result by Br´ ezin and Hikami [BH2] about the second-order correlation function of the characteristic polynomial
In Section 6 we discuss the one dimensional biased case and show that, when the initial distribution of height differences is an independent positive increment process
coordinate systems this problem is reduced to the ǫ-covering time of the two-dimensional (flat) torus by a (standard) Brownian motion. In this paper we deal with manifolds of
(We remind the reader that a set is called totally disconnected if it contains no connected component larger than one point.) The fractals we study are defined as the complement of
In the next section we transform FB- SDE (1.4) to a stochastic control problem and propose the steepest descent method; in § 3 we discretize the decoupled FBSDEs introduced in § 2;
