scientific article; zbMATH DE number 7731163

MaRDI QIDQ6176531zbMATH OpenFDO

Authors Lorenzo Federico

Publication date 23 August 2023

Full work available at URL https://arxiv.org/abs/2001.05905, http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p076.pdf

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4099367
• On the almost eigenvectors of random regular graphs
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• scientific article; zbMATH DE number 944215
• Random regular graphs of high degree
• Regular subgraphs of random graphs
• Randomly 2C_n graphs
• scientific article; zbMATH DE number 3869382
• scientific article; zbMATH DE number 1342092

Cites work

• A critical point for random graphs with a given degree sequence
• Component evolution in random intersection graphs
• Component structure of the configuration model: barely supercritical case
• Counting connected graphs inside-out
• Critical window for connectivity in the configuration model
• Critical window for the configuration model: finite third moment degrees
• Heavy-tailed configuration models at criticality
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 747040 (Why is no real title available?)
• Limit laws for self-loops and multiple edges in the configuration model
• Random graphs and complex networks. Volume 1
• Random graphs.
• The asymptotic connectivity of labelled regular graphs
• The largest component in a subcritical random graph with a power law degree distribution
• The phase transition in inhomogeneous random graphs
• The probability of a large cluster in supercritical Bernoulli perlocation
• The probability that a random multigraph is simple
• The second largest component in the supercritical 2D Hamming graph

Cited in

(6)

• On giant components and treewidth in the layers model
• Exactly solvable random graph ensemble with extensively many short cycles
• Building a random network with a given expected giant component
• Universal `winner-takes-it-all' phenomenon in scale-free random graphs
• Mixing of fast random walks on dynamic random permutations
• Analytical results for the distribution of first return times of non-backtracking random walks on configuration model networks

This page was built for publication:

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