Connectedness of certain random graphs

DOI10.1007/BF02764896MaRDI QIDQ810056zbMATH OpenFDO

Authors Larry Shepp

Publication date 1989

Published in Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

critical value for connectednessinfinite random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3116942 (Why is no real title available?)
• scientific article; zbMATH DE number 3911357 (Why is no real title available?)
• Covering the circle with random arcs
• On the evolution of islands
• When are random graphs connected

Cited in

(30)

• Random networks with sublinear preferential attachment: the giant component
• On the evolution of islands
• COUNTABLY APPROXIMATING FRAMES
• Connectivity of Poissonian inhomogeneous random multigraphs
• Connectivity of soft random geometric graphs over annuli
• Lower bounds of connectedness probability for some classes of random graphs
• Random lifts of graphs are highly connected
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
• Correlation of Paths Between Distinct Vertices in a Randomly Oriented Graph
• Connected components in random graphs with given expected degree sequences
• Unit integer quadratic binary programming
• Note on directed proper connection number of a random graph
• Stationary random graphs on Z with prescribed iid degrees and finite mean connections
• k-connectivity in random undirected graphs
• Connectedness of graphs generated by a random d-process
• MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
• On the connectivity of graphs generated by a sum of random mappings
• Mixed connectivity properties of random graphs and some special graphs
• Harry Kesten's work in probability theory
• The connectivity threshold for the min‐degree random graph process
• scientific article; zbMATH DE number 3923752 (Why is no real title available?)
• CONNECTIVITY PROPERTIES OF SIERPIŃSKI RELATIVES
• A power law for connectedness of some random graphs at the critical point
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• Connectivity threshold for random chordal graphs
• Connectivity of random k-nearest-neighbour graphs
• On the strength of connectedness of a random hypergraph
• When are random graphs connected
• A probabilistic algorithm for vertex connectivity of graphs
• The phase transition in the uniformly grown random graph has infinite order

This page was built for publication: Connectedness of certain random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810056)