Reconstruction of graphs based on random walks
type: Item
instance of: scholarly article
title: Reconstruction of graphs based on random walks
zbMATH Open document ID: 1173.05033
author: Dominik M. Wittmann
author: Daniel Schmidl
author: Florian Blöchl
author: Fabian J. Theis
published in: Theoretical Computer Science
publication date: 2009-09-10T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5602743
zbMATH Keywords: graph theory
zbMATH Keywords: distance realization problem
zbMATH Keywords: random walk
zbMATH Keywords: mean first hitting time
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.05.026
OpenAlex ID: W2024311094
Wikidata QID: Q59682403
cites work: On optimal realizations of finite metric spaces by graphs
cites work: The distance matrix of a graph and its tree realization
cites work: Emergence of Scaling in Random Networks
cites work: Conditionally positive functions and p-norm distance matrices
cites work: Properties of the distance matrix of a tree
cites work: Q4398864
cites work: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
cites work: Q4363164
cites work: Distance realization problems with applications to internet tomography
cites work: Matrix multiplication via arithmetic progressions
cites work: A fast algorithm for constructing trees from distance matrices
cites work: Free trees and bidirectional trees as representations of psychological distance
cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
cites work: Q3267900
cites work: Q5689624
cites work: Distance matrix of a graph and its realizability
cites work: Q4097183
cites work: Q4856000
cites work: An Optimality Criterion for Graph Embeddings of Metrics
cites work: An algorithm and its role in the study of optimal graph realizations of distance matrices
cites work: Submatrices of non-tree-realizable distance matrices
cites work: Random walks and the effective resistance of networks
cites work: A constructive algorithm for realizing a distance matrix
cites work: Collective dynamics of ‘small-world’ networks
DBLP publication ID: journals/tcs/WittmannSBT09
DOI: 10.1016/J.TCS.2009.05.026
Recommended article: A Theorem on Reconstruction of Random Graphs
Recommended article: Reconstruction of the final distribution of probabilities for random walks on a graph
Recommended article: On reconstruction of graphs
Recommended article: Q3824449
Recommended article: Q4608000
Recommended article: Graph reconstruction from path correlation data
Recommended article: Q5203456
Recommended article: Q3976406
Recommended article: Q3757091
Recommended article: Estimating graph parameters with random walks
description: scientific article; zbMATH DE number 5602743