The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Difference equations, isoperimetric inequality and transience of certain random walks
Open accessAbstract
The difference Laplacian on a square lattice in R n has been studied by many authors. In this paper an analogous difference operator is studied for an arbitrary graph. It is shown that many properties of the Laplacian in the continuous setting (e.g. the maximum principle, the Harnack inequality, and Cheeger’s bound for the lowest eigenvalue) hold for this difference operator. The difference Laplacian governs the random walk on a graph, just as the Laplace operator governs the Brownian motion. As an application of the theory of the difference Laplacian, it is shown that the random walk on a class of graphs is transient.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
�ber die partiellen Differenzengleichungen der mathematischen Physik
Courant, R., Friedrichs, K., & Lewy, H. (1928) · Mathematische Annalen · doi:10.1007/bf01448839 · Cited by 4,106
A Lower Bound for the Smallest Eigenvalue of the Laplacian
Cheeger, J. (2015) · Problems in Analysis: A Symposium in Honor of Salomon Bochner (PMS-31) · doi:10.1515/9781400869312-013 · Cited by 961
Kemeny, J. G., Snell, J. L., & Knapp, A. W. (1976) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-9455-6 · Cited by 647
Ahlfors, L. V., & Sario, L. (1960) · Princeton University Press eBooks · doi:10.1515/9781400874538 · Cited by 527
Duffin, R. J. (1953) · Duke Mathematical Journal · doi:10.1215/s0012-7094-53-02023-7 · Cited by 133
Cited by
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Grigor’yan, A. (1999) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-99-00776-4 · Cited by 807
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Metadata
- Authors
- Dodziuk, J.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1984
- Volume
- 284
- Issue
- 2
- Pages
- 787-794
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W2038098381
- Cited by
- 475
- References
- 5
- FWCI
- 4.29
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Difference equations, isoperimetric inequality and transience of certain random walks. https://app.cochat.ai/papers/10.1090/s0002-9947-1984-0743744-x
- The paper
- Dodziuk, J. (1984). Difference equations, isoperimetric inequality and transience of certain random walks. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1984-0743744-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.