Related papers: Benford Behavior in Stick Fragmentation Problems
We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…
A new class of nonparametric prior distributions, termed Beta-Binomial stick-breaking process, is proposed. By allowing the underlying length random variables to be dependent through a Beta marginals Markov chain, an appealing discrete…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
Among econophysics investigations, studies of religious groups have been of interest. On one hand, the present paper concerns the Antoinist community financial reports, - a community which appeared at the end of the 19-th century in…
We study fragmentation numerically using a simple model in which an object is taken to be a set of particles that interact pairwisely via a Lennard-Jones potential while the effect of the fragmentation-induced forces is represented by some…
We establish a strong law of large numbers for one-dimensional continuous-time random walks in dynamic random environments under two main assumptions: the environment is required to satisfy a decoupling inequality that can be interpreted as…
We prove two results relating the basis number of a graph $G$ to path decompositions of $G$. Our first result shows that the basis number of a graph is at most four times its pathwidth. Our second result shows that, if a graph $G$ has a…
Let $\lambda(n)$ denote the exponent of the multiplicative group modulo $n$. We show that when $q$ is odd, each coprime residue class modulo $q$ is hit equally often by $\lambda(n)$ as $n$ varies. Under the stronger assumption that…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to random walks on $\mathbb{Z}^d$ with $d\geq1$. We…
We investigate fragmentation processes with a steady input of fragments. We find that the size distribution approaches a stationary form which exhibits a power law divergence in the small size limit, P(x) ~ x^{-3}. This algebraic behavior…
Here we prove that Benford's law holds for coefficients of an infinite class of modular forms. Expanding the work of Bringmann and Ono on exact formulas for harmonic Maass forms, we derive the necessary asymptotics. This implies that the…
We prove Bombieri-Vinogradov type theorems for primes with a missing digit in their $b$-adic expansion for some large positive integer $b$. The proof is based on the circle method, which relies on the Fourier structure of the integers with…
We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…
Statistical analysis of the eigenfunctions of the Anderson tight-binding model with on-site disorder on regular random graphs strongly suggests that the extended states are multifractal at any finite disorder. The spectrum of fractal…
The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…
The objective of this paper is to investigate the layered structure of topological complexity in the tail of a probability distribution. We establish the functional strong law of large numbers for Betti numbers, a basic quantifier of…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We provide (high probability) bounds on the condition number of random feature matrices. In particular, we show that if the complexity ratio $\frac{N}{m}$ where $N$ is the number of neurons and $m$ is the number of data samples scales like…
Adaptively collected data has become ubiquitous within modern practice. However, even seemingly benign adaptive sampling schemes can introduce severe biases, rendering traditional statistical inference tools inapplicable. This can be…