Login / Signup
Random walk on rectangles and parallelepipeds algorithm for solving transient anisotropic drift-diffusion-reaction problems.
Karl K. Sabelfeld
Published in:
Monte Carlo Methods Appl. (2019)
Keyphrases
</>
random walk
hyper graph
k means
dynamic programming
learning algorithm
objective function
optimal solution
np hard
pagerank algorithm
anisotropic diffusion
spectral methods
transition probability matrix
flow graph
packing problem
weighted graph
graph structure
expectation maximization
markov chain
social networks