Convergence criterion for longer-range interaction drift matrices
Prove or disprove that, when the sampling and reinforcement graphs coincide and have a common underlying graph of period d, the stochastic process with drift matrix W^{m_1}Q\widetilde A^{m_2}-I converges to a deterministic limit whenever \gcd(m_1+m_2,d)=1.
References
Extending the framework to allow sampling and reinforcement mechanisms that depend on longer-range neighbourhoods would provide a natural direction for further investigation. In particular, we have the following conjecture. Suppose the sampling and reinforcement graphs coincide, with common underlying graph G of period d. If the drift matrix is of the form W{m_1}Q\widetilde A{m_2}-I, the process converges to a deterministic limit whenever \gcd(m_1+m_2,d)=1.
In the random-limit regime, the distributional properties of the limiting random vector are largely unknown; establishing whether the limit is non-degenerate is an important open problem.