On a conditionally Poissonian graph process

DOI10.1239/AAP/1143936140zbMath1096.05047OpenAlexW2057505998MaRDI QIDQ5475389

Hannu Reittu, Ilkka Norros

Publication date: 19 June 2006

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1143936140

zbMATH Keywords

branching processrandom graphpower lawgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (86)

Large deviations for power-law thinned Lévy processes ⋮ Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs ⋮ Not all interventions are equal for the height of the second peak ⋮ Compound Poisson models for weighted networks with applications in finance ⋮ Typical Distances in Ultrasmall Random Networks ⋮ An elementary approach to component sizes in critical random graphs ⋮ Strong couplings for static locally tree-like random graphs ⋮ Large deviations in generalized random graphs with node weights ⋮ A new encoding of coalescent processes: applications to the additive and multiplicative cases ⋮ MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass ⋮ Typical distances in the directed configuration model ⋮ Large deviations for empirical measures of generalized random graphs ⋮ Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ Scale-free percolation ⋮ Model hierarchies in edge-based compartmental modeling for infectious disease spread ⋮ Asymptotics for cliques in scale-free random graphs ⋮ When is a scale-free graph ultra-small? ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ Epidemic models on social networks—With inference ⋮ Voter models on subcritical scale‐free random graphs ⋮ Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations ⋮ Phase transitions in a power-law uniform hypergraph ⋮ Scale-free percolation mixing time ⋮ Connectivity of Poissonian inhomogeneous random multigraphs ⋮ Stochastic recursions on directed random graphs ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Sparse Graphs Using Exchangeable Random Measures ⋮ New techniques for approximating optimal substructure problems in power-law graphs ⋮ Geometric inhomogeneous random graphs ⋮ First passage percolation on random graphs with finite mean degrees ⋮ Unnamed Item ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Limit laws in the generalized random graphs with random vertex weights ⋮ Epidemics on random intersection graphs ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Dense subgraphs of power-law random graphs ⋮ The largest component in a subcritical random graph with a power law degree distribution ⋮ Maximizing the Size of the Giant ⋮ Extremal properties of evolving networks: local dependence and heavy tails ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Evolution of a modified binomial random graph by agglomeration ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Continuum limit of critical inhomogeneous random graphs ⋮ The idemetric property: when most distances are (almost) the same ⋮ Bounding basic characteristics of spatial epidemics with a new percolation model ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ Universality for the distance in finite variance random graphs ⋮ Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees ⋮ Counting cliques and cycles in scale-free inhomogeneous random graphs ⋮ A note on the derivation of epidemic final sizes ⋮ Novel scaling limits for critical inhomogeneous random graphs ⋮ Diameters in preferential attachment models ⋮ Discursive voter models on the supercritical scale-free network ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity ⋮ Cliques in hyperbolic random graphs ⋮ Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs ⋮ SIR epidemics in populations with large sub-communities ⋮ Metastability of the contact process on fast evolving scale-free networks ⋮ Large Cliques in a Power-Law Random Graph ⋮ Number of edges in inhomogeneous random graphs ⋮ Universality for distances in power-law random graphs ⋮ Fuzzy clustering with Barber modularity regularization ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ Spectral bounds in random graphs applied to spreading phenomena and percolation ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Birds of a feather or opposites attract - effects in network modelling ⋮ Limit laws for the number of triangles in the generalized random graphs with random node weights ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems ⋮ Bootstrap percolation in directed inhomogeneous random graphs ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Critical behavior in inhomogeneous random graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs ⋮ Large dicliques in a directed inhomogeneous random graph ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks ⋮ The Phase Transition in Multitype Binomial Random Graphs ⋮ Parameterized clique on inhomogeneous random graphs ⋮ Random intersection graphs with communities ⋮ Unnamed Item ⋮ Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs ⋮ First Passage Percolation on Inhomogeneous Random Graphs ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees ⋮ Distance evolutions in growing preferential attachment graphs ⋮ Large degrees in scale-free inhomogeneous random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance in random graphs with infinite mean degrees
• The diameter of a scale-free random graph
• Distances in random graphs with finite mean and infinite variance degrees
• On the mean distance in scale free graphs
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• A random graph model for massive graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Foundations of Modern Probability
• The Structure and Function of Complex Networks
• Coupling Scale-Free and Classical Random Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• A critical point for random graphs with a given degree sequence
• Distances in random graphs with finite variance degrees

This page was built for publication: On a conditionally Poissonian graph process