放气
发表于 2025-3-23 10:45:47
Random Minimax Game Trees,ependent identically distributed random variables with the edges. The value of a leaf is the sum of the edge values on the path to the root. The value of each internal node is obtained at alternating levels by taking the minimum or maximum value of the values of the children. We are interested in th
Hiatus
发表于 2025-3-23 17:44:10
http://reply.papertrans.cn/83/8211/821037/821037_12.png
forbid
发表于 2025-3-23 20:02:36
http://reply.papertrans.cn/83/8211/821037/821037_13.png
Peculate
发表于 2025-3-23 22:17:30
http://reply.papertrans.cn/83/8211/821037/821037_14.png
Visual-Acuity
发表于 2025-3-24 02:41:14
Intersections and Limits of Regenerative Sets,following independent exponentially distributed waiting times, but only at those times belonging to . Early uses of the term ‘regenerative set’ appear in and — and, earlier, Tackás used ‘regeneration point’ for a member of a certain type of regenera
额外的事
发表于 2025-3-24 08:44:06
Random Processes of the Form ,, = ,,,, + ,,(mod ,)where ,, takes on a Single Value, l/2 each. For values of . satisfying certain constraints imposed by . . and . ., . . gets close to uniformly distributed on Z/.Z for large enough . This paper explores how large . needs to be as a function of .. Adapting techniques used by Chung, Diaconis, and Graham and techniques previously devel
用不完
发表于 2025-3-24 14:16:06
http://reply.papertrans.cn/83/8211/821037/821037_17.png
NICHE
发表于 2025-3-24 16:08:35
How Fast and where does a Random Walker Move on a Random Tree?,er simple random walk on the family tree . of a supercritical Galton-Watson branching process. First we calculate the speed (i.e., rate of escape) of the walk; the answer is simple, yet surprising. Then we show that the resulting harmonic measure has a.s. strictly smaller dimension than that of the
外露
发表于 2025-3-24 19:28:37
Energy, and Intersections of Markov Chains,tion techniques to construct certain measures of finite energy. The present paper aims to make these techniques more accessible, by treating an analogous but simpler problem. Upper bounds will be obtained on intersection probabilities for discrete time Markov chains. This will be applied to obtain a
Yourself
发表于 2025-3-24 23:36:25
http://reply.papertrans.cn/83/8211/821037/821037_20.png