Skip to main content

All Questions

8 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
8 votes
0 answers
181 views

Self-avoiding walks on strips

A strip is a locally finite graph which admits a quasi-transitive (i.e. finitley many orbits on vertices) action of $\mathbb Z$. A self avoiding walk is a walk which visits no vertex more than once. ...
Florian Lehner's user avatar
7 votes
0 answers
171 views

What is known about the distribution of lengths of the cycle you get by adding an edge to a uniform spanning tree?

Let $G$ be a finite, connected graph. Let $T$ be a uniform spanning tree, and let $e$ be a uniformly random edge not in $T$. When we add $e$ to $T$, we get a subgraph with a unique cycle, $C$. I am ...
Elle Najt's user avatar
  • 1,462
5 votes
0 answers
136 views

What's the variance in the Six Degrees model?

Recall the six degrees of Kevin Bacon game. You can even play the game at The Oracle of Bacon, and their search works via Breadth First Search. I interpret the punchline as saying that if I start ...
David White's user avatar
  • 30.3k
4 votes
0 answers
128 views

Metrized categories

Motivation: Let $\Gamma = (V,E)$ be a directed graph. To each edge $e \in E$, choose a value $\kappa^e \in \mathbb R$, representing the cost of transporting one unit of "stuff" through the edge. Let $\...
Tom LaGatta's user avatar
  • 8,512
3 votes
0 answers
98 views

Asymptotic results on statistical graph models

This post is partly inspired by this post. Reference request: results on the asymptotic distribution of singular values related to a random orthogonal matrix While it is well-known that two basic ...
Henry.L's user avatar
  • 8,071
2 votes
0 answers
159 views

Distribution of path probabilities for a finite absorbing Markov chain

I am interested in the distribution of path probabilities for a finite absorbing (but otherwise well behaved) Markov chain. Has this topic been considered in the literature? A bit of Googling ...
Steve Huntsman's user avatar
2 votes
0 answers
115 views

Influence of independent variables on boolean functions?

Suppose a simple connected graph $G$ where its vertices are assumed to be independent. An event with uncertainty corresponds to each vertex. My instructor guides me that even though the vertices (...
hhh's user avatar
  • 143
1 vote
0 answers
340 views

Random walk on non-abelian free group

Let $F_2$ be the free non-abelian group with generators $a, b\in F_2$. Has the "random walk" where we start with the identity and then multiply it by $a$ or $b$ or $a^{-1}$ or $b^{-1}$ ...
abab's user avatar
  • 11