The degree sequence of a scale-free random graph process

From MaRDI portal

Publication:2725033

Jump to:navigation, search

DOI10.1002/rsa.1009zbMath0985.05047OpenAlexW2056380633WikidataQ56170570 ScholiaQ56170570MaRDI QIDQ2725033

Béla Bollobás, Oliver Riordan, Gábor Tusnády, J. H. Spencer

Publication date: 13 May 2002

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.714.9280

zbMATH Keywords

degree distribution random digraph process

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items

Convergence properties of the degree distribution of some growing network models, Scale-free property for degrees and weights in an \(N\)-interactions random graph model, Scalable generation of scale-free graphs, Random graphs associated to some discrete and continuous time preferential attachment models, Correlated randomly growing graphs, SIS epidemic propagation on hypergraphs, A preferential attachment model with random initial degrees, Minimum vertex cover in generalized random graphs with power law degree distribution, Branches in scale-free trees, Preferential deletion in dynamic models of web-like networks, Scale-free behavior of networks with the copresence of preferential and uniform attachment rules, Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model, Condensation phenomena in preferential attachment trees with neighbourhood influence, Phase transitions in dynamical random graphs, Robustness of power-law networks: its assessment and optimization, On large deviation properties of Erdős-Rényi random graphs, The degree distribution of the generalized duplication model, The cover time of the preferential attachment graph, Random processes with high variance produce scale free networks, The robot crawler graph process, Influence of the seed in affine preferential attachment trees, Branching structure and maximum degree of an evolving random tree, On the continuous-time limit of the Barabási-Albert random graph, A study on scale free social network evolution model with degree exponent \(<2\), Global dynamics of an epidemic model with incomplete recovery in a complex network, A generalization of the Buckley-Osthus model for web graphs, Game theoretical modelling of a dynamically evolving network. I: General target sequences, Enumeration of graphs with a heavy-tailed degree sequence, On the mixing time of geographical threshold graphs, Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs, On nodes of small degrees and degree profile in preferential dynamic attachment circuits, Random networks with sublinear preferential attachment: the giant component, On the independence number and the chromatic number of generalized preferential attachment models, Fundamentals of Stein's method, Large deviations for the degree structure in preferential attachment schemes, Barabási-Albert random graph with multiple type edges and perturbation, Degree asymptotics with rates for preferential attachment random graphs, On a preferential attachment and generalized Pólya's urn model, Visualizing bivariate long-tailed data, Total variation error bounds for geometric approximation, Euler index in uncertain graph, Random continuous model of scale-free networks, Optimally connected hybrid complex networks with windmill graphs backbone, The degree analysis of an inhomogeneous growing network with two types of vertices, A population evolution model and its applications to random networks, Preferential attachment random graphs with edge-step functions, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Interplay between epidemic spread and information diffusion on two-layered networks with partial mapping, Fragility of nonconvergence in preferential attachment graphs with three types, Weights of cliques in a random graph model based on three-interactions, Scaling limits and influence of the seed graph in preferential attachment trees, Social network formation and strategic interaction in large networks, Preferential attachment without vertex growth: emergence of the giant component, Growth of preferential attachment random graphs via continuous-time branching processes, Approximation algorithms for pricing with negative network externalities, On the convergence of probabilities of first-order sentences for recursive random graph models, Assortativity in generalized preferential attachment models, MSO 0-1 law for recursive random trees, Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing, Change point detection in network models: preferential attachment and long range dependence, Law of large numbers for the largest component in a hyperbolic model of complex networks, Model of a random geometric graph with attachment to the coverage area, Generalized nonlinear Yule models, Small subgraphs in preferential attachment networks, General results on preferential attachment and clustering coefficient, Degree distribution of a scale-free random graph model, A tolerance-based heuristic approach for the weighted independent set problem, On the degree evolution of a fixed vertex in some growing networks, Diameters in preferential attachment models, Rumor spreading in social networks, Coevolution of multi-game resolves social dilemma in network population, Phase transition on the degree sequence of a random graph process with vertex copying and deletion, Scale-free property for degrees and weights in a preferential attachment random graph model, Dynamic random networks in dynamic populations, The clustering coefficient of a scale-free random graph, Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees, Metric dimension of critical Galton-Watson trees and linear preferential attachment trees, Preferential attachment with location-based choice: degree distribution in the noncondensation phase, A preferential attachment model with Poisson growth for scale-free networks, Markov chain-based analysis of a modified Cooper-Frieze model, The degree sequences of an asymmetrical growing network, The degree distribution of random \(k\)-trees, A phase transition for preferential attachment models with additive fitness, Preferred attachment in affiliation networks, The age-dependent random connection model, Twitter event networks and the superstar model, Percolation of new products, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Popularity based random graph models leading to a scale-free degree sequence, The iterated local model for social networks, Studies on generalized Yule models, Barabasi-Albert trees are hypoenergetic, Nonuniform recursive trees with vertex attraction depending on their labels, Dynamical models for random simplicial complexes, On a random graph evolving by degrees, Local and global degree profiles of randomly grown self-similar hooking networks under uniform and preferential attachment, An algorithm generating random graphs with power law degree distributions, Taylor's power law for the \(N\)-stars network evolution model, \(\gamma\)-variable first-order logic of uniform attachment random graphs, On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities, Towards a Systematic Evaluation of Generative Network Models, Power laws for family sizes in a duplication model, The Web Graph as an Equilibrium, SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS, ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES, Exact solutions of a generalized weighted scale free network, Unnamed Item, Phase Changes in the Topological Indices of Scale-Free Trees, Structural Characterization of Networks Using the Cat Cortex as an Example, From trees to graphs: collapsing continuous-time branching processes, On a uniformly random chord diagram and its intersection graph, Giant descendant trees, matchings, and independent sets in age-biased attachment graphs, Evolution of the Media Web, Asymptotic Properties of a Random Graph with Duplications, Probabilistic Inductive Classes of Graphs, The iterated local transitivity model for tournaments, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, An extended scale-free network evolution model based on star-like coupling motif embedding, On Bollobás‐Riordan random pairing model of preferential attachment graph, Community modulated recursive trees and population dependent branching processes, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Broadcasting‐induced colorings of preferential attachment trees, An evolving network model from clique extension, NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities, Directed preferential attachment models: Limiting degree distributions and their tails, Upperbounds on the probability of finding marked connected components using quantum walks, Degree distributions in recursive trees with fitnesses, On several properties of a class of hybrid recursive trees, Degree centrality and root finding in growing random networks, Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point, The number of descendants in a random directed acyclic graph, Shape Measures of Random Increasing k-trees, Characterization of Graphs Using Degree Cores, Spread of Infection over P.A. random graphs with edge insertion, Diameter in ultra‐small scale‐free random graphs, The three kinds of degree distributions and nash equilibrium on the limiting random network, Trees grown under young-age preferential attachment, An estimate of the probability of localisation of the diameter of a random scale-free graph, Perfect matchings and Hamiltonian cycles in the preferential attachment model, First-Order Model-Checking in Random Graphs and Complex Networks, Sublinear but never superlinear preferential attachment by local network growth, Satisfiability threshold for power law random 2-SAT in configuration model, A Geometric Preferential Attachment Model of Networks II, Growth of common friends in a preferential attachment model, ENTROPY AND HAUSDORFF DIMENSION IN RANDOM GROWING TREES, The accumulative law and its probability model: an extension of the Pareto distribution and the log-normal distribution, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size, Synchronization in random networks with given expected degree sequences, The connected component of the partial duplication graph, Degree sequences of geometric preferential attachment graphs, Robust Analysis of Preferential Attachment Models with Fitness, A scaling limit for the degree distribution in sublinear preferential attachment schemes, Preferential attachment with choice, Robustness of Preferential Attachment Under Deletion of Edges, Unnamed Item, On certain connectivity properties of the internet topology, Reconstruction of Kauffman networks applying trees, How to distribute antidote to control epidemics, Small-world graphs: characterization and alternative constructions, A new class of scale free random graphs, Scale‐free graphs of increasing degree, A web model with power law exponents less than 2, The sharp threshold for jigsaw percolation in random graphs, Random Networks with Preferential Growth and Vertex Death, Subgraphs in preferential attachment models, Width of a scale-free tree, A preferential attachment process approaching the Rado graph, Universality for distances in power-law random graphs, Disparity of clustering coefficients in the Holme‒Kim network model, Fluctuations in a general preferential attachment model via Stein's method, Finite-Time Influence Systems and the Wisdom of Crowd Effect, Birds of a feather or opposites attract - effects in network modelling, Typical distances in a geometric model for complex networks, Local Clustering Coefficient in Generalized Preferential Attachment Models, TheN-star network evolution model, Large deviations for the leaves in some random trees, A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence, Some Properties of Random Apollonian Networks, Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, Joint degree distributions of preferential attachment random graphs, Asymptotic Degree Distribution of a Duplication–Deletion Random Graph Model, The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs, On the Degree Sequence of an Evolving Random Graph Process and Its Critical Phenomenon, CENTRALITY ESTIMATION IN LARGE NETWORKS, CENTRALITY ESTIMATION IN LARGE NETWORKS, Asymptotic degree distribution in preferential attachment graph models with multiple type edges, On the asymptotic behaviour of random recursive trees in random environments, Out-of-equilibrium random walks, Transition of the Degree Sequence in the Random Graph Model of Cooper, Frieze, and Vera, Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution, On the mean distance in scale free graphs, Phase Transitions for Random Geometric Preferential Attachment Graphs, Degree distribution of shortest path trees and bias of network sampling algorithms

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2725033&oldid=15581049"