Rankings in directed configuration models with heavy tailed in-degrees

DOI10.1214/23-AAP1955zbMATH Open1530.05169arXiv2104.08389OpenAlexW3155074174MaRDI QIDQ6180388FDOQ6180388

Authors: Xing Shi Cai, Pietro Caputo, Guillem Perarnau, Matteo Quattropani 

Publication date: 19 January 2024

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We consider the extremal values of the stationary distribution of sparse directed random graphs with given degree sequences and their relation to the extremal values of the in-degree sequence. The graphs are generated by the directed configuration model. Under the assumption of bounded $(2+eta)$-moments on the in-degrees and of bounded out-degrees, we obtain tight comparisons between the maximum value of the stationary distribution and the maximum in-degree. Under the further assumption that the order statistics of the in-degrees have a power-law behavior, we show that the extremal values of the stationary distribution also have a power-law behavior with the same index. In the same setting, we prove that these results extend to the PageRank scores of the random digraph, thus confirming a version of the so-called power-law hypothesis. Along the way, we establish several facts about the model, including the mixing time cutoff and the characterization of the typical values of the stationary distribution, which were previously obtained under the assumption of bounded in-degrees.

Full work available at URL: https://arxiv.org/abs/2104.08389

Recommendations

• Generalized PageRank on directed configuration networks
• PageRank on inhomogeneous random digraphs
• PageRank in Scale-Free Random Graphs
• Pagerank asymptotics on directed preferential attachment networks
• PageRank's behavior under degree correlations

zbMATH Keywords

random walksdirected configuration modelmixing timestationary distributionPageRankpower-law distributions

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)

Cites Work

• On tail probabilities for martingales
• Optimal Transport
• Probability. Theory and examples.
• Heavy-Tail Phenomena
• Title not available (Why is that?)
• The probability that a random multigraph is simple
• A survey of max-type recursive distributional equations
• Distances in random graphs with finite mean and infinite variance degrees
• Title not available (Why is that?)
• On generalized multiplicative cascades
• Random walks on the random graph
• Directed random graphs with given degree distributions
• Cutoff phenomena for random walks on random regular graphs
• Asymptotic properties and absolute continuity of laws stable by random weighted mean.
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• A fixed point theorem for distributions
• Moments, continuity, and multifractal analysis of Mandelbrot martingales
• Stationary distribution and cover time of random walks on random digraphs
• PageRank of Scale-Free Growing Networks
• In-Degree and PageRank: why do they follow similar power laws?
• Asymptotic analysis for personalized web search
• Determining Factors Behind the PageRank Log-Log Plot
• Stein's method for concentration inequalities
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Title not available (Why is that?)
• Diameter and stationary distribution of random \(r\)-out digraphs
• Cutoff at the ``entropic time for sparse Markov chains
• Cutoff for nonbacktracking random walks on sparse random graphs
• The diameter of the directed configuration model
• Random walk on sparse random digraphs
• Typical distances in the directed configuration model
• Generalized PageRank on directed configuration networks
• Characterizing optimal sampling of binary contingency tables via the configuration model
• PageRank on inhomogeneous random digraphs
• Pagerank asymptotics on directed preferential attachment networks
• PageRank in Scale-Free Random Graphs
• Title not available (Why is that?)
• Stationary distribution and cover time of sparse directed configuration models
• Local weak convergence for PageRank
• PageRank's behavior under degree correlations
• Mixing time of PageRank surfers on sparse random digraphs
• Quick detection of top-\(k\) personalized PageRank lists
• The giant component of the directed configuration model revisited

Cited In (2)

• On the meeting of random walks on random DFA
• Meeting, coalescence and consensus time on random directed graphs

This page was built for publication: Rankings in directed configuration models with heavy tailed in-degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180388)