Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
356 views

Probabilistic problem on random spanning trees

Let $G(V,E)$ be a connected simple graph, where $V$ and $E$ denote respectively its vertex and the edge set respectively. Let $f: V\to \{-1,1\}$ a function mapping each vertex to a value in $\{-1,1\}$....
Penelope Benenati's user avatar
4 votes
1 answer
594 views

Martingales and intersection of random walks

Let $G=(V,E)$ be a graph with $n$ vertices. Consider a pair of independent simple random walks $(X,Y)$ on the graph, each of length $L$ starting from a node $v \in V$. We denote a length-$L$ random ...
Kcafe's user avatar
  • 519
3 votes
2 answers
478 views

Random spanning trees probability problem

We are given a simple connected graph $G(V,E)$ with vertex and edge set $V$ and $E$ respectively. For any vertex $v\in V$, let $D_T(v)$ the degree of $v$ in a uniformly generated random spanning tree $...
Penelope Benenati's user avatar
3 votes
0 answers
190 views

Probabilistic optimization problem on tree vertex selection without replacement proportional to the degree

We are given a tree $T(V,E)$ with $|V|=n$ vertices, where $V=\{v_1,v_2,\ldots, v_n\}$. We denote by $d_i$ the degree of vertex $v_i$ for all $i\in\{1,2,\ldots,n\}$. In a sequential fashion, we select ...
Penelope Benenati's user avatar
3 votes
0 answers
83 views

Growth models with lookahead

Given a connected graph $G$ with a connected subgraph $H$, we can consider the uniform distribution on the set of all sequences $H_0, H_1, \dots, H_r$ where $r = |E(G) \setminus E(H)|$, $H_0 = H$, $...
James Propp's user avatar
  • 19.7k
2 votes
1 answer
115 views

Randomly chosen walk of fixed length

Let $G=(V, E)$ be the graph on vertices $V = \{0, \cdots, k\}^n$, where vertices $(v_1, \cdots, v_n)$ and $(w_1, \cdots, w_n)$ share an edge iff $\lvert v_i - w_i\rvert \leq 1$ for all $i$. A walk of ...
S. M. Roch's user avatar
1 vote
0 answers
41 views

Asymptotic mixing time and Euclidean probability distance for path graphs

We are given a simple path graph $P(V,E)$ with vertex set $V$ and edge set $E$, having $n=|V|$ nodes. Given an initial distribution $\mathbf{\mu}$ over $V$, let $d_t(\mathbf{\mu},\pi)$ be defined as $\...
Penelope Benenati's user avatar