English
Related papers

Related papers: Maximums on Trees

200 papers

We use the recently developed massive spinor-helicity formalism [1] of Arkani- Hamed et al. to propose a new class of recursion relations for tree-level amplitudes in gauge theories. These relations are based on a combined complex…

High Energy Physics - Theory · Physics 2021-05-13 Sourav Ballav , Arkajyoti Manna

We consider random energy landscapes constructed from d-dimensional lattices or trees. The distribution of the number of local minima in such landscapes follows a large deviation principle and we derive the associated law exactly for…

Statistical Mechanics · Physics 2009-11-11 Satya N. Majumdar , Olivier C. Martin

For a particular case of a branching random walk with lattice support, namely the Yule branching random walk, we prove that the distribution of the centred maximum oscillates around a distribution corresponding to a critical travelling wave…

Probability · Mathematics 2016-11-08 Pierre-Antoine Corre

We derive the sharp return-probability asymptotic for the switch--walk--switch lamplighter walk with lamp group $\mathbb Z_2$ over the infinite $d$-regular tree: \[ p_{2n}(e,e) = \rho_d^{2n} \exp\left[ -\left(\pi^2(\log(d-1))^2+o(1)\right)…

Probability · Mathematics 2026-05-22 Chenyang An , Minghao Pan

For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…

Combinatorics · Mathematics 2018-08-09 Louigi Addario-Berry , Laura Eslava

We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…

Probability · Mathematics 2016-12-28 Erich Baur

We study the minimum spanning tree problem on the complete graph $K_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent copy of the random variable $U^\gamma$ where $\gamma\leq 1$ and $U$ is the uniform…

Combinatorics · Mathematics 2021-06-01 Alan Frieze , Tomasz Tkocz

This paper is concerned with the approximation of high-dimensional functions in a statistical learning setting, by empirical risk minimization over model classes of functions in tree-based tensor format. These are particular classes of…

Machine Learning · Statistics 2019-01-15 Erwan Grelier , Anthony Nouy , Mathilde Chevreuil

We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is of exponential form $e^{-\mu h}$. Defining the total weight for such trees of fixed size to be $Z^{(\mu)}_N$,…

Probability · Mathematics 2023-04-05 Bergfinnur Durhuus , Meltem Ünel

We consider branching random walk in random environment (BRWRE) and prove the existence of deterministic subsequences along which their maximum, centered at its mean, is tight. This partially answers an open question in arXiv:1711.00852.…

Probability · Mathematics 2022-05-25 Xaver Kriechbaum

We study a natural analogue of Ulam's problem for random rooted trees distributed according to a Plancherel-type measure. This probability measure is closely related to the classical Plancherel measure on integer partitions. For a…

Probability · Mathematics 2026-04-29 Shengjun Zhang

We consider the equation R(n)=Q(n)+M(n) R(n-1), with random non-i.i.d. coefficients (Q(n),M(n)), and show that the distribution tails of the stationary solution to this equation are regularly varying at infinity.

Probability · Mathematics 2010-06-15 A. P. Ghosh , D. Hay , V. Hirpara , R. Rastegar , A. Roitershtein , A. Schulteis , J. Suh

It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…

Probability · Mathematics 2024-05-16 Shuma Kumamoto , Shuji Kijima , Tomoyuki Shirai

The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…

Probability · Mathematics 2018-10-18 Andrea Collevecchio , Daniel Kious , Vladas Sidoravicius

Let $\{Z_n\}_{n\geq 0 }$ be a critical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesgue measure on $\mathbb{R}^d$. Denote by…

Probability · Mathematics 2026-01-28 Shuxiong Zhang

We consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…

Probability · Mathematics 2025-01-22 Peter Müller , Jakob Stern

We prove large deviation results for the position of the rightmost particle, denoted by $M_n$, in a one-dimensional branching random walk in a case when Cram\'er's condition is not satisfied. More precisely we consider step size…

Probability · Mathematics 2020-06-17 Piotr Dyszewski , Nina Gantert , Thomas Höfelsauer

The paper deals with fluctuations of Kendall random walks, which are extremal Markov chains and iterated integral transforms with the Williamson kernel $\Psi(t) = \left(1-|t|^{\alpha}\right)_+$, $\alpha>0$. We obtain the joint distribution…

Probability · Mathematics 2022-05-19 Barbara Jasiulis-Gołdyn , Edward Omey , Mateusz Staniak

We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov