Bernoulli trials of fixed parity, random and randomly oriented graphs

DOI10.1007/s00373-015-1650-2zbMath1342.60009arXiv1312.6524OpenAlexW2132418352MaRDI QIDQ2631092

Christos Pelekis

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.6524

zbMATH Keywords

random graphsBernoulli trialscombinatorial probabilityrandomly oriented graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (1)

On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

Cites Work

• Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
• The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
• Stochastic domination and weak convergence of conditioned Bernoulli random vectors
• Network Coloring and Colored Coin Games
• A Counter-Intuitive Correlation in a Random Tournament
• On the Distribution of the Number of Successes in Independent Trials
• Mean, Median and Mode in Binomial Distributions
• General percolation and random graphs
• An orientation theorem with parity conditions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bernoulli trials of fixed parity, random and randomly oriented graphs