Rankings in directed configuration models with heavy tailed in-degrees
DOI10.1214/23-aap1955zbMath1530.05169arXiv2104.08389OpenAlexW3155074174MaRDI QIDQ6180388
Guillem Perarnau, Pietro Caputo, Xing Shi Cai, Matteo Quattropani
Publication date: 19 January 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.08389
random walksstationary distributionpower-law distributionsmixing timedirected configuration modelPageRank
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stationary distribution and cover time of random walks on random digraphs
- A survey of max-type recursive distributional equations
- Diameter and stationary distribution of random \(r\)-out digraphs
- Cutoff phenomena for random walks on random regular graphs
- A fixed point theorem for distributions
- On tail probabilities for martingales
- Moments, continuity, and multifractal analysis of Mandelbrot martingales
- On generalized multiplicative cascades
- Typical distances in the directed configuration model
- Cutoff at the ``entropic time for sparse Markov chains
- Random walks on the random graph
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- PageRank on inhomogeneous random digraphs
- Cutoff for nonbacktracking random walks on sparse random graphs
- Pagerank asymptotics on directed preferential attachment networks
- Local weak convergence for PageRank
- Stationary distribution and cover time of sparse directed configuration models
- PageRank's behavior under degree correlations
- Stein's method for concentration inequalities
- Random walk on sparse random digraphs
- Distances in random graphs with finite mean and infinite variance degrees
- The diameter of the directed configuration model
- PageRank in Scale-Free Random Graphs
- Quick Detection of Top-k Personalized PageRank Lists
- The evolution of the mixing rate of a simple random walk on the giant component of a random graph
- The Probability That a Random Multigraph is Simple
- Asymptotic analysis for personalized Web search
- The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
- Characterizing optimal sampling of binary contingency tables via the configuration model
- The giant component of the directed configuration model revisited
- Directed random graphs with given degree distributions
- Generalized PageRank on directed configuration networks
- Determining Factors Behind the PageRank Log-Log Plot
- Heavy-Tail Phenomena
- PageRank of Scale-Free Growing Networks
- Probability
- In-Degree and PageRank: Why Do They Follow Similar Power Laws?
- Optimal Transport
- Mixing time of PageRank surfers on sparse random digraphs
This page was built for publication: Rankings in directed configuration models with heavy tailed in-degrees
