Metabuscador

Filtrado por:

Tema:"60J10"

Temas

Idiomas

Recursos

Más...

Año

2013 (3)
2012 (1)
2011 (3)
2009 (1)
2007 (1)
2003 (1)
Más...

Aproximadamente 11 registro(s) hasta el momento: (journal)

Mostrar 10 | 50 | 100 resultados por página

Recurso libre

Loop-Erased Random Walks, Spanning Trees and Hamiltonian Cycles
Marchal, Philippe; Université Paris 6

Formato:	Peer-reviewed Article,
Enlaces:	We establish a formula for the distribution of loop-erased random walks at certain random times. Several classical results on spanning trees, including Wilson's algorithm, follow easily, as well as a method to construct random Hamiltonian cycles.
Fecha:	2000-01-01
Recurso:	Electronic communications in probability

Recurso libre

Excited Random Walk
Benjamini, Itai; Weizmann Institute, Rehovot 76100, Israel - Wilson, David Bruce; Microsoft Research

Formato:	Peer-reviewed Article,
Enlaces:	A random walk on $\mathbb{Z}^d$ is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We show that…
Fecha:	2003-01-01
Recurso:	Electronic communications in probability

Recurso libre

Sharp edge, vertex, and mixed Cheeger type inequalities for finite Markov kernels
Montenegro, Ravi; University of Massachusetts Lowell

Formato:	Peer-reviewed Article,
Enlaces:	We show how the evolving set methodology of Morris and Peres can be used to show Cheeger inequalities for bounding the spectral gap of a finite Markov kernel. This leads to sharp versions of several previous Cheeger inequalities, including ones…
Fecha:	2007-01-01
Recurso:	Electronic communications in probability

Recurso libre

Avoidance Coupling
Angel, Omer; University of British Columbia - Holroyd, Alexander E; Microsoft Research - Martin, James; University of Oxford - Winkler, Peter; Dartmouth College - Wilson, David B; Microsoft Research

Formato:	Peer-reviewed Article
Enlaces:	We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is…
Fecha:	2013-01-03
Recurso:	Electronic communications in probability

Recurso libre

Sensitivity of mixing times
Ding, Jian; University of Chicago - Peres, Yuval; Microsoft Research

Formato:	Peer-reviewed Article
Enlaces:	In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by…
Fecha:	2013-01-03
Recurso:	Electronic communications in probability

Recurso libre

Merging for time inhomogeneous finite Markov chains, Part I: Singular values and stability
Saloff-Coste, Laurent; Cornell University - Zuniga, Jessica V; Stanford University

Formato:	Peer-reviewed Article,
Enlaces:	We develop singular value techniques in the context of time inhomogeneous finite Markov chains with the goal of obtaining quantitative results concerning the asymptotic behavior of such chains. We introduce the notion of c-stability which can be viewed as a…
Fecha:	2009-01-01
Recurso:	Electronic journal of probability

Recurso libre

Three Kinds of Geometric Convergence for Markov Chains and the Spectral Gap Property
Stadje, Wolfgang; University of Osnabrück - Wübker, Achim; University of Osnabrück

Formato:	Peer-reviewed Article,
Enlaces:	In this paper we investigate three types of convergence for geometrically ergodic Markov chains (MCs) with countable state space, which in general lead to different `rates of convergence'. For reversible Markov chains it is shown that these rates coincide. For…
Fecha:	2011-01-01
Recurso:	Electronic journal of probability

Recurso libre

Mixing and hitting times for finite Markov chains
Oliveira, Roberto Imbuzeiro; IMPA

Formato:	Peer-reviewed Article
Enlaces:	Let $0<\alpha<1/2$. We show that that the mixing time of a continuous-time Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of the state space with stationary measure $\geq…
Fecha:	2012-01-01
Recurso:	Electronic journal of probability

Recurso libre

A lower bound for the mixing time of the random-to-random Insertions shuffle
Subag, Eliran; Technion - Israel Institute of Technology

Formato:	Peer-reviewed Article
Enlaces:	The best known lower and upper bounds on the mixing time for the random to-random insertions shuffle are $(1/2-o(1))n\log n$ and $(2+o(1))n\log n$. A long standing open problem is to prove that the mixing time exhibits a cutoff. In particular,…
Fecha:	2013-01-04
Recurso:	Electronic journal of probability

Recurso libre

10.

Moments of recurrence times for Markov chains
Aurzada, Frank; TU Berlin - Döring, Hanna; TU Berlin - Ortgiese, Marcel; TU Berlin - Scheutzow, Michael; TU Berlin

Formato:	Peer-reviewed Article,
Enlaces:	We consider moments of the return times (or first hitting times) in an irreducible discrete time discrete space Markov chain. It is classical that the finiteness of the first moment of a return time of one state implies the finiteness…
Fecha:	2011-01-01
Recurso:	Electronic communications in probability