Skip to main content
MathOverflow

Return to Question

added 14 characters in body
Source Link
Chris
Chris
  • 23
  • 3

Hi, I am interested in the distribution of return times in simple random walks on finite graphs.

Let $G$ be a connected finite graph with, with two independent random walks. If both random walks start are at time $t_0$ on the same node in the graph, how long does it take until they meet again? I have not found papers on this specific problem, but read that is can be transformed to a single random walk and the question of when the random walk returns to exactly the node where it is at $t_0$.

As such I am interested in the distribution of these return times. Generally I know how to compute the numeric values of the distribution for a given graph. But my question is whether this can be modeled through a given distribution (e.g. exponential).

Besides the PDF I am more interested in the CDF of this return time distribution.

Hi, I am interested in the distribution of return times in random walks on graphs.

Let $G$ be a connected finite graph with, with two independent random walks. If both random walks start are at time $t_0$ on the same node in the graph, how long does it take until they meet again? I have not found papers on this specific problem, but read that is can be transformed to a single random walk and the question of when the random walk returns to exactly the node where it is at $t_0$.

As such I am interested in the distribution of these return times. Generally I know how to compute the numeric values of the distribution for a given graph. But my question is whether this can be modeled through a given distribution (e.g. exponential).

Besides the PDF I am more interested in the CDF of this return time distribution.

Hi, I am interested in the distribution of return times in simple random walks on finite graphs.

Let $G$ be a connected finite graph with, with two independent random walks. If both random walks start are at time $t_0$ on the same node in the graph, how long does it take until they meet again? I have not found papers on this specific problem, but read that is can be transformed to a single random walk and the question of when the random walk returns to exactly the node where it is at $t_0$.

As such I am interested in the distribution of these return times. Generally I know how to compute the numeric values of the distribution for a given graph. But my question is whether this can be modeled through a given distribution (e.g. exponential).

Besides the PDF I am more interested in the CDF of this return time distribution.

overworked question
Source Link
Chris
Chris
  • 23
  • 3

Hi, I am interested in return time behaviorthe distribution of return times in random walks on graphs. To calculate the return

Let $G$ be a connected finite graph with, with two independent random walks. If both random walks start are at time distribution$t_0$ on the same node in the graph, how long does it take until they meet again? I have not found papers on this specific problem, but read that is can be transformed to calculatea single random walk and the return times for every pair inquestion of when the graphrandom walk returns to exactly the node where it is at $t_0$.

Exist distributions on the return time? Conclusions onAs such I am interested in the distribution of the CDF ofthese return time? My goal istimes. Generally I know how to determinecompute the numeric values of the distribution for a given graph the return time. But my question is whether this can be modeled through a given distribution (e.g. exponential).

So farBesides the PDF I have seen such distributions for special graphs like circuits or chains, but no general statementsam more interested in the CDF of this return time distribution.

Hi, I am interested in return time behavior of random walks on graphs. To calculate the return time distribution I have to calculate the return times for every pair in the graph.

Exist distributions on the return time? Conclusions on the distribution of the CDF of return time? My goal is to determine for a given graph the return time distribution.

So far I have seen such distributions for special graphs like circuits or chains, but no general statements.

Hi, I am interested in the distribution of return times in random walks on graphs.

Let $G$ be a connected finite graph with, with two independent random walks. If both random walks start are at time $t_0$ on the same node in the graph, how long does it take until they meet again? I have not found papers on this specific problem, but read that is can be transformed to a single random walk and the question of when the random walk returns to exactly the node where it is at $t_0$.

As such I am interested in the distribution of these return times. Generally I know how to compute the numeric values of the distribution for a given graph. But my question is whether this can be modeled through a given distribution (e.g. exponential).

Besides the PDF I am more interested in the CDF of this return time distribution.

Source Link
Chris
Chris
  • 23
  • 3

Exist closed forms of the distribution of return time in markov chains?

Hi, I am interested in return time behavior of random walks on graphs. To calculate the return time distribution I have to calculate the return times for every pair in the graph.

Exist distributions on the return time? Conclusions on the distribution of the CDF of return time? My goal is to determine for a given graph the return time distribution.

So far I have seen such distributions for special graphs like circuits or chains, but no general statements.