DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jung, Paul Heajoon | ko |
dc.contributor.author | Markowsky, Greg | ko |
dc.date.accessioned | 2020-09-18T04:02:24Z | - |
dc.date.available | 2020-09-18T04:02:24Z | - |
dc.date.created | 2020-01-03 | - |
dc.date.created | 2020-01-03 | - |
dc.date.created | 2020-01-03 | - |
dc.date.issued | 2020-05 | - |
dc.identifier.citation | JOURNAL OF COMBINATORICS, v.11, no.3, pp.549 - 555 | - |
dc.identifier.issn | 2156-3527 | - |
dc.identifier.uri | http://hdl.handle.net/10203/276124 | - |
dc.description.abstract | A short proof of the equivalence of the recurrence of a non-back-tracking random walk and that of a simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in question is not regular. | - |
dc.language | English | - |
dc.publisher | INT PRESS BOSTON | - |
dc.title | Remarks on the recurrence and transience of non-backtracking random walks | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 11 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 549 | - |
dc.citation.endingpage | 555 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORICS | - |
dc.identifier.doi | 10.4310/JOC.2020.v11.n3.a7 | - |
dc.contributor.localauthor | Jung, Paul Heajoon | - |
dc.contributor.nonIdAuthor | Markowsky, Greg | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Non-backtracking random walk | - |
dc.subject.keywordAuthor | Polya&apos | - |
dc.subject.keywordAuthor | s theorem | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.