Results 41 to 50 of about 1,308 (81)
Forum of Mathematics, SigmaWe 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
Zagreb connection indices on polyomino chains and random polyomino chains
Open MathematicsIn 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
, 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, SigmaWe 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
The CLT Analogue for Cyclic Urns
, 2015 A cyclic urn is an urn model for balls of types $0,\ldots,m-1$ where in each draw the ball drawn, say of type $j$, is returned to the urn together with a new ball of type $j+1 \mod m$. The case $m=2$ is the well-known Friedman urn. The composition vector,
Müller, Noela S., Neininger, Ralph
core +1 more source
On a generalization of derangement polynomials and numbers
Demonstratio MathematicaIn T. Kim, D. S. Kim, and D. V. Dolgy, Probabilistic derangement numbers and polynomials, Math. Comput. Model. Dyn. Syst. 31 (2025), no. 1, 2529188, Kim-Kim defined the probabilistic derangement polynomials and numbers and found some properties of those ...
Yun Sang Jo, Park Jin-Woo
doaj +1 more source
The rank of random regular digraphs of constant degree
, 2018 Let $d$ be a fixed large integer. For any $n$ larger than $d$, let $A_n$ be the adjacency matrix of the random directed $d$-regular graph on $n$ vertices, with the uniform distribution. We show that $A_n$ has rank at least $n-1$ with probability going to
Litvak, Alexander +4 more
core +2 more sources
Beat the dealer in Holland Casino's Black Jack [PDF]
Gambling;68U20;93E05;Black Jack ...
Genugten, B.B. van der
core +1 more source
On the First Entrance Time Distribution of the M/D/i Queue: A Combinatorial Approach [PDF]
AMS classifications: 60C05; 60K25; 90B06; 90B22M/D/1;delivery;first entrance times;lattice path ...
Jansen, J.B.
core +1 more source
Irreducible compositions and the first return to the origin of a random walk
, 2004 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'$.
Bender, Edward A. +3 more
core +2 more sources