A random mapping with preferential attachment
From MaRDI portal
Publication:3608314
DOI10.1002/rsa.20251zbMath1166.60004arXivmath/0603529OpenAlexW4234707618MaRDI QIDQ3608314
Jerzy Jaworski, Jennie C. Hansen
Publication date: 4 March 2009
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603529
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Exchangeability for stochastic processes (60G09)
Related Items (5)
A Turán-Kubilius Inequality on Mappings of a Finite Set ⋮ GHS algorithm on a graph with random weights ⋮ Local properties of random mappings with exchangeable in-degrees ⋮ Limit theorems for the logarithm of the order of a random \(A\)-mapping ⋮ Predecessors and Successors in Random Mappings with Exchangeable In-Degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Brownian bridge asymptotics for random \(p\)-mappings
- Limits of logarithmic combinatorial structures.
- Total variation asymptotics for Poisson process approximations for logarithmic combinatorial assemblies
- Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
- A cutting process for random mappings
- Random mappings with exchangeable in-degrees
- On a simple formula for random mappings and its applications
- The largest connected component in a random mapping
- Cycles in a Uniform Graph Process
- Order statistics for decomposable combinatorial structures
- On random mappings with a single attracting centre
- Epidemic processes on digraphs of random mappings
- Random Mappings with a Single Attracting Center
- Random mappings with an attracting center: Lagrangian distributions and a regression function
This page was built for publication: A random mapping with preferential attachment