Reversible random walks on dynamic graphs (Q6063351)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7762026

Language	Label	Description	Also known as
English	Reversible random walks on dynamic graphs	scientific article; zbMATH DE number 7762026

Statements

scholarly article

0 references

Reversible random walks on dynamic graphs (English)

0 references

Nobutaka Shimizu

0 references

Takeharu Shiraga

0 references

Random Structures & Algorithms

0 references

publication date

7 November 2023

0 references

full work available at URL

https://arxiv.org/abs/2102.08002

0 references

zbMATH Keywords

dynamic graph

0 references

Markov chain

0 references

random walk

0 references

MaRDI profile type

MaRDI publication profile

0 references

Speeding Up Cover Time of Sparse Graphs Using Local Knowledge

0 references

Cover time and mixing time of random walks on dynamic graphs

0 references

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

0 references

Parsimonious flooding in dynamic graphs

0 references

Bounds on the Voter Model in Dynamic Networks

0 references

Maximum hitting time for random walks on graphs

0 references

Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity

0 references

Random Walks on Randomly Evolving Graphs

0 references

Flooding Time of Edge-Markovian Evolving Graphs

0 references

Rumor spreading in random evolving graphs

0 references

Crawling on Simple Models of Web Graphs

0 references

The Linear Voting Model

0 references

Coalescing Random Walks and Voting on Connected Graphs

0 references

Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time

0 references

Theory of Evolutionary Computation

0 references

How Well Do Random Walks Parallelize?

0 references

Tight bounds for the cover time of multiple random walks

0 references

A tight upper bound on the cover time for random walks on graphs

0 references

Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process

0 references

Uniform coupling of non-homogeneous Markov chains

0 references

Distributed probabilistic polling and applications to proportionate agreement

0 references

0 references

The hitting and cover times of random walks on finite graphs using local degree information

0 references

On the cover time of random walks on graphs

0 references

On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract

0 references

Cover time in edge-uniform stochastically-evolving graphs

0 references

0 references

Covering problems for Markov chains

0 references

The hitting and cover times of Metropolis walks

0 references

On the coalescence time of reversible random walks

0 references

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

0 references

Convergence of some time inhomogeneous Markov chains via spectral techniques

0 references

Merging for time inhomogeneous finite Markov chains. I: Singular values and stability

0 references

Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1002/RSA.21164

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6063351

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