An averaging process on hypergraphs
From MaRDI portal
Publication:5087003
DOI10.1017/jpr.2021.67zbMath1492.05108arXiv2004.13935OpenAlexW4220688794MaRDI QIDQ5087003
Publication date: 8 July 2022
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.13935
Discrete-time Markov processes on general state spaces (60J05) Hypergraphs (05C65) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- A lecture on the averaging process
- Spectra of graphs
- Comparison techniques for random walk on finite groups
- Bifurcations and patterns in compromise processes
- Spectra of hypergraphs and applications
- A phase transition for repeated averages
- High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
- Gossip Algorithms
- Towards consensus: some convergence theorems on repeated averaging
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Probability
- Opinion Fluctuations and Disagreement in Social Networks
- Convergence Speed in Distributed Consensus and Averaging
This page was built for publication: An averaging process on hypergraphs