getdoc7850. 140KB Jun 04 2011 12:04:32 AM
Teks penuh
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
Given a martingale sequence (fn) (possibly vector valued), there is a martingale (gn) on the probability space [0, 1] N , with respect to the filtration L n, the minimal sigma field
In [2] Aldous considers a tree constructed within the standard Brownian excursion, and shows that after conditioning on the occupation measure of the excursion, the law of the tree
At each stage of the process, the following happens: • We compute a proposed minimum ( r + 1)-matching under the assumption that for all exposed vertices, their minimum cost edges to
Returning to the setting of finite Markov chains, it was mentioned above that the random transposition random walk on the symmetric group S n was the first example for which a
Applying known results on weak convergence of random tree walks to Brownian excursion, we give a conceptually simpler rederivation of the Aldous-Pitman (1994) result on convergence
We study the entropy of the distribution of the set R n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps.. It is shown that this
Give the description of all irreducible configurations (associated with a fixed graph Γ and an arrangement of numbers on its edges) up to a unitary transformation.... We enumerate
