Reconstructing Markov processes from independent and anonymous experiments
From MaRDI portal
Publication:906437
DOI10.1016/j.dam.2015.06.035zbMath1329.05215OpenAlexW1028735754MaRDI QIDQ906437
Zeyuan Allen Zhu, Silvio Micali
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.035
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning a hidden graph using \(O(\log n)\)queries per edge
- An optimal algorithm to reconstruct trees from additive distance data
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Sequential updating of conditional probabilities on directed graphical structures
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Network Inference From Co-Occurrences
- Using PageRank to Locally Partition a Graph
- Learning a Hidden Matching
- Finding sparse cuts locally using evolving sets
- Memory Efficient Anonymous Graph Exploration
- Learning a Hidden Subgraph
- Graph Reconstruction via Distance Oracles
- Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
- Approximating discrete probability distributions with dependence trees
- Graph-Theoretic Concepts in Computer Science
- Optimal reconstruction of graphs under the additive model
This page was built for publication: Reconstructing Markov processes from independent and anonymous experiments
