scientific article
From MaRDI portal
Publication:2786365
zbMath1223.05002MaRDI QIDQ2786365
Publication date: 22 September 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Vertex degrees (05C07)
Related Items
Stochastic SIR epidemics in a population with households and schools ⋮ Exceptional times of the critical dynamical Erdős-Rényi graph ⋮ Random graphs associated to some discrete and continuous time preferential attachment models ⋮ A note on jointly modeling edges and node attributes of a network ⋮ A functional central limit theorem for SI processes on configuration model graphs ⋮ Mean Field at Distance One ⋮ Cutoff on all Ramanujan graphs ⋮ Typical distances in the directed configuration model ⋮ Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ Phase transitions for chase-escape models on Poisson-Gilbert graphs ⋮ Smoothed Analysis on Connected Graphs ⋮ Existence of absolutely continuous spectrum for Galton-Watson random trees ⋮ Mean quantum percolation ⋮ The asymptotic distribution of cluster sizes for supercritical percolation on random split trees ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ Shape Measures of Random Increasing k-trees ⋮ Effect of scale on long-range random graphs and chromosomal inversions ⋮ Social network formation and strategic interaction in large networks ⋮ Improved mixing rates of directed cycles by added connection ⋮ Risk contagion under regular variation and asymptotic tail independence ⋮ Critical random graphs and the differential equations technique ⋮ Random walks on the random graph ⋮ Weakly interacting particle systems on inhomogeneous random graphs ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Low eigenvalues of Laplacian matrices of large random graphs ⋮ Contact process under renewals I ⋮ Heavy-tailed random walks, buffered queues and hidden large deviations ⋮ Asymptotic normality of degree counts in a preferential attachment model ⋮ Degree growth rates and index estimation in a directed preferential attachment model ⋮ Capacity of an associative memory model on random graph architectures ⋮ Phase transition for the interchange and quantum Heisenberg models on the Hamming graph ⋮ Stochastic block model in a new critical regime and the interacting multiplicative coalescent ⋮ Finite-Time Influence Systems and the Wisdom of Crowd Effect ⋮ Existence of a phase transition of the interchange process on the Hamming graph ⋮ Comparing mixing times on sparse random graphs ⋮ On the Spread of Random Graphs ⋮ Consensus and synchronization problems on small-world networks ⋮ On a Minimum Distance Procedure for Threshold Selection in Tail Analysis