The Maximum Degree of the Barabási–Albert Random Tree
From MaRDI portal
Publication:4680572
DOI10.1017/S0963548304006133zbMath1078.05077OpenAlexW2127189689MaRDI QIDQ4680572
Publication date: 7 June 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548304006133
Related Items
Scale-free property for degrees and weights in an \(N\)-interactions random graph model ⋮ Structure properties of a doubly-stochastic process on a network ⋮ Distribution of tree parameters by martingale approach ⋮ \( \gamma \)-variable first-order logic of preferential attachment random graphs ⋮ On spectra of spectra ⋮ Correlated randomly growing graphs ⋮ Phase Changes in the Topological Indices of Scale-Free Trees ⋮ Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ Large communities in a scale-free network ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ On a 2-parameter class of scale free random graphs ⋮ Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Asymptotic results of a multiple-entry reinforcement process ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ On several properties of a class of hybrid recursive trees ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ Degree asymptotics with rates for preferential attachment random graphs ⋮ An estimate of the probability of localisation of the diameter of a random scale-free graph ⋮ The height of increasing trees ⋮ Scaling limits and influence of the seed graph in preferential attachment trees ⋮ Growth of preferential attachment random graphs via continuous-time branching processes ⋮ Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size ⋮ General results on preferential attachment and clustering coefficient ⋮ Synchronization in networks with strongly delayed couplings ⋮ Depth of vertices with high degree in random recursive trees ⋮ Diameters in preferential attachment models ⋮ The clustering coefficient of a scale-free random graph ⋮ Recognizing linear structure in noisy matrices ⋮ Spectra of large random trees ⋮ On martingale tail sums in affine two-color urn models with multiple drawings ⋮ Partial mean field limits in heterogeneous networks ⋮ A new class of scale free random graphs ⋮ Random Networks with Preferential Growth and Vertex Death ⋮ Further properties of a random graph with duplications and deletions ⋮ PenPC : A two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs ⋮ Persistence of hubs in growing random networks ⋮ A phase transition for preferential attachment models with additive fitness ⋮ Geometry of weighted recursive and affine preferential attachment trees ⋮ Persistence of Network Synchronization under Nonidentical Coupling Functions ⋮ Inference for the degree distributions of preferential attachment networks with zero-degree nodes ⋮ TheN-star network evolution model ⋮ Sublinear preferential attachment combined with a growing number of choices ⋮ Joint degree distributions of preferential attachment random graphs ⋮ A random graph of moderate density ⋮ Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution
