中文
相关论文

相关论文: The external lengths in Kingman's coalescent

200 篇论文

We overview recent results on the mathematical foundations of Cutkosky rules. We emphasize that the two operations of shrinking an internal edge or putting internal lines on the mass-shell are natural operation on the cubical chain complex…

高能物理 - 理论 · 物理学 2016-07-19 Dirk Kreimer

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

组合数学 · 数学 2014-10-03 Jie Ma

Let $1\le k\le n$ and $M$ be a random $n\times n$ matrix with independent uniformly random $\{\pm 1\}$-entries. We show that there exists an absolute constant $c > 0$ such that \[\mathbf{P}[\operatorname{rank}(M)\le n-k]\le \exp(-c nk).\]

概率论 · 数学 2025-10-16 Zach Hunter , Matthew Kwan , Lisa Sauermann , Mehtaab Sawhney

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

概率论 · 数学 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

Asymptotic normality for the natural volume measure of random polytopes generated by random points distributed uniformly in a convex body in spherical or hyperbolic spaces is proved. Also the case of Hilbert geometries is treated and…

概率论 · 数学 2019-09-13 Florian Besau , Christoph Thäle

We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…

概率论 · 数学 2019-10-30 Luisa Beghin , Claudio Macci , Barbara Martinucci

Let $T_n$ be a random recursive tree with $n$ nodes. List vertices of $T_n$ in decreasing order of degree as $v^1,\ldots,v^n$, and write $d^i$ and $h^i$ for the degree of $v^i$ and the distance of $v^i$ from the root, respectively. We prove…

概率论 · 数学 2021-12-16 Laura Eslava

We consider in this paper an urn and ball problem with replacement, where balls are with different colors and are drawn uniformly from a unique urn. The numbers of balls with a given color are i.i.d. random variables with a heavy tailed…

网络与互联网体系结构 · 计算机科学 2009-06-20 Christine Fricker , Fabrice Guillemin , Philippe Robert

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…

度量几何 · 数学 2014-10-07 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

We study the asymptotic behavior of branching diffusion processes in periodic media. For a super-critical branching process, we distinguish two types of behavior for the normalized number of particles in a bounded domain, depending on the…

概率论 · 数学 2020-03-05 Pratima Hebbar , Leonid Koralov , James Nolen

I show how to run an N-time-step Markov chain simulation in a circular fashion, so that the state at time 0 follows the state at time N-1 in the same way as states at times t follow those at times t-1 for 0<t<N. This wrap-around of the…

统计计算 · 统计学 2017-11-15 Radford M. Neal

Let $X_n$ be a discrete time Markov chain with state space $S$ (countably infinite, in general) and initial probability distribution $\mu^{(0)} = (P(X_0=i_1),P(X_0=i_2),\cdots,)$. What is the probability of choosing in random some $k \in…

概率论 · 数学 2017-08-01 Nikolaos Halidias

Integer partitions have fascinated people for centuries, from Ramanujan's groundbreaking congruences to the modern theory of modular forms. This paper investigates the statistical properties of odd unimodal sequences--a natural refinement…

数论 · 数学 2026-05-11 Bing He , Guanting Liu

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

度量几何 · 数学 2018-07-09 Joscha Prochno , Christoph Thäle , Nicola Turchi

We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…

概率论 · 数学 2011-07-05 Josh Abramson , Jim Pitman

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

组合数学 · 数学 2007-05-23 Nicholas Pippenger

We study uniform spanning trees (USTs) on the cylindrical graph $G = C_n \times P_m$. Fix a trunk $L$ as a designated simple path in the tree connecting the two boundary rings of the cylinder. We prove an exponential tail bound for the…

组合数学 · 数学 2026-02-09 Nikita Kalinin , Denis Rakhmankin

In this paper, we analyze the stochastic properties of some large size (area) polyominoe's perimeter such that the directed column-convex polyomino, the column-convex polyomino, the directed diagonally-convex polyomino, the staircase (or…

概率论 · 数学 2020-01-07 Guy Louchard

We consider the asymptotics of the invariant measure for the process of the empirical spatial distribution of $N$ coupled Markov chains in the limit of a large number of chains. Each chain reflects the stochastic evolution of one particle.…

概率论 · 数学 2013-01-25 Vivek S. Borkar , Rajesh Sundaresan

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

数据结构与算法 · 计算机科学 2016-12-28 Colin Cooper , Robert Elsasser , Hirotaka Ono , Tomasz Radzik
‹ 上一页 1 8 9 10 下一页 ›