all weight sequences normalized by the number of random walks, converge almost surely to some deterministic constants, and we conjecture that this is a general fact which…
Statement
all weight sequences normalized by the number of random walks, converge almost surely to some deterministic constants, and we conjecture that this is a general fact which should hold on any finite graph. Several problems on this model remain open, such as proving our main conjec- ture on general finite graphs, or extending the model in order to be able to treat the case with several sources of food in a meaningful manner. The report passage is retained verbatim as the relevant context for this extracted problem.
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.