The median of the number of simple paths on three vertices in the random graph

DOI10.1134/S000143462001006XzbMath1442.05213OpenAlexW3009319869MaRDI QIDQ2191936

M. E. Zhukovskii

Publication date: 26 June 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143462001006x

zbMATH Keywords

random graphmediansPoisson limit theoremRamanujan functionsimple pathsstrictly balanced graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small subgraphs of random regular graphs
• Monotonicity of the difference between median and mean of gamma distributions and of a related Ramanujan sequence
• The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
• On Ramanujan's \(Q\)-function
• Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
• Mean, Median and Mode in Binomial Distributions
• Threshold functions for small subgraphs
• On the Medians of Gamma Distributions and an Equation of Ramanujan
• Small subgraphs and their extensions in a random distance graph
• On Ramanujan's Inequalities for exp( k )
• The Janson inequalities for general up‐sets
• Random graphs: models and asymptotic characteristics
• Distribution of small subgraphs in Buckley-Osthus random graphs
• Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
• On the Normal Approximation to the Binomial Distribution