中文
相关论文

相关论文: Compatible sequences and a slow Winkler percolatio…

200 篇论文

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

组合数学 · 数学 2024-08-07 Anant Godbole , Hannah Swickheimer

Let us draw a graph R on {0,1,...,n-1} by having an edge {i,j} with probability p_(|i-j|), where sum_i p_i is finite and let M_n=(n,<,R). For a first order sentence psi let a^n_psi be the probability of ``M_n satisfies psi''. We prove that…

逻辑 · 数学 2009-09-25 Saharon Shelah

Sequential likelihood ratio testing is found to be most powerful in sequential studies with early stopping rules when grouped data come from the one-parameter exponential family. First, to obtain this elusive result, the probability measure…

统计方法学 · 统计学 2021-01-28 Sergey Tarima , Nancy Flournoy

This letter concerns the reliability of coupled oscillator networks in response to fluctuating inputs. Reliability means that (following a transient) an input elicits identical responses upon repeated presentations, regardless of the…

混沌动力学 · 物理学 2007-05-23 Kevin K. Lin , Eric Shea-Brown , Lai-Sang Young

Consider Bernoulli(1/2) percolation on $\Z^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make the…

概率论 · 数学 2009-09-08 Adam Timar

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

数论 · 数学 2025-06-17 Frits Beukers

Let $n = b_1 + ... + b_k = b_1' + \cdot + b_k'$ be a pair of compositions of $n$ into $k$ positive parts. We say this pair is {\em irreducible} if there is no positive $j < k$ for which $b_1 + ... b_j = b_1' + ... b_j'$. The probability…

组合数学 · 数学 2007-05-23 Edward A. Bender , Gregory F. Lawler , Robin Pemantle , Herbert S. Wilf

We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…

概率论 · 数学 2008-07-11 Geoffrey R. Grimmett , Thomas M. Liggett , Thomas Richthammer

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

组合数学 · 数学 2022-11-07 Nathan Fox

We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…

统计理论 · 数学 2025-04-29 Shubhada Agrawal , Aaditya Ramdas

In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560. It…

概率论 · 数学 2010-03-01 Augusto Teixeira

We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…

概率论 · 数学 2015-01-13 S. Friedli , D. Ioffe , Y. Velenik

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

计算复杂性 · 计算机科学 2010-03-08 Deepak Ponvel Chermakani

We prove a strong approximation result for the empirical process associated to a stationary sequence of real-valued random variables, under dependence conditions involving only indicators of half lines. This strong approximation result also…

概率论 · 数学 2013-10-22 Jérôme Dedecker , Florence Merlevède , Emmanuel Rio

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

统计力学 · 物理学 2013-04-04 Stefan Nowak , Joachim Krug

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 finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…

数论 · 数学 2011-07-20 Itai Benjamini , Boris Solomyak

We consider the linear combinations of elements of two sequences: the first one a priory given nonnegative sequence and the second random sequence from the unit interval. We investigate the expected value of the smallest natural number such…

经典分析与常微分方程 · 数学 2013-04-11 Predrag M. Rajkovic , Sladjana D. Marinkovic , Miomir S. Stankovic

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…