Cover Image

Logarithmic typical distances in preferential attachment models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	van der Hofstad, Remco, Zhu, Haodong
Format:	Preprint
Published:	2025
Subjects:	Probability 05C80, 05C12, 05C82
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Asymptotic diameter of preferential attachment model
by: Du, Hang, et al.
Published: (2025)

Ising model on preferential attachment models
by: van der Hofstad, Remco, et al.
Published: (2025)

Competing types in preferential attachment graphs with community structure
by: Haslegrave, John, et al.
Published: (2022)

The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)

The number and structure of connected graphs with a fixed degree sequence
by: Bell, Sasha, et al.
Published: (2026)

Local limit of Prim's algorithm
by: Corsini, Benoît, et al.
Published: (2025)

The asymptotic rank of adjacency matrices of weighted configuration models over arbitrary fields
by: van der Hofstad, Remco, et al.
Published: (2025)

The diameter of KPKVB random graphs
by: Müller, Tobias, et al.
Published: (2017)

Random intersection graphs with communities
by: van der Hofstad, Remco, et al.
Published: (2018)

Phase transition in preferential attachment-detachment through embedding
by: Hinz, Michael, et al.
Published: (2024)

Spatial preferential attachment with choice-based edge step
by: Malyshkin, Yury
Published: (2024)

Annealed Potts models on rank-1 inhomogeneous random graphs
by: Giardinà, Cristian, et al.
Published: (2025)

Optimal subgraphs in geometric scale-free random graphs
by: Michielan, Riccardo, et al.
Published: (2024)

Network evolution with self-reinforcement
by: Bhamidi, Shankar, et al.
Published: (2026)

The giant in random graphs is almost local
by: van der Hofstad, Remco
Published: (2021)

Normal approximation for number of edges in random intersection graphs
by: Rybarczyk, Katarzyna, et al.
Published: (2025)

Tripodal structure in undersaturated random graphs
by: DiCarlo, William, et al.
Published: (2025)

Efficient graph similarity assessment method based on vectors of topological indices
by: Dehmer, Matthias, et al.
Published: (2025)

A note on Two-Point Concentration of the Independence Number of $G_{n,m}$
by: Bohman, Tom, et al.
Published: (2024)

Analysis of Clustering and Degree Index in Random Graphs and Complex Networks
by: Işlak, Ümit, et al.
Published: (2024)

Limiting Behavior of Degree-Degree Metrics under Local Convergence in Probability
by: Patularu, Andrei-Eugeniu, et al.
Published: (2026)

A Random Walk Approach to Broadcasting on Random Recursive Trees
by: Althaus, Ernst, et al.
Published: (2024)

Arithmetic oscillations of the chemical distance in long-range percolation on $\mathbb Z^d$
by: Biskup, Marek, et al.
Published: (2021)

Are giants in random digraphs `almost' local?
by: van der Hofstad, Remco, et al.
Published: (2024)

Limits of Weighted Graphs via Random Quotients
by: Levin, Eitan, et al.
Published: (2025)

On the strength of connectedness of unions of random graphs
by: Bloznelis, Mindaugas
Published: (2026)

Tame sparse exponential random graphs
by: Chakraborty, Suman, et al.
Published: (2024)

Age-dependent random connection models with arc reciprocity: clustering and connectivity
by: Lüchtrath, Lukas, et al.
Published: (2026)

Behavior of the Minimum Degree Throughout the $d$-process
by: Hofstad, Jakob
Published: (2023)

Unified study of the phase transition for block-weighted random planar maps
by: Salvy, Zéphyr
Published: (2024)

A phase transition in block-weighted random maps
by: Fleurat, William, et al.
Published: (2023)

Sparse random graphs with many triangles
by: Chakraborty, Suman, et al.
Published: (2021)

The critical activation density in graph bootstrap percolation
by: Kolesnik, Brett, et al.
Published: (2026)

Two models of sparse and clustered dynamic networks
by: Bloznelis, Mindaugas, et al.
Published: (2024)

Connectivity of random graphs after centrality-based vertex removal
by: Pandey, Manish, et al.
Published: (2023)

Enlargement of subgraphs of infinite graphs by Bernoulli percolation
by: Okamura, Kazuki
Published: (2015)

Percolation on dense random graphs with given degrees
by: Lichev, Lyuben, et al.
Published: (2022)

Non-equilibrium coagulation processes and subcritical percolation on evolving networks
by: Banerjee, Sayan, et al.
Published: (2025)

Geometric scale-free random graphs on mobile vertices: broadcast and percolation times
by: Gracar, Peter, et al.
Published: (2024)

The contact process on scale-free geometric random graphs
by: Gracar, Peter, et al.
Published: (2022)