4 problems
- 0 votes0 replies1 view
Monotonicity in the number of walkers
Let be a vertex-transitive graph with stationary distribution . For , let be the social connectivity time when walkers independentl…
- 0 votes0 replies0 views
General graph conjecture for social connectivity time
Let be a connected graph with vertices and average degree . Let denote its social connectivity time. General graph conjecture. There exists a universal…
- 0 votes0 replies0 views
Monotonicity conjecture for social connectivity and walker density
Let be a vertex-transitive graph. For walker-density parameter , let denote expectation in the model with Poisson walker intensity multiplied by…
- 0 votes0 replies0 views
Vertex-transitive graph conjecture for social connectivity time
Let be a finite connected vertex-transitive graph. Let denote the graph parameter defined by … where and is the tr…