AbstractA threshold result regarding the lengths of nonreversing walks on random digraphs is obtained as a consequence of a bifurcation in the dynamics of a simple one-dimensional iteration
We study the behavior of the random walk in a continuum independent long-range percolation model, in...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with ...
AbstractA threshold result regarding the lengths of nonreversing walks on random digraphs is obtaine...
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its in...
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its in...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
In this note we solve the ``birthday problem'' for loops on random regular graphs. Namely, for fixed...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
AbstractFor random walk on the d-dimensional integer lattice we consider again the problem of decidi...
We study the random walk X on the range of a simple random walk on ℤ d in dimensions d≥4. When d≥...
Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded ve...
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena whe...
AbstractGiven a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform p...
We study the behavior of the random walk in a continuum independent long-range percolation model, in...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with ...
AbstractA threshold result regarding the lengths of nonreversing walks on random digraphs is obtaine...
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its in...
A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its in...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
In this note we solve the ``birthday problem'' for loops on random regular graphs. Namely, for fixed...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
International audienceA finite ergodic Markov chain exhibits cutoff if its distance to equilibrium r...
AbstractFor random walk on the d-dimensional integer lattice we consider again the problem of decidi...
We study the random walk X on the range of a simple random walk on ℤ d in dimensions d≥4. When d≥...
Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded ve...
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena whe...
AbstractGiven a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform p...
We study the behavior of the random walk in a continuum independent long-range percolation model, in...
AbstractWe consider random walks with transition probabilities depending on the number of consecutiv...
Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with ...
DOI
Add to ORKG