IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v590y2022ics0378437121009481.html
   My bibliography  Save this article

Design of biased random walks on a graph with application to collaborative recommendation

Author

Listed:
  • Leleux, Pierre
  • Courtain, Sylvain
  • Françoisse, Kevin
  • Saerens, Marco

Abstract

This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths framework, for the design of random walks on a graph in which the transition probabilities (the policy) are biased in favor of some node features. More precisely, given a weighted directed graph G and a non-negative cost assigned to each edge, the biased random walk is defined as the policy minimizing the expected cost rate along the walks while maintaining a constant relative entropy rate. As for the standard bag-of-paths and the randomized shortest paths frameworks, the model assigns a Gibbs–Boltzmann distribution to the set of infinite walks and allows to recover known results from the literature, derived here from a different perspective. Examples of quantities of interest are the partition function of the system, the cost rate, the optimal transition probabilities, etc. In addition, the same formalism allows the introduction of capacity constraints on the expected node visit rates and an algorithm for computing the optimal policy subject to such capacity constraints is developed. Simulation results indicate that the proposed procedure can be effectively used in order to define a Markov chain driving the walk towards nodes having some specific properties, like seniority, education level or low node degree (hub-avoiding walk). An application relying on this last property is proposed as a tool for improving serendipity in collaborative recommendation, and is tested on the MovieLens data.

Suggested Citation

  • Leleux, Pierre & Courtain, Sylvain & Françoisse, Kevin & Saerens, Marco, 2022. "Design of biased random walks on a graph with application to collaborative recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    • Handle: RePEc:eee:phsmap:v:590:y:2022:i:c:s0378437121009481
    DOI: 10.1016/j.physa.2021.126752
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437121009481
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2021.126752?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    2. Guex, Guillaume & Kivimäki, Ilkka & Saerens, Marco, 2019. "Randomized optimal transport on a graph: framework and new distance measures," Network Science, Cambridge University Press, vol. 7(1), pages 88-122, March.
    3. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    4. Kivimäki, Ilkka & Shimbo, Masashi & Saerens, Marco, 2014. "Developments in the theory of randomized shortest paths with a comparison of graph node distances," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 600-616.
    5. LAMBIOTTE, Renaud & DELVENNE, Jean-Charles & BARAHONA, Mauricio, 2014. "Random walks, Markov processes and the multiscale modular organization of complex network," LIDAM Reprints CORE 2660, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yuki Oyama, 2023. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of locally perceived attributes," Papers 2307.08646, arXiv.org.
    2. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    3. Oyama, Yuki, 2024. "Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of visually perceived attributes," Transportation Research Part A: Policy and Practice, Elsevier, vol. 181(C).
    4. Yuki Oyama, 2022. "Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach," Papers 2204.01215, arXiv.org, revised Jan 2023.
    5. Oyama, Yuki & Hara, Yusuke & Akamatsu, Takashi, 2022. "Markovian traffic equilibrium assignment based on network generalized extreme value model," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 135-159.
    6. Benjamin Davies & David C. Maré, 2020. "Delineating functional labour market areas with estimable classification stabilities," Working Papers 20_08, Motu Economic and Public Policy Research.
    7. Xin Xu & Yang Lu & Yupeng Zhou & Zhiguo Fu & Yanjie Fu & Minghao Yin, 2021. "An Information-Explainable Random Walk Based Unsupervised Network Representation Learning Framework on Node Classification Tasks," Mathematics, MDPI, vol. 9(15), pages 1-14, July.
    8. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    9. Artur F. Tomeczek & Tomasz M. Napiórkowski, 2024. "PageRank and Regression as a Two-Step Approach to Analysing a Network of Nasdaq Firms During a Recession: Insights from Minimum Spanning Tree Topology," Gospodarka Narodowa. The Polish Journal of Economics, Warsaw School of Economics, issue 3, pages 56-69.
    10. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    11. Mogens Fosgerau & Mads Paulsen & Thomas Kj{ae}r Rasmussen, 2021. "A perturbed utility route choice model," Papers 2103.13784, arXiv.org, revised Sep 2021.
    12. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    13. Fosgerau, Mogens & Frejinger, Emma & Karlstrom, Anders, 2013. "A link based network route choice model with unrestricted choice set," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 70-80.
    14. Yu Tian & Sebastian Lautz & Alisdiar O. G. Wallis & Renaud Lambiotte, 2021. "Extracting Complements and Substitutes from Sales Data: A Network Perspective," Papers 2103.02042, arXiv.org, revised Aug 2021.
    15. Kivimäki, Ilkka & Shimbo, Masashi & Saerens, Marco, 2014. "Developments in the theory of randomized shortest paths with a comparison of graph node distances," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 600-616.
    16. Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.
    17. Wong, S. C., 1999. "On the convergence of Bell's logit assignment formulation," Transportation Research Part B: Methodological, Elsevier, vol. 33(8), pages 609-616, November.
    18. Jiang Qian Ying, 2015. "Optimization for Multiclass Residential Location Models with Congestible Transportation Networks," Transportation Science, INFORMS, vol. 49(3), pages 452-471, August.
    19. Xicheng Yin & Hongwei Wang & Pei Yin & Hengmin Zhu & Zhenyu Zhang, 2020. "A co-occurrence based approach of automatic keyword expansion using mass diffusion," Scientometrics, Springer;Akadémiai Kiadó, vol. 124(3), pages 1885-1905, September.
    20. Bekhor, Shlomo & Toledo, Tomer, 2005. "Investigating path-based solution algorithms to the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 279-295, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:590:y:2022:i:c:s0378437121009481. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.