Related papers: The Combinatorics of Avalanche Dynamics
The classical Halpern-L\"auchli theorem states that for any finite coloring of a finite product of finitely branching perfect trees of height $\omega$, there exist strong subtrees sharing the same level set such that tuples consisting of…
We investigate algorithms to find the first vertex in large trees generated by either the uniform attachment or preferential attachment model. We require the algorithm to output a set of $K$ vertices, such that, with probability at least…
We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…
Suppose $\Pi$ is an exchangeable random partition of the positive integers and $\Pi_n$ is its restriction to $\{1, ..., n\}$. Let $K_n$ denote the number of blocks of $\Pi_n$, and let $K_{n,r}$ denote the number of blocks of $\Pi_n$…
In this article we present a simple proof of Borevich-Shafarevich's method to compute the sum of the first n natural numbers of the same power. We also prove several properties of Bernoulli's numbers.
Prediction of an imminent catastrophic event in a driven disordered system is of paramount importance - from the laboratory scale controlled fracture experiment to the largest scale of mechanical failure i.e., earthquakes. It has been long…
Let $X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of…
We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on $\R^n$. This is an application of small ball estimate and Chernoff's…
We consider the mass-dependent aggregation process (k+1)X -> X, given a fixed number of unit mass particles in the initial state. One cluster is chosen proportional to its mass and is merged into one either with k-neighbors in one…
Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the…
The effects of erosion, avalanching and random precipitation are captured in a simple stochastic partial differential equation for modelling the evolution of river networks. Our model leads to a self-organized structured landscape and to…
Consider $n$ independent random numbers with a uniform distribution on $[0,1]$. The number of them that exceed their mean is shown to have an Eulerian distribution, i.e., it is described by the Eulerian numbers. This is related to, but…
This work is concerned with forest and cumulant type expansions of general random variables on a filtered probability spaces. We establish a "broken exponential martingale" expansion that generalizes and unifies the exponentiation result of…
We investigate the kinetics of many-species systems with aggregation of similar species clusters and annihilation of opposite species clusters. We find that the interplay between aggregation and annihilation leads to rich kinetic behaviors…
Avalanches whose sizes and durations are distributed as power laws appear in many contexts. Here, we show that there is a hidden peril in thresholding continuous times series --either from empirical or synthetic data-- for the detection of…
In this paper we introduce and study the class of multivariate strong and strongly subexponential distributions. Some first properties are verified, as for example a type of multivariate analogue of Kesten's inequality, the closure property…
Twenty years ago, Werner Krandick defined two statistics on binary trees. The first one determines the number of jumps, when traversing the tree in depth-first-search, from a vertex to one closer to the root, and the second keeps tracks of…
It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…
We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…
For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…