Results 31 to 40 of about 90 (88)

Two-Point Concentration of the Independence Number of the Random Graph

Forum of Mathematics, Sigma
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in ...
Tom Bohman, Jakob Hofstad
doaj   +1 more source

Games of chance with multiple objectives [PDF]

Probabilistic games, Majorization, Schur convexity, Coupon collector, 91A60, 60C05, 26D15, 26B25,
Paul Campbell
core   +1 more source

On occurrence of subpattern and method of gambling teams [PDF]

Pattern, Gambling teams, Waiting times, Markov chains, Martingales, Test of randomness, Primary 60C05, Primary 60G42, Secondary 60G40, Secondary 62E17,
Vladimir Pozdnyakov
core   +1 more source

Zagreb connection indices on polyomino chains and random polyomino chains

Open Mathematics
In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article
Sigarreta Saylé, Cruz-Suárez Hugo
doaj   +1 more source

A logical limit law for $231$-avoiding permutations [PDF]

Discrete Mathematics & Theoretical Computer Science
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding permutation of size $n$
Michael Albert, Mathilde Bouvel, Valentin Féray, Marc Noy   +3 more
doaj   +1 more source

On the First Entrance Time Distribution of the M/D/i Queue: A Combinatorial Approach [PDF]

, 1996
AMS classifications: 60C05; 60K25; 90B06 ...
Jansen, J.B.
core  

Measurable Vizing’s theorem

Forum of Mathematics, Sigma
We prove a full measurable version of Vizing’s theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal {G}$ of degree uniformly bounded by $\Delta \in \mathbb {N}$ defined on a standard probability space
Jan Grebík
doaj   +1 more source

The inner site-perimeter of compositions [PDF]

, 2020
Compositions of n are finite sequences of positive integers (σi)ki=1 such that                                      σ1 + σ2 + , , , + σk = n.The σ's are called parts.
Brennan, Charlotte, Knopfmacher, Arnold, Blecher, Aubrey   +2 more
core  

An open toss problem

, 1993
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 3, Page 621-623, 1993.
Prem N. Bajaj, G. R. Mendieta
wiley   +1 more source

Random Fibonacci Words via Clone Schur Functions

Forum of Mathematics, Sigma
We investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj   +1 more source