The age-dependent random connection model
From MaRDI portal
Abstract: We investigate a class of growing graphs embedded into the -dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on time, their spatial distance and their relative ages. This simple model for a scale-free network is called the age-based spatial preferential attachment network and is based on the idea of preferential attachment with spatially induced clustering. We show that the graphs converge weakly locally to a variant of the random connection model, which we call the age-dependent random connection model. This is a natural infinite graph on a Poisson point process where points are marked by a uniformly distributed age and connected with a probability depending on their spatial distance and both ages. We use the limiting structure to investigate asymptotic degree distribution, clustering coefficients and typical edge lengths in the age-based spatial preferential attachment network.
Recommendations
- A spatial preferential attachment model with local clustering
- Spatial preferential attachment networks: power laws and clustering coefficients
- Percolation phase transition in weight-dependent random connection models
- A Geometric Preferential Attachment Model of Networks
- Algorithms and Models for the Web-Graph
Cites work
- A Geometric Preferential Attachment Model of Networks
- A Geometric Preferential Attachment Model of Networks II
- A spatial web graph model with local influence regions
- Collective dynamics of `small-world' networks
- Continuum Percolation
- Degree sequences of geometric preferential attachment graphs
- Diameters in preferential attachment models
- Distances and large deviations in the spatial preferential attachment model
- Emergence of Scaling in Random Networks
- Geometric graph properties of the spatial preferred attachment model
- Geometric preferential attachment in non-uniform metric spaces
- Lectures on the Poisson Process
- Phase transitions for random geometric preferential attachment graphs
- Random networks with sublinear preferential attachment: the giant component
- Recurrence of distributional limits of finite planar graphs
- Robustness of scale-free spatial networks
- Scale-free percolation
- Scale-free percolation in continuum space
- Some Typical Properties of the Spatial Preferred Attachment Model
- Spatial Gibbs random graphs
- Spatial preferential attachment networks: power laws and clustering coefficients
- The degree sequence of a scale-free random graph process
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- Typical distances in ultrasmall random networks
- Weak laws of large numbers in geometric probability
Cited in
(20)- Distance evolutions in growing preferential attachment graphs
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Scale-free percolation mixing time
- Scaling of the clustering function in spatial inhomogeneous random graphs
- Age, innovations and time operator of networks
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- A spatial small-world graph arising from activity-based reinforcement
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Cluster-size decay in supercritical long-range percolation
- Modified DM models for aging networks based on neighborhood connectivity
- Distances and large deviations in the spatial preferential attachment model
- Recurrence versus transience for weight-dependent random connection models
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Percolation phase transition in weight-dependent random connection models
- Chemical distance in geometric random graphs with long edges and scale-free degree distribution
- Activity ageing in growing networks
- Recurrence and transience of symmetric random walks with long-range jumps
- Transience versus recurrence for scale-free spatial networks
- scientific article; zbMATH DE number 1367586 (Why is no real title available?)
- A spatial preferential attachment model with local clustering
This page was built for publication: The age-dependent random connection model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297812)
