Chain Lengths in Certain Random Directed Graphs

DOI10.1002/rsa.3240030304zbMath0763.05091OpenAlexW2108763178MaRDI QIDQ4014636

Charles M. Newman

Publication date: 18 October 1992

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240030304

zbMATH Keywords

chain lengthsrandom directed graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Limiting properties of random graph models with vertex and edge weights ⋮ Convergence of directed random graphs to the Poisson-weighted infinite tree ⋮ A Probabilistic Analysis of a String Editing Problem and its Variations ⋮ Probabilistic and analytical properties of the last passage percolation constant in a weighted random directed graph ⋮ Limit theorems for a random directed slab graph ⋮ Long-range last-passage percolation on the line ⋮ Unnamed Item ⋮ Random graph orders do not satisfy a 0–1 law ⋮ Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges ⋮ Parallel execution of schedules with random dependency graph ⋮ Barak-Erdős graphs and the infinite-bin model ⋮ Two-sided infinite-bin models and analyticity for Barak-Erdős graphs ⋮ On the length of the shortest path in a sparse Barak-Erdős graph ⋮ On tail distribution of interpost distance

This page was built for publication: Chain Lengths in Certain Random Directed Graphs