中文
相关论文

相关论文: On the Spread of Random Interleaver

200 篇论文

We consider any fixed $d\in\mathbb{Z}_{>0}$ number of second class particles in the asymmetric simple exclusion process (ASEP), constructed via a basic coupling of two ASEPs. We give the joint distribution of the positions of the second…

概率论 · 数学 2026-04-21 Daniel Adams , Márton Balázs , Jessica Jay

This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the…

人工智能 · 计算机科学 2015-03-19 Wolfgang Gatterbauer , Dan Suciu

We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities $a/n$ and $b/n$ for inter- and intra-block edge probabilities, respectively. It was recently shown that one can do better…

概率论 · 数学 2016-09-28 Elchanan Mossel , Joe Neeman , Allan Sly

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength…

信息论 · 计算机科学 2018-01-12 Oliver Kosut , Joerg Kliewer

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

组合数学 · 数学 2007-05-23 P. J. Forrester

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\left\{1, \ldots, n\right\}$ with $m=m(n)$ edges. We show that in the sparse regime, when $\limsup_{n \to \infty} m/n<1$, with high…

组合数学 · 数学 2020-10-29 Mihyun Kang , Michael Missethan

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

概率论 · 数学 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

We study the problem of estimating multivariate log-concave probability density functions. We prove the first sample complexity upper bound for learning log-concave densities on $\mathbb{R}^d$, for all $d \geq 1$. Prior to our work, no…

机器学习 · 计算机科学 2017-06-07 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

概率论 · 数学 2021-07-30 Jieliang Hong

In critical percolation models, in a large cube there will typically be more than one cluster of comparable diameter. In 2D, the probability of $k>>1$ spanning clusters is of the order $e^{-\alpha k^{2}}$. In dimensions d>6, when $\eta = 0$…

凝聚态物理 · 物理学 2016-08-31 Michael Aizenman

We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of…

概率论 · 数学 2021-11-03 Alain-Sol Sznitman

The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…

信息论 · 计算机科学 2016-04-18 Dayu Huang , Sean Meyn

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

统计力学 · 物理学 2007-05-23 Rajan M. Lukose , Lada A. Adamic

We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random…

度量几何 · 数学 2024-06-06 Andrii Arman , Alexander E. Litvak

We derive the most probable distribution of resources for a simple society. We find that a probabilistic analysis forbids both too much and too less equity, and selects instead a minimally ordered state. We give the detailed calculations…

统计力学 · 物理学 2008-12-10 Daniel O. Badagnani

We study sums of independent random variables that take values $0$, $1/2$, or $1$. We show that the probability mass function of the sum splits into two interleaved parts: one supported on the integers and the other supported on the…

概率论 · 数学 2026-03-11 Mark Broadie , Ina Petkova

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…

组合数学 · 数学 2007-05-23 Tao Jiang , Dhruv Mubayi , Aditya Shastri , Douglas B. West

Results from Direct Numerical Simulations of particle relative dispersion in three dimensional homogeneous and isotropic turbulence at Reynolds number $Re_\lambda \sim 300$ are presented. We study point-like passive tracers and heavy…

流体动力学 · 物理学 2015-02-19 L. Biferale , A. S. Lanotte , R. Scatamacchia , F. Toschi

When numbers are added in base $b$ in the usual way, carries occur. If two random, independent 1-digit numbers are added, then the probability of a carry is $\frac{b-1}{2b}$. Other choices of digits lead to less carries. In particular, if…

组合数学 · 数学 2012-09-07 Noga Alon

Let $n$ and $t$ be positive integers with $t<n$, and let $q$ be a prime power. A partial $(t-1)$-spread of ${\rm PG}(n-1,q)$ is a set of $(t-1)$-dimensional subspaces of ${\rm PG}(n-1,q)$ that are pairwise disjoint. Let $r\equiv n\pmod{t}$…

组合数学 · 数学 2017-07-05 Esmeralda Nastase , Papa Sissokho