Related papers: Benford behavior resulting from stick and box frag…

Motivated by giving a meaning to "The probability that a random integer has initial digit d", we define a URI-set as a random set E of natural integers such that each n>0 belongs to E with probability 1/n, independently of other integers.…

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…

This note studies the asymptotic properties of the variable $$Z_d:=\frac{X_1}{d}|\{X_1+X_2=d\},$$ as $d\to \infty$. Here $X_1$ and $X_2$ are non-negative i.i.d. variables with a common twice differentiable density function $f$. General…

Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…

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…

Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…

In this paper I describe two general methods of constructing a probability density function (pdf) of a Benford random variable, and show that the pdf of every Benford random variable may be constructed by these methods. These constructions…

A 1-factorisation of a regular graph $G$ is a partition of its edge set $E(G)$ into perfect matchings of $G$. Behague asked for the minimal $r=r(d)$ such that some $1$-factorisation of the $d$-dimensional hypercube $Q_d$ has the property…

Consider two urns, $A$ and $B$, where initially $A$ contains a large number $n$ of balls and $B$ is empty. At each step, with equal probability, either we pick a ball at random in $A$ and place it in $B$, or vice-versa (provided of course…

Stretched exponential probability density functions (pdf), having the form of the exponential of minus a fractional power of the argument, are commonly found in turbulence and other areas. They can arise because of an underlying random…

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Let $\eta_i, i=1,..., n$ be iid Bernoulli random variables. Given a multiset $\bv$ of $n$ numbers $v_1, ..., v_n$, the \emph{concentration probability} $\P_1(\bv)$ of $\bv$ is defined as $\P_1(\bv) := \sup_{x} \P(v_1 \eta_1+ ... v_n…

Recent works have highlighted optimization difficulties faced by gradient descent in training the first and last layers of transformer-based language models, which are overcome by optimizers such as Adam. These works suggest that the…

We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…

During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…

For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…

Recent research across mathematical problem solving, proof assistant programming and multimodal jailbreaking documents a striking finding: when (multimodal) language model tackle a suite of tasks with multiple attempts per task --…

Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…

Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…