Stochastic recursions on directed random graphs
DOI10.1016/j.spa.2022.10.007arXiv2010.09596OpenAlexW3092743151MaRDI QIDQ6184920
Tzu-Chi Lin, Nicolas Fraiman, Mariana Olvera-Cravioto
Publication date: 29 January 2024
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.09596
Markov chainsdirected graphsinteracting particle systemsstochastic recursionweighted branching processesdistributional fixed-point equations
Random graphs (graph-theoretic aspects) (05C80) Stationary stochastic processes (60G10) Discrete-time Markov processes on general state spaces (60J05) Applications of branching processes (60J85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tail behavior of solutions of linear recursions on trees
- Innovation governs everything eventually: extensions of the DeGroot model
- A survey of max-type recursive distributional equations
- The functional equation of the smoothing transform
- Generating simple random graphs with prescribed degree distribution
- Universality for the distance in finite variance random graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Isotropic majority-vote model on a square lattice
- Higher-order Lindley equations
- A new characterization of endogeny
- Lindley-type equations in the branching random walk
- Connected components in random graphs with given expected degree sequences
- Fixed points of the smoothing transform: two-sided solutions
- Majority-vote model with a bimodal distribution of noises in small-world networks
- Local weak convergence for PageRank
- PageRank's behavior under degree correlations
- Approximating the limiting Quicksort distribution
- PageRank Beyond the Web
- Fixed points of inhomogeneous smoothing transforms
- Information ranking and power laws on trees
- Social influence and opinions
- The Number of Components in Random Linear Graphs
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Asymptotic analysis for personalized Web search
- Reaching a Consensus
- Paths in graphs
- Directed random graphs with given degree distributions
- Zero temperature Glauber dynamics on complex networks
- The phase transition in inhomogeneous random graphs
- Ergodic Randomized Algorithms and Dynamics Over Networks
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Random Graphs
- On the probabilistic worst-case time of ``find
This page was built for publication: Stochastic recursions on directed random graphs
