| |
|
Description: |
A a connected graph and without cycles, a tree is constructed, with a single infinite self-avoiding path, an end, and the vertices of the tree are points of an infinite sequence of Independent Poisson Point Processes defined in R^d, such that for every k larger or equal than 1, the rate of k-th process X_k is l_k. We name such a graph of One-Ended Poissonian Tree.
Area(s):
|
|
Date: |
|
| Start Time: |
15:00 |
|
Speaker: |
Iesus Diniz
(USP, Brasil)
|
|
Place: |
5.5
|
| Research Groups: |
-Probability and Statistics
|
|
See more:
|
<Main>
|
|
