Erdős Problem #1165 — How many planar favorite sites recur infinitely often?
Statement
For simple random walk on , let be the set of sites having maximal local time by time . For each , what is
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.