Random walk on sparse random digraphs (Q2413249)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Random walk on sparse random digraphs	scientific article

Statements

scholarly article

0 references

Random walk on sparse random digraphs (English)

0 references

zbMATH Open document ID

0 references

10.1007/s00440-017-0796-7

0 references

Charles Bordenave

0 references

0 references

0 references

Probability Theory and Related Fields

0 references

publication date

10 April 2018

0 references

full work available at URL

https://arxiv.org/abs/1508.06600

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

cutoff phenomenon

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Diameter and stationary distribution of random \(r\)-out digraphs

0 references

0 references

Shuffling Cards and Stopping Times

0 references

Moments, continuity, and multifractal analysis of Mandelbrot martingales

0 references

Mandelbrot Cascades and Related Topics

0 references

Cutoff for nonbacktracking random walks on sparse random graphs

0 references

The mixing time of the giant component of a random graph

0 references

Random walks on the random graph

0 references

Stein's method for concentration inequalities

0 references

The cutoff phenomenon for ergodic Markov processes

0 references

Generalized PageRank on directed configuration networks

0 references

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence

0 references

The Cover Time of Random Regular Graphs

0 references

The cover time of sparse random graphs

0 references

The cover time of the preferential attachment graph

0 references

The cover time of the giant component of a random graph

0 references

Stationary distribution and cover time of random walks on random digraphs

0 references

Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk

0 references

The cutoff phenomenon in finite Markov chains.

0 references

Asymptotic analysis of a random walk on a hypercube with many dimensions

0 references

Generating a random permutation with random transpositions

0 references

Mixing time of near-critical random graphs

0 references

The evolution of the mixing rate of a simple random walk on the giant component of a random graph

0 references

On tail probabilities for martingales

0 references

The cutoff profile for the simple exclusion process on the circle

0 references

0 references

0 references

Sur Une Équation Fonctionnelle Et SES Applications: Une Extension Du Théorème De Kesten-Stigum Concernant Des Processus De Branchement

0 references

On generalized multiplicative cascades

0 references

Asymptotic properties and absolute continuity of laws stable by random weighted mean.

0 references

Cutoff on all Ramanujan graphs

0 references

Cutoff phenomena for random walks on random regular graphs

0 references

0 references

Critical random graphs: Diameter and mixing time

0 references

A fixed point theorem for distributions

0 references

0 references

Optimal Transport

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2413249

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2413249&oldid=36383183"