相关论文: The Probability of a Run

In this note we give a detailed proof of a theorem of Aubin.

We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…

We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of…

We prove Union-Closed sets conjecture.

In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…

Let $R$ be a finite ring and $r \in R$. The aim of this paper is to study the probability that the commutator of a randomly chosen pair of elements of $R$ equals $r$.

In Major League Baseball, strategy and planning are major factors in determining the outcome of a game. Previous studies have aided this by building machine learning models for predicting the winning team of any given game. We extend this…

We prove the validity of the strong version of the union of uniform closed balls conjecture, formulated in 2011 as [4, Conjecture 2.5], in the plane.

We use well-known limit theorems in probability theory to derive a Wallis-type product formula for the gamma function. Our result immediately provides a probabilistic proof of Wallis's product formula for $\pi$, as well as the duplication…

A consistently specified halting function may be computed.

From a mathematical and statistical point of view, a segment of a DNA strand can be viewed as a sequence of four-state (A, C, G, T) trials. We consider distributions of runs and patterns related to run lengths of multi-state sequences,…

We present a new, elementary, dynamical proof of the prime number theorem.

We prove a curious identity for the Bernoulli numbers.

We study the distributions of waiting times in variations of the $q$-sooner and later waiting time problem. One variation imposes length and frequency quotas on the runs of successes and failures. Another case considers binary trials for…

A maximal repetition, or run, in a string, is a maximal periodic substring whose smallest period is at most half the length of the substring. In this paper, we consider runs that correspond to a path on a trie, or in other words, on a…

We will prove the Brannan conjecture for particular values of the parameter. The basic tool of the study is an integral representation published in a recent work [3].

A new proof is given for the formula for the expected return time of a random walk on a graph. This proof makes use of known relationships between electric resistance and random walks.

Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

This paper presents a wp-style calculus for obtaining bounds on the expected run-time of probabilistic programs. Its application includes determining the (possibly infinite) expected termination time of a probabilistic program and proving…