Post 9tSnY7FFiGNGLF5bRw by ccppurcell@mathstodon.xyz
 (DIR) More posts by ccppurcell@mathstodon.xyz
 (DIR) Post #9tSnY7FFiGNGLF5bRw by ccppurcell@mathstodon.xyz
       2020-03-28T07:53:49Z
       
       0 likes, 0 repeats
       
       Sorry if this turns out to be a silly question, but I couldn't find (or think of) an answer.Suppose I add edges at random to a set of vertices until I have a connected graph. What is the expected number of cut vertices?
       
 (DIR) Post #9tSnY7gu3SUZj01gY4 by nick@status.pech.tech
       2020-03-28T10:45:07.900Z
       
       0 likes, 0 repeats
       
       @ccppurcell@mathstodon.xyz I can't do a formal answer sadly, just an engineer after all, but I fiddled around by letting a program insert random edges into an adjacency matrix of a non-directional graph until algebraic connectivity is reached, then counting cut vertices.Of course this is all over the place and doesn't say very much about the problem, probably.Fun nonsense excercise tough.