IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v61y2015i3p689-711.html
   My bibliography  Save this article

Potential induced random teleportation on finite graphs

Author

Listed:
  • Shui-Nee Chow
  • Xiaojing Ye
  • Haomin Zhou

Abstract

We propose and analyze a potential induced random walk and its modification called random teleportation on finite graphs. The transition probability is determined by the gaps between potential values of adjacent and teleportation nodes. We show that the steady state of this process has a number of desirable properties. We present a continuous time analogue of the random walk and teleportation, and derive the lower bound on the order of its exponential convergence rate to stationary distribution. The efficiency of proposed random teleportation in search of global potential minimum on graphs and node ranking are demonstrated by numerical tests. Moreover, we discuss the condition of graphs and potential distributions for which the proposed approach may work inefficiently, and introduce the intermittent diffusion strategy to overcome the problem and improve the practical performance. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Shui-Nee Chow & Xiaojing Ye & Haomin Zhou, 2015. "Potential induced random teleportation on finite graphs," Computational Optimization and Applications, Springer, vol. 61(3), pages 689-711, July.
    • Handle: RePEc:spr:coopap:v:61:y:2015:i:3:p:689-711
    DOI: 10.1007/s10589-015-9727-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-015-9727-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-015-9727-7?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. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    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. Asma Khalil Alkhamis & Manar Hosny, 2023. "A Multi-Objective Simulated Annealing Local Search Algorithm in Memetic CENSGA: Application to Vaccination Allocation for Influenza," Sustainability, MDPI, vol. 15(21), pages 1-37, October.
    2. Felipe, Ángel & Ortuño, M. Teresa & Righini, Giovanni & Tirado, Gregorio, 2014. "A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 111-128.
    3. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
    4. Adeinat, Hamza & Pazhani, Subramanian & Mendoza, Abraham & Ventura, Jose A., 2022. "Coordination of pricing and inventory replenishment decisions in a supply chain with multiple geographically dispersed retailers," International Journal of Production Economics, Elsevier, vol. 248(C).
    5. Y Xu & R Qu, 2011. "Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 313-325, February.
    6. S.-C. Horng & S.-Y. Lin, 2009. "Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 213-231, February.
    7. Pavlos S. Georgilakis, 2020. "Review of Computational Intelligence Methods for Local Energy Markets at the Power Distribution Level to Facilitate the Integration of Distributed Energy Resources: State-of-the-art and Future Researc," Energies, MDPI, vol. 13(1), pages 1-37, January.
    8. Samer Hanoun & Asim Bhatti & Doug Creighton & Saeid Nahavandi & Phillip Crothers & Celeste Gloria Esparza, 2016. "Target coverage in camera networks for manufacturing workplaces," Journal of Intelligent Manufacturing, Springer, vol. 27(6), pages 1221-1235, December.
    9. Yaghoubi, Saeed & Noori, Siamak & Azaron, Amir & Fynes, Brian, 2015. "Resource allocation in multi-class dynamic PERT networks with finite capacity," European Journal of Operational Research, Elsevier, vol. 247(3), pages 879-894.
    10. M. De Beule & D. Van Den Poel & N. Van De Weghe, 2013. "An extended Huff-model for robustly benchmarking and predicting retail network performance," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 13/866, Ghent University, Faculty of Economics and Business Administration.
    11. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    12. Dimitrios Karpouzos & Konstantinos Katsifarakis, 2013. "A Set of New Benchmark Optimization Problems for Water Resources Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 27(9), pages 3333-3348, July.
    13. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    14. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    15. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    16. Gülcü, Ayla & Akkan, Can, 2020. "Robust university course timetabling problem subject to single and multiple disruptions," European Journal of Operational Research, Elsevier, vol. 283(2), pages 630-646.
    17. Can Akkan & Ayla Gülcü & Zeki Kuş, 2022. "Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation," Journal of Scheduling, Springer, vol. 25(4), pages 477-501, August.
    18. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.
    19. Fuat Kosanoglu & Mahir Atmis & Hasan Hüseyin Turan, 2024. "A deep reinforcement learning assisted simulated annealing algorithm for a maintenance planning problem," Annals of Operations Research, Springer, vol. 339(1), pages 79-110, August.
    20. Rudai Shan & Lars Junghans, 2023. "Multi-Objective Optimization for High-Performance Building Facade Design: A Systematic Literature Review," Sustainability, MDPI, vol. 15(21), pages 1-33, November.

    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:spr:coopap:v:61:y:2015:i:3:p:689-711. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.