# Tagged Questions

**8**

votes

**1**answer

171 views

### A random variation on Polya's orchard problem

Polya's orchard problem is as follows:
"How thick must the
trunks of the trees in a regularly spaced circular orchard grow if they are
to block completely the view from the center?"
See, ...

**11**

votes

**1**answer

311 views

### Longest of random worm-like paths in $\mathbb{Z}^2$

Imagine at each lattice point of $\mathbb{Z}^2$ within $[1,3n]^2$,
with coordinates
$\equiv 2 \mod 3$,
we place, with equal probability, one of these six patterns:
The result ...

**0**

votes

**1**answer

55 views

### mean length of the non-crossing graphs on n points

My original question is rather vague so I'll start with a precise example and then indicate possible generalisations.
Given a n-tuple $x=(x_1,\dots,x_n)$ in, say, a square with side-length $1$ in the ...

**7**

votes

**2**answers

264 views

### Wait time to grid network disconnection with failing edges

Let $G_n$ be an $n \times n$ planar toroidal grid graph, with each node
connected to its four neighbors, with the top row connected to the bottom,
and the right column connected to the left.
Suppose ...

**14**

votes

**2**answers

468 views

### Spearing rolling hula hoops

Or: Stabbing rolling disks.
Imagine there are $n$ unit-diameter disks rolling between $x=0$ and $x=d$,
reflecting off either end.
The disk centers start at a random location within $[\frac{1}{2}, ...

**14**

votes

**2**answers

750 views

### Randomly walking a leashed dog

Let a human $h(t)$ random walk on $\mathbb{Z}^2$ by taking a unit-length step at every
time step $t$. A dog $d(t)$ on a leash of length $\lambda$ follows $h(t)$, also
taking a unit-length step at ...

**11**

votes

**1**answer

285 views

### Wander distance of self-avoiding walk that backs out of culs-de-sac

Suppose a self-avoiding walk on $\mathbb{Z}^2$, with random steps each one unit long,
backs out of culs-de-sac, but retaining the lattice points on which it stepped
marked as unavailable for future ...

**3**

votes

**0**answers

113 views

### On understanding Discrete-Valued Stochastic Processes( time series, panel data )

It seems to me that a significant proportion of work in probability theory, statistics and machine learning are on understanding continuous-valued, relatively weakly dependent, or linear dependent ...

**14**

votes

**2**answers

683 views

### Particles chasing one another around a circle

Two particles start out at random positions on a unit-circumference circle.
Each has a random speed (distance per unit time) moving counterclockwise uniformly distributed
within $[0,1]$. How long ...

**37**

votes

**8**answers

3k views

### A sudden smiley? :-)

This is a vague question, and I will no doubt be (properly!) chastised for posing it.
I would like to generate a set $S$ of points in $\mathbb{R}^3$—$|S|$ finite or infinite—which
has the ...

**9**

votes

**4**answers

737 views

### Optimal pebble-packing shape

Suppose you throw many ($n$) congruent convex bodies (in $\mathbb{R}^3$) of unit volume (or of unit area in $\mathbb{R}^2$) into a large container, and shake it until little else changes.
Q. ...

**34**

votes

**6**answers

994 views

### Tetris-like falling sticky disks

Suppose unit-radius disks fall vertically from $y=+\infty$,
one by one, and create a random jumble of disks above the $x$-axis.
When a falling disk hits another, it stops and sticks there.
Otherwise, ...

**3**

votes

**1**answer

310 views

### Transience of self avoiding random walks on $\mathbb{Z}^d$

I'm finishing up a masters thesis in computer science and want to say a bit in the introduction about self-avoiding walks. My thesis looks at a random process which arose in computer science and my ...

**7**

votes

**3**answers

250 views

### Expected minimum face angle of random convex polyhedron in $\mathbb{R}^3$

Let $P_n$ be a "random convex polyhedron" in $\mathbb{R}^3$ of $n$ vertices, where "random" could follow any one
of a number of models:
(1) the convex hull of $n$ points randomly and uniformly ...

**8**

votes

**2**answers

353 views

### Limit shape for fixed-perimeter lattice polygons

Let $P$ be a simple polygon defined by $n$ unit-length segments
connecting lattice points of $\mathbb{Z}^2$.
I have two operations that preserve the perimeter of $P$.
The first is the "pop" of a ...

**2**

votes

**3**answers

818 views

### Draw a Random Line Through a Voronoi Tessellation, What is the Average Number of Voronoi Cell the Line Intersects?

Update: problem reformulation
Following the advice in comments, I now restate my problem using Voronoi
tessellation.
Given a unit hypercube $H_n=\{(x_1,\ldots,x_n)\in \mathbb{R}^n: 0\leq x_i\leq
...

**12**

votes

**1**answer

650 views

### Random polycube shapes

I am wondering if it is hopeless to obtain any firm results
on the following model of a "random polycube shape."
First, a polycube in $\mathbb{R}^3$
is a connected face-to-face gluing of unit cubes.
...

**16**

votes

**6**answers

1k views

### Shortest grid-graph paths with random diagonal shortcuts

Suppose you have a network of edges connecting
each integer lattice point
in the 2D square grid $[0,n]^2$
to each of its (at most) four neighbors, {N,S,E,W}.
Within each of the $n^2$ unit cells of ...

**10**

votes

**3**answers

1k views

### A random walk on random lines

I am wondering if this random walk remains finite with positive probability.
Start with three lines $A,B,C$ that are extensions of an equilateral triangle.
Let $p_0$ be one corner. Generate a line ...

**18**

votes

**3**answers

2k views

### What upper bounds are known for the diameter of the minimum spanning tree of $n$ uniformly random points in $[0,1]^2$?

Let $P$ be a pointset consisting of $n$ uniformly random elements of $[0,1]^2$. It is known that the diameter (greatest number of edges in any shortest path between two points) of the Delaunay ...

**12**

votes

**2**answers

1k views

### Random walk is to diffusion as self-avoiding random walk is to …?

One can view a random walk as a discrete process whose continuous
analog is diffusion.
For example, discretizing the heat diffusion equation
(in both time and space) leads to random walks.
Is there a ...

**10**

votes

**1**answer

387 views

### Random geometric graphs and spanners

I would grateful to learn of work mixing
random geometric graphs with random graphs under
the
ErdÅ‘s-Renyi model, and in particular concerning spanners.
Select $n$ points uniformly at random from the ...

**20**

votes

**5**answers

802 views

### Iterated Circumcircle

Take three noncollinear points (a,b,c), compute the center of their circumcircle x, and replace a random one of a,b,c with x. Repeat. It seems this process may converge to a point, assuming no ...

**6**

votes

**3**answers

673 views

### Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance Part II

For some context see Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance
As per Noah's answer and JBL's comment this was false as stated. However, I think the following ...

**9**

votes

**1**answer

420 views

### Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance

Problem: Consider a random walk on the lattice $\mathbb{Z}^2$ where on each iteration a particle either stays at its current location or moves to a neighboring vertex with probability 1/5. We start ...