Convergence of patterned matrices with random walk entries (2512.04612v1)
Abstract: It is well known that the Brownian motion on the real line can be obtained as a weak limit of a suitably scaled continuous-time random walk (CTRW). We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs of various types. In a non-commutative probability framework, we use these high dimensional matrices to derive approximations of the free Brownian motion. Furthermore, we introduce and analyze a random time-changed version of the free Brownian motion driven by an inverse stable subordinator. An approximation of this process is obtained using a random matrix whose entries consist of continuous-time randomly stopped random walks. Moreover, it is shown that the empirical spectral distributions of such matrices have longer tails. Additionally, in a specific case, we use the explicit eigenvalue expressions of these matrices to obtain weak approximations of the standard Brownian motion and a time-changed variant of it.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.