Related papers: Implicit Renewal Theory and Power Tails on Trees
We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
By using a probabilistic technique based on the exponential change of measure we find a precise tail asymptotic behavior of some perpetuities with distributions close to the Dickman distribution.
Consider a generic data unit of random size L that needs to be transmitted over a channel of unit capacity. The channel availability dynamics is modeled as an i.i.d. sequence {A, A_i},i>0 that is independent of L. During each period of time…
We consider random walks amongst random conductances in the cases where the conductances can be arbitrarily small, with a heavy-tailed distribution at 0, and where the conductances may or may not have a heavy-tailed distribution at…
We consider a one-dimensional random walk $S_n$ with i.i.d. increments with zero mean and finite variance. We study the asymptotic expansion for the tail distribution $\mathbf P(\tau_x>n)$ of the first passage times…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
Let $(\xi_k,\eta_k)_{k\in\mathbb{N}}$ be independent identically distributed random vectors with arbitrarily dependent positive components. We call a (globally) perturbed random walk a random sequence $T:=(T_k)_{k\in\mathbb{N}}$ defined by…
We consider the probability that a weighted sum of $n$ i.i.d. random variables $X_j$, $j = 1, . . ., n$, with stretched exponential tails is larger than its expectation and determine the rate of its decay, under suitable conditions on the…
Given $n$ samples of a regular discrete distribution $\pi$, we prove in this article first a serial of SLLNs results (of Dvoretzky and Erd\"{o}s' type) which implies a typical power law when $\pi$ is heavy-tailed. Constructing a (random)…
We study inverse reinforcement learning (IRL) and imitation learning (IM), the problems of recovering a reward or policy function from expert's demonstrated trajectories. We propose a new way to improve the learning process by adding a…
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…
Let $(X_n:n\geq 0)$ be a sequence of i.i.d. r.v.'s with negative mean. Set $S_0=0$ and define $S_n=X_1+... +X_n$. We propose an importance sampling algorithm to estimate the tail of $M=\max \{S_n:n\geq 0\}$ that is strongly efficient for…
This paper describes techniques for growing classification and regression trees designed to induce visually interpretable trees. This is achieved by penalizing splits that extend the subset of features used in a particular branch of the…
In recent works on the theory of machine learning, it has been observed that heavy tail properties of Stochastic Gradient Descent (SGD) can be studied in the probabilistic framework of stochastic recursions. In particular,…
We consider stochastic processes where randomly chosen particles with positive quantities x, y (> 0) interact and exchange the quantities asymmetrically by the rule x' = c{(1-a) x + b y}, y' = d{a x + (1-b) y} (x \ge y), where (0 \le) a, b…
Modern language models address complex questions through chain-of-thought (CoT) reasoning (Wei et al., 2023) and retrieval augmentation (Lewis et al., 2021), yet struggle with error propagation and knowledge integration. Tree-structured…
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
Automated mathematical reasoning is a challenging problem that requires an agent to learn algebraic patterns that contain long-range dependencies. Two particular tasks that test this type of reasoning are (1) mathematical equation…
In search of many social and economical systems, it is found that node strength distribution as well as degree distribution demonstrate the behavior of power-law with droop-head and heavy-tail. We present a new model for the growth of…