Connectedness of certain random graphs
From MaRDI portal
Random graphs on \(\{\) 1,2,...\(\}\) with edge probabilities \(p_{ij}=\lambda /\max (i,j)\) are shown to have \(\lambda =1/4\) as a critical value for connectedness.
Cites work
Cited in
(32)- Unit integer quadratic binary programming
- k-connectivity in random undirected graphs
- When are random graphs connected
- A probabilistic algorithm for vertex connectivity of graphs
- Connectivity threshold for random chordal graphs
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
- Lower bounds of connectedness probability for some classes of random graphs
- MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass
- On the evolution of islands
- Connected components in random graphs with given expected degree sequences
- Random networks with sublinear preferential attachment: the giant component
- Random lifts of graphs are highly connected
- Mixed connectivity properties of random graphs and some special graphs
- Harry Kesten's work in probability theory
- Note on directed proper connection number of a random graph
- On the strength of connectedness of a random hypergraph
- Stationary random graphs on Z with prescribed iid degrees and finite mean connections
- Connectivity of soft random geometric graphs over annuli
- scientific article; zbMATH DE number 3923752 (Why is no real title available?)
- A power law for connectedness of some random graphs at the critical point
- Connectedness of graphs generated by a random d-process
- The phase transition in the uniformly grown random graph has infinite order
- Connectivity of random k-nearest-neighbour graphs
- On the connectivity of graphs generated by a sum of random mappings
- COUNTABLY APPROXIMATING FRAMES
- Correlation of Paths Between Distinct Vertices in a Randomly Oriented Graph
- CONNECTIVITY PROPERTIES OF SIERPIŃSKI RELATIVES
- The connectivity threshold for the min‐degree random graph process
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
- Connectivity of Poissonian inhomogeneous random multigraphs
- Narayana numbers in invariants for interacting particle systems of Itoh-Mallows-Shepp
- Dynamic random graphs with vertex removal
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)
