A stochastic process on a network with connections to Laplacian systems of equations

DOI10.1017/apr.2021.27zbMath1492.60256arXiv1701.05296OpenAlexW2963766088MaRDI QIDQ5066880

Pooja Vyavahare, Iqra Altaf Gillani, Amitabha Bagchi

Publication date: 31 March 2022

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random walksqueueing networksgeometric ergodicity

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Markov chains and stochastic stability
• Ergodicity of a slotted ALOHA system
• Stability of token passing rings
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• A queueing network-based distributed Laplacian solver
• Lower bounds for in-network computation of arbitrary functions
• A queueing network-based distributed Laplacian solver for directed graphs
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• A Proof for the Queuing Formula: L = λW
• Maximum hitting time for random walks on graphs
• Expected hitting and cover times of random walks on some special graphs
• Randomized Routing and Sorting on Fixed-Connection Networks
• Stability conditions for some distributed systems: buffered random access systems
• Stability of N interacting queues in random-access systems
• Geometric Convergence Rates for Stochastically Ordered Markov Chains
• Computing separable functions via gossip
• On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract
• Solving SDD linear systems in nearly m log ^1/2 n time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A stochastic process on a network with connections to Laplacian systems of equations