Design of biased random walks on a graph with application to collaborative recommendation
From MaRDI portal
Publication:2669314
DOI10.1016/j.physa.2021.126752OpenAlexW4200097287MaRDI QIDQ2669314
Sylvain Courtain, Pierre Leleux, Marco Saerens, Kevin Francoisse
Publication date: 9 March 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2021.126752
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive importance sampling for control and inference
- Optimal control as a graphical model inference problem
- Maximizing entropy over Markov processes
- Nonequilibrium Markov processes conditioned on large deviations
- A sum-over-paths extension of edit distances accounting for all sequence alignments
- Random walk with restart: fast solutions and applications
- Evolutionary formalism for products of positive random matrices
- Random walks and diffusion on networks
- Developments in the theory of randomized shortest paths with a comparison of graph node distances
- Randomized shortest paths with net flows and capacity constraints
- A bag-of-paths framework for network data analysis
- The multiplier method of Hestenes and Powell applied to convex programming
- Elements of Random Walk and Diffusion Processes
- Optimal Control of Markov Decision Processes With Linear Temporal Logic Constraints
- Efficient computation of optimal actions
- Trading Value and Information in MDPs
- Authoritative sources in a hyperlinked environment
- Information Theory and Statistical Mechanics
- Conditional brownian motion and the boundary limits of harmonic functions
- Effective Langevin equations for constrained stochastic processes
- Maxentropic Markov chains (Corresp.)
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- The entropy of Markov trajectories
- Markov Chains
- Robust Transport Over Networks
- Efficient Robust Routing for Single Commodity Network Flows
- Elements of the Random Walk
- Path integrals and symmetry breaking for optimal control theory
- Random walks on weighted networks: a survey of local and non-local dynamics
- Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
- Discrete-time classical and quantum Markovian evolutions: Maximum entropy problems on path space
- Randomized Shortest-Path Problems: Two Related Models
- Intrinsic Markov Chains
- The Entropy of Conditional Markov Trajectories
- Statistical Physics of Particles
- Elements of Information Theory
This page was built for publication: Design of biased random walks on a graph with application to collaborative recommendation
