{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:06:19Z","timestamp":1774127179457,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1016\/j.ijar.2016.02.008","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T17:17:57Z","timestamp":1457371077000},"page":"76-86","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Random walks on graphs with interval weights and precise marginals"],"prefix":"10.1016","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-585X","authenticated-orcid":false,"given":"Damjan","family":"\u0160kulj","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ijar.2016.02.008_br0010","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1215\/21562261-2693442","article-title":"Cover times for sequences of reversible Markov chains on random graphs","volume":"54","author":"Abe","year":"2014","journal-title":"Kyoto J. Math."},{"key":"10.1016\/j.ijar.2016.02.008_br0020","author":"Aldous"},{"issue":"1","key":"10.1016\/j.ijar.2016.02.008_br0030","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01048272","article-title":"Lower bounds for covering times for reversible Markov chains and random walks on graphs","volume":"2","author":"Aldous","year":"1989","journal-title":"J. Theor. Probab."},{"issue":"4","key":"10.1016\/j.ijar.2016.02.008_br0040","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/rsa.3240060406","article-title":"A tight lower bound on the cover time for random walks on graphs","volume":"6","author":"Feige","year":"1995","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"10.1016\/j.ijar.2016.02.008_br0050","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/rsa.3240060106","article-title":"A tight upper bound on the cover time for random walks on graphs","volume":"6","author":"Feige","year":"1995","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"10.1016\/j.ijar.2016.02.008_br0060","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","article-title":"Random walks on graphs","volume":"2","author":"G\u00f6bel","year":"1974","journal-title":"Stoch. Process. Appl."},{"key":"10.1016\/j.ijar.2016.02.008_br0070","series-title":"Combinatorics, Paul Erd\u0151s is Eighty, vol. 2, Bolyai Society Mathematical Studies","first-page":"1","article-title":"Random walks on graphs: a survey","author":"Lov\u00e1sz","year":"1993"},{"issue":"4","key":"10.1016\/j.ijar.2016.02.008_br0080","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1093\/biomet\/82.4.711","article-title":"Reversible jump Markov chain Monte Carlo computation and bayesian model determination","volume":"82","author":"Green","year":"1995","journal-title":"Biometrika"},{"issue":"1","key":"10.1016\/j.ijar.2016.02.008_br0090","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","article-title":"Monte Carlo sampling methods using Markov chains and their applications","volume":"57","author":"Hastings","year":"1970","journal-title":"Biometrika"},{"key":"10.1016\/j.ijar.2016.02.008_br0100","series-title":"Approximation Algorithms for NP-hard Problems","first-page":"482","article-title":"The Markov chain Monte Carlo method: an approach to approximate counting and integration","author":"Jerrum","year":"1996"},{"issue":"3","key":"10.1016\/j.ijar.2016.02.008_br0110","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/174130.174131","article-title":"Random walks on weighted graphs and applications to on-line algorithms","volume":"40","author":"Coppersmith","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/j.ijar.2016.02.008_br0120","doi-asserted-by":"crossref","DOI":"10.1038\/srep05365","article-title":"Mean first-passage time for maximal-entropy random walks in complex networks","volume":"4","author":"Lin","year":"2014","journal-title":"Sci. Rep."},{"issue":"3","key":"10.1016\/j.ijar.2016.02.008_br0130","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.1467-8640.2012.00411.x","article-title":"Probabilistic models for focused web crawling","volume":"28","author":"Liu","year":"2012","journal-title":"Comput. Intell."},{"key":"10.1016\/j.ijar.2016.02.008_br0140","doi-asserted-by":"crossref","DOI":"10.1038\/srep07460","article-title":"Effects of reciprocity on random walks in weighted networks","volume":"4","author":"Zhang","year":"2014","journal-title":"Sci. Rep."},{"key":"10.1016\/j.ijar.2016.02.008_br0150","series-title":"Proceedings of the Fourth ACM International Conference on Web Search and Data Mining","first-page":"635","article-title":"Supervised random walks: predicting and recommending links in social networks","author":"Backstrom","year":"2011"},{"key":"10.1016\/j.ijar.2016.02.008_br0160","series-title":"Proceedings of the 20th ACM International Conference on Information and Knowledge Management","first-page":"1147","article-title":"Link prediction: the power of maximal entropy random walk","author":"Li","year":"2011"},{"key":"10.1016\/j.ijar.2016.02.008_br0170","series-title":"Computer and Information Sciences \u2013 ISCIS 2005: 20th International Symposium, Proceedings","first-page":"284","article-title":"Computing communities in large networks using random walks","author":"Pons","year":"2005"},{"key":"10.1016\/j.ijar.2016.02.008_br0180","series-title":"2010 International Conference on Advances in Social Networks Analysis and Mining","first-page":"152","article-title":"A unified framework for link recommendation using random walks","author":"Yin","year":"2010"},{"issue":"3","key":"10.1016\/j.ijar.2016.02.008_br0190","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","volume":"19","author":"Fouss","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ijar.2016.02.008_br0200","series-title":"Introduction to Imprecise Probabilities","author":"Augustin","year":"2014"},{"issue":"4","key":"10.1016\/j.ijar.2016.02.008_br0210","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1017\/S0269964809990039","article-title":"Imprecise Markov chains and their limit behavior","volume":"23","author":"de Cooman","year":"2009","journal-title":"Probab. Eng. Inf. Sci."},{"key":"10.1016\/j.ijar.2016.02.008_br0220","series-title":"Markov Set-Chains","author":"Hartfiel","year":"1998"},{"issue":"8","key":"10.1016\/j.ijar.2016.02.008_br0230","doi-asserted-by":"crossref","first-page":"1314","DOI":"10.1016\/j.ijar.2009.06.007","article-title":"Discrete time Markov chains with interval probabilities","volume":"50","author":"\u0160kulj","year":"2009","journal-title":"Int. J. Approx. Reason."},{"issue":"0","key":"10.1016\/j.ijar.2016.02.008_br0240","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.amc.2014.10.092","article-title":"Efficient computation of the bounds of continuous time imprecise Markov chains","volume":"250","author":"\u0160kulj","year":"2015","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.ijar.2016.02.008_br0250","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.ijar.2007.12.001","article-title":"A survey of the theory of coherent lower previsions","volume":"48","author":"Miranda","year":"2008","journal-title":"Int. J. Approx. Reason."},{"issue":"2","key":"10.1016\/j.ijar.2016.02.008_br0260","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","article-title":"Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: a survey","volume":"197","author":"Aissi","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.ijar.2016.02.008_br0270","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","article-title":"Interval data minmax regret network optimization problems","volume":"138","author":"Averbakh","year":"2004","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ijar.2016.02.008_br0280","series-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman","year":"2014"},{"issue":"1","key":"10.1016\/j.ijar.2016.02.008_br0290","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00184-011-0378-0","article-title":"Coefficients of ergodicity for Markov chains with uncertain parameters","volume":"76","author":"\u0160kulj","year":"2013","journal-title":"Metrika"}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X16300184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X16300184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T21:13:45Z","timestamp":1718399625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X16300184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":29,"alternative-id":["S0888613X16300184"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2016.02.008","relation":{},"ISSN":["0888-613X"],"issn-type":[{"value":"0888-613X","type":"print"}],"subject":[],"published":{"date-parts":[[2016,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Random walks on graphs with interval weights and precise marginals","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2016.02.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}