惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
G
Google Developers Blog
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
云风的 BLOG
云风的 BLOG
小众软件
小众软件
月光博客
月光博客
Recent Announcements
Recent Announcements
人人都是产品经理
人人都是产品经理
P
Proofpoint News Feed
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
雷峰网
雷峰网
The Cloudflare Blog
博客园_首页
美团技术团队
大猫的无限游戏
大猫的无限游戏
B
Blog
IT之家
IT之家
Jina AI
Jina AI
H
Hackread – Cybersecurity News, Data Breaches, AI and More
C
Check Point Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
On Expected Face Numbers of Random Beta and Beta' Polytopes
Zakhar Kabluchko · 2021-07-14 · via math.PR updates on arXiv.org

The random beta polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1-\|x\|^2)^β$ on the $d$-dimensional unit ball, where $β>-1$ is a parameter. Similarly, the random beta' polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1+\|x\|^2)^{-β}$ on $\mathbb R^d$, where $β>\frac d2$. In a previous work [Angles of random simplices and face numbers of random polytopes, Adv. Math., 380 (2021), 107612], we established exact and explicit formulae for the expected $f$-vectors of these random polytopes in terms of certain definite integrals. In the present paper, we use purely algebraic manipulations to derive several identities for these integrals which yield alternative formulae for the expected $f$-vectors. Similar algebraic manipulations apply to Stirling numbers and yield the following identity: $$ \sum_{s=0}^k \genfrac{\{}{\}}{0pt}{}{n-s}{d-s} (d-s) \genfrac{[}{]}{0pt}{}{d-s}{k-s} = \sum_{s=0}^k (-1)^s \genfrac{\{}{\}}{0pt}{}{n-s}{d} \genfrac{[}{]}{0pt}{}{d+1}{k-s} = \sum_{s=0}^{d-k} (-1)^s \genfrac{\{}{\}}{0pt}{}{n+1}{d-s} \genfrac{[}{]}{0pt}{}{d-s}{k}. $$