Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Richey, Jacob"'
Fix two words over the binary alphabet $\{0,1\}$, and generate iid Bernoulli$(p)$ bits until one of the words occurs in sequence. This setup, commonly known as Penney's ante, was popularized by Conway, who found (in unpublished work) a simple formula
Externí odkaz:
http://arxiv.org/abs/2409.19195
Given a finite word $w$, Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial $\phi_w(t)$ of $w$, which records the set of self-overlaps of $w$, explicitly determines for each $n$, the number $|B
Externí odkaz:
http://arxiv.org/abs/2409.09024
We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly different jump rat
Externí odkaz:
http://arxiv.org/abs/2305.19333
A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutations of the vertices. We prove that on trees the random walk can not be
Externí odkaz:
http://arxiv.org/abs/2302.00760
We prove that the critical value of the one-dimensional Stochastic Sandpile Model is less than one. This verifies a conjecture of Rolla and Sidoravicius.
Comment: 44 pages
Comment: 44 pages
Externí odkaz:
http://arxiv.org/abs/2212.08293
We consider the Activated Random Walk model on $\mathbb{Z}$. In this model, each particle performs a continuous-time simple symmetric random walk, and falls asleep at rate $\lambda$. A sleeping particle does not move but it is reactivated in the pres
Externí odkaz:
http://arxiv.org/abs/2009.09491
Autor:
Racz, Miklos Z., Richey, Jacob
Recent work, motivated by anonymous messaging platforms, has introduced adaptive diffusion protocols which can obfuscate the source of a rumor: a "snapshot adversary" with access to the subgraph of "infected" nodes can do no better than randomly gues
Externí odkaz:
http://arxiv.org/abs/2006.11211
Autor:
Richey, Jacob, Sarkar, Amites
We consider a variant of a classical coverage process, the boolean model in $\mathbb{R}^d$. Previous efforts have focused on convergence of the unoccupied region containing the origin to a well studied limit $C$. We study the intersection of sets cen
Externí odkaz:
http://arxiv.org/abs/2006.01323
We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of which performs a simple symmetric random walk at r
Externí odkaz:
http://arxiv.org/abs/1709.09163
Autor:
Racz, Miklos Z., Richey, Jacob
It is well known that an $n \times n$ Wishart matrix with $d$ degrees of freedom is close to the appropriately centered and scaled Gaussian Orthogonal Ensemble (GOE) if $d$ is large enough. Recent work of Bubeck, Ding, Eldan, and Racz, and independen
Externí odkaz:
http://arxiv.org/abs/1611.05838