Reconstructing Markov processes from independent and anonymous experiments
DOI10.1016/J.DAM.2015.06.035zbMATH Open1329.05215OpenAlexW1028735754MaRDI QIDQ906437FDOQ906437
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1029228
- Sampling reconstruction of Markov processes with a finite number of states
- Reconstruction of Markov random fields from samples: some observations and algorithms
- Reconstruction of sequential machines by experiments
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
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
- Title not available (Why is that?)
- Sequential updating of conditional probabilities on directed graphical structures
- Title not available (Why is that?)
- Approximating discrete probability distributions with dependence trees
- Probabilistic graphical models.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The structure and dynamics of networks
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Title not available (Why is that?)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Title not available (Why is that?)
- Learning a Hidden Matching
- Learning a Hidden Subgraph
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Graph-Theoretic Concepts in Computer Science
- Optimal reconstruction of graphs under the additive model
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Optimally reconstructing weighted graphs using queries
- An optimal algorithm to reconstruct trees from additive distance data
- Memory Efficient Anonymous Graph Exploration
- Network Inference From Co-Occurrences
- Using PageRank to Locally Partition a Graph
- Finding sparse cuts locally using evolving sets
- 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
This page was built for publication: Reconstructing Markov processes from independent and anonymous experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906437)
