scientific article; zbMATH DE number 878897
From MaRDI portal
Publication:4878667
Recommendations
Cited in
(only showing first 100 items - show all)- On resistance-distance and Kirchhoff index
- The electrical resistance of a graph captures its commute and cover times
- Eigenvalue location in graphs of small clique-width
- A Perron-Frobenius type of theorem for quantum operations
- Random walks and diffusion on networks
- An expressive dissimilarity measure for relational clustering using neighbourhood trees
- Offline reinforcement learning with task hierarchies
- One-dimensional quantum walks with absorbing boundaries
- New bounds for randomized busing
- Random walks between leaves of random networks
- The rapid mixing of random walks defined by an \(n\)-cube
- Biased random walks
- Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs
- Commute times of random walks on trees
- Scaling in small-world resistor networks
- Connecting polygonizations via stretches and twangs
- Formal rational fractions and random walks on cycles
- Approximate \(\ell_0\)-penalized estimation of piecewise-constant signals on graphs
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs
- Edge-disjoint spanning trees and forests of graphs
- The hitting times of random walks on bicyclic graphs
- Network navigation with non-Lèvy superdiffusive random walks
- A comparative analysis of knowledge acquisition performance in complex networks
- Stochastic strategies for patrolling a terrain with a synchronized multi-robot system
- The access time of random walks on trees with given partition
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains
- Random walks on graphs and Monte Carlo methods
- On the cover time of -biased walk on supercritical Galton-Watson trees
- On graph parameters guaranteeing fast sandpile diffusion
- Graph characteristics from the heat kernel trace
- The Kusuoka measure and the energy Laplacian on level-\(k\) Sierpiński gaskets
- Estimating graph parameters with random walks
- Mixing time bounds for graphlet random walks
- Probing the geometry of data with diffusion Fréchet functions
- A polynomial time approximation scheme for computing the supremum of Gaussian processes
- Viral processes by random walks on random regular graphs
- A note on the PageRank of undirected graphs
- Random walks on complete multipartite graphs
- Graph simplification and matching using commute times
- On the cover time and mixing time of random geometric graphs
- Fault-tolerant aggregation: flow-updating meets mass-distribution
- Random walk on sparse random digraphs
- Quantum walks for the determination of commutativity of finite dimensional algebras
- Tiling by rectangles and alternating current
- On the diameter of permutation groups.
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
- Finding hitting times in various graphs
- Quantum walk and its application domains: a systematic review
- Asymptotics of the number of end positions of a random walk on a directed Hamiltonian metric graph
- Reconstruction of the final distribution of probabilities for random walks on a graph
- Random walks on graphs with interval weights and precise marginals
- Analysis of random walks using tabu lists
- Fast low-cost estimation of network properties using random walks
- ADM-CLE approach for detecting slow variables in continuous time Markov chains and dynamic data
- Propagation kernels: efficient graph kernels from propagated information
- Uniform sampling of digraphs with a fixed degree sequence
- Designing good random walks on finite graphs
- Collisions Among Random Walks on a Graph
- Random walks on weighted graphs and applications to on-line algorithms
- scientific article; zbMATH DE number 2128181 (Why is no real title available?)
- Tight inequalities among set hitting times in Markov chains
- Random flights on regular graphs
- The random walk on directed Kautz graphs
- Combinatorial Random Walks on 3-Manifolds
- Random walks relative to multiple transition matrices
- A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
- The Quantum Complexity of Markov Chain Monte Carlo
- Random walks on periodic graphs
- Exact mixing times for random walks on trees
- Sandwich theorem of cover times
- Exponential Random Graphs as Models of Overlay Networks
- Periodic dynamic graphs. Random walks problem and the shortest path
- Approach to equilibrium for random walks on graphs and for stochastic infinite particle processes
- scientific article; zbMATH DE number 4007384 (Why is no real title available?)
- The cover times of random walks on random uniform hypergraphs
- Spanders: distributed spanning expanders
- Bounds on the diameter of Cayley graphs of the symmetric group
- scientific article; zbMATH DE number 176640 (Why is no real title available?)
- On the mixing time of geographical threshold graphs
- A Chernoff Bound for Random Walks on Expander Graphs
- scientific article; zbMATH DE number 1286465 (Why is no real title available?)
- Random walks on colored graphs
- Cover times, blanket times, and majorizing measures
- scientific article; zbMATH DE number 1107737 (Why is no real title available?)
- Graph homomorphisms through random walks
- scientific article; zbMATH DE number 2067820 (Why is no real title available?)
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- Graph clustering
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- The accessibility of convex bodies and derandomization of the hit and run algorithm
- Estimating graph parameters via random walks with restarts
- Drawing Big Graphs Using Spectral Sparsification
- Random walks on graphs: ideas, techniques and results
- Random generators of the symmetric group: diameter, mixing time and spectral gap.
- Graph similarity through entropic manifold alignment
- Cutpoint Decoupling and First Passage Times for Random Walks on Graphs
- Comparison of multiple random walks strategies for searching networks
- scientific article; zbMATH DE number 1894369 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878667)
