Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cutpoints and resistance of random walk paths   We construct a bounded degree graph $G$, such that a simple random walk on it
is transient but the random walk path (i.e., the subgraph of all the edges the
random walk has crossed) has only finitely many cutpoints, almost surely. We
also prove that the expected number of cutpoints of any transient Markov chain
is infinite. This answers two questions of James, Lyons and Peres [A Transient
Markov Chain With Finitely Many Cutpoints (2007) Festschrift for David
Freedman]. Additionally, we consider a simple random walk on a finite connected
graph $G$ that starts at some fixed vertex $x$ and is stopped when it first
visits some other fixed vertex $y$. We provide a lower bound on the expected
effective resistance between $x$ and $y$ in the path of the walk, giving a
partial answer to a question raised in [Ann. Probab. 35 (2007) 732--738].

16
The categories of this paper are: stat
29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph
37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
1
The categories of this paper are: cs
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn