中文
相关论文

相关论文: Cyclic behavior of maxima in a hierarchical summat…

200 篇论文

In a recent author's work the cyclic behavior of maxima in a hierarchical summation scheme was discovered. In the present note we show how the same phenomenon appears in the scheme of conventional summation: the distribution of maximum of…

概率论 · 数学 2015-02-24 M. A. Lifshits

Consider a binary tree, to the vertices of which are assigned independent Bernoulli random variables with mean $p\leq1/2$. How many of these Bernoullis one must look at in order to find a path of length $n$ from the root which maximizes, up…

概率论 · 数学 2009-09-02 Robin Pemantle

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…

最优化与控制 · 数学 2019-10-16 Divya Padmanabhan , Karthik Natarajan

We show that the maximal value in a size $n$ sample from GEM$(\theta)$ distribution is distributed as a sum of independent geometric random variables. This implies that the maximal value grows as $\theta\log(n)$ as $n\to\infty$. For the…

概率论 · 数学 2016-09-07 Jim Pitman , Yuri Yakubovich

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

历史与综述 · 数学 2018-08-27 Steven R. Finch

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

统计方法学 · 统计学 2009-04-06 Christopher S. Withers , Saralees Nadarajah

For a graph $G$, let $\lambda_1(G)$ and $\lambda_2(G)$ denote the largest and the second largest adjacency eigenvalue of $G$. The sum $\lambda_1(G) + \lambda_2(G)$ is called the \emph{spectral sum} of $G$. We investigate the spectral sum of…

组合数学 · 数学 2026-01-16 Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Hanmeng Zhan

We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…

概率论 · 数学 2017-09-25 Antonio Auffinger , Dylan Cable

The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…

统计理论 · 数学 2018-02-26 Francesca Fortunato

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…

统计力学 · 物理学 2007-05-23 T. Antal , P. L. Krapivsky

Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…

数论 · 数学 2022-10-13 Vitalii V. Iudelevich

We introduce a new model for sums of exchangeable binary random variables. The proposed distribution is an approximation to the exact distributional form, and relies on the theory of completely monotone functions and the Laplace transform…

统计方法学 · 统计学 2020-11-18 Ryan Elmore

A Bernoulli random walk is a random trajectory starting from 0 and having i.i.d. increments, each of them being $+1$ or -1, equally likely. The other families cited in the title are Bernoulli random walks under various conditionings. A peak…

概率论 · 数学 2007-05-23 Jean-Maxime Labarbe , Jean-François Marckert

We consider a one-dimensional discrete symmetric random walk with a reflecting boundary at the origin. Generating functions are found for the 2- dimensional probability distribution P{Sn = x,max1?j?n Sn = a} of being at position x after n…

概率论 · 数学 2013-05-27 Jerome K. Percus , Ora E. Percus

Consider a rooted N-ary tree. For every vertex of this tree, we atttach an i.i.d. Bernoulli random variable. A path is called open if all the random variables that are assigned on the path are 1. We consider limiting behaviors for the…

概率论 · 数学 2022-12-13 Tianxiang Ren , Jinwen Wu

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…

概率论 · 数学 2016-12-28 Erich Baur

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

组合数学 · 数学 2012-10-11 Xiu-Mei Zhang , Xiao-Dong Zhang , Daniel Gray , Hua Wang

This paper explores the joint behaviour of the summands of a random walk when their mean value goes to infinity as its length increases. It is proved that all the summands must share the same value, which extends previous results in the…

统计理论 · 数学 2012-05-30 Michel Broniatowski , Zhansheng Cao

Sequential ballistic deposition (BD) with next-nearest-neighbor (NNN) interactions in a N-column box is viewed a time-ordered product of N\times N-matrices consisting of a single sl_2-block which has a random position along the diagonal. We…

数学物理 · 物理学 2012-07-24 A. Gorsky , S. Nechaev , R. Santachiara , G. Schehr

For a family of probability functions (or a probability kernel), cross modality occurs when every likelihood maximum matches a mode of the distribution. This implies existence of simultaneous maxima on the modal ridge of the family. The…

概率论 · 数学 2024-08-14 Alexander Gnedin
‹ 上一页 1 2 3 10 下一页 ›