Directed random graphs with given degree distributions
From MaRDI portal
Publication:5168864
DOI10.1214/12-SSY076zbMath1297.05212arXiv1207.2475OpenAlexW2051333815MaRDI QIDQ5168864
Ningyuan Chen, Mariana Olvera-Cravioto
Publication date: 21 July 2014
Full work available at URL: https://arxiv.org/abs/1207.2475
Related Items
Strong couplings for static locally tree-like random graphs ⋮ THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS ⋮ Typical distances in the directed configuration model ⋮ A Dynamic Contagion Risk Model with Recovery Features ⋮ Local weak convergence for PageRank ⋮ PageRank in Scale-Free Random Graphs ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Mixing time of PageRank surfers on sparse random digraphs ⋮ Markovian online matching algorithms on large bipartite random graphs ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ Stochastic recursions on directed random graphs ⋮ The configuration model for partially directed graphs ⋮ The Construction and Properties of Assortative Configuration Graphs ⋮ The degree-wise effect of a second step for a random walk on a graph ⋮ Persistence time of SIS infections in heterogeneous populations and networks ⋮ PageRank on inhomogeneous random digraphs ⋮ PageRank's behavior under degree correlations ⋮ Giant Component in Random Multipartite Graphs with Given Degree Sequences ⋮ Asymptotics in directed exponential random graph models with an increasing bi-degree sequence ⋮ Construction of Directed Assortative Configuration Graphs ⋮ Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees ⋮ Random intersection graphs with communities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An expansion for self-interacting random walks
- Generating simple random graphs with prescribed degree distribution
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- The asymptotic number of labeled graphs with given degree sequences
- How likely is an LLD degree sequence to be graphical?
- Asymptotic enumeration by degree sequence of graphs of high degree
- Connected components in random graphs with given expected degree sequences
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Uniform generation of random regular graphs of moderate degree
- A critical point for random graphs with a given degree sequence
- Distances in random graphs with finite variance degrees
- The average distances in random graphs with given expected degrees
- The Enumeration of Locally Restricted Graphs (II)
