Results 31 to 40 of about 1,308 (81)
BROOKS’ THEOREM FOR MEASURABLE COLORINGS
Forum of Mathematics, Sigma, 2016 We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $
CLINTON T. CONLEY +2 more
doaj +1 more source
On the local time density of the reflecting Brownian bridge
International Journal of Stochastic Analysis, Volume 13, Issue 2, Page 125-136, 2000., 2000 Expressions for the multi‐dimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac′s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings.
Bernhard Gittenberger, Guy Louchard
wiley +1 more source
Involution factorizations of Ewens random permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceAn involution is a bijection that is its own inverse. Given a permutation $σ$ of $[n],$ let $\mathsf{invol}(σ)$ denote the number of ways $σ$ can be expressed as a composition of two involutions of $[n].$ We prove that the statistic $\mathsf{invol}$ is ...
Charles Burnette
doaj +1 more source
Riffle shuffles with biased cuts [PDF]
, 2011 The well-known Gilbert-Shannon-Reeds model for riffle shuffles assumes that the cards are initially cut 'about in half' and then riffled together. We analyze a natural variant where the initial cut is biased. Extending results of Fulman (1998), we show a
Assaf, Sami +2 more
core +6 more sources
Two-Point Concentration of the Independence Number of the Random Graph
Forum of Mathematics, SigmaWe 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
YANG–BAXTER FIELD FOR SPIN HALL–LITTLEWOOD SYMMETRIC FUNCTIONS
Forum of Mathematics, Sigma, 2019 Employing bijectivization of summation identities, we introduce local stochastic moves based on the Yang–Baxter equation for $U_{q}(\widehat{\mathfrak{sl}_{2}})$.
ALEXEY BUFETOV, LEONID PETROV
doaj +1 more source
High-Precision Entropy Values for Spanning Trees in Lattices
, 2003 Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the ...
Ball K +11 more
core +1 more source
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $\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 distinct ...
Anant Godbole, Hannah Swickheimer
doaj +1 more source
, 2018 Let $d\in \mathbb{N}$ and let $\gamma_i\in [0,\infty)$, $x_i\in (0,1)$ be such that $\sum_{i=1}^{d+1} \gamma_i = M\in (0,\infty)$ and $\sum_{i=1}^{d+1} x_i = 1$.
Ouimet, Frédéric
core +1 more source
A logical limit law for $231$-avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe 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 +3 more
doaj +1 more source