High-order random walks and generalized Laplacians on hypergraphs

DOI10.1080/15427951.2012.678151MaRDI QIDQ5300787zbMATH OpenOpenAlexFDO

Authors Linyuan Lu, Xing Peng

Publication date 28 June 2013

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2012.678151

zbMATH Keywords

edge expansionseigenvaluesgeneralized diametergeneralized distancehigh-order random walksLaplacians for hypergraphsspectral analysisspectral graph theory

Mathematics Subject Classification ID

Distance in graphs (05C12) Hypergraphs (05C65) Random walks on graphs (05C81)

Recommendations

• High-ordered random walks and generalized Laplacians on hypergraphs
• Loose Laplacian spectra of random hypergraphs
• Random walks and Laplacians on hypergraphs: when do they match?
• On the spectrum of hypergraphs
• scientific article; zbMATH DE number 475375

Cited in

(13)

• Random walks and orthogonal functions associated with highly symmetric graphs
• Random walks and Laplacians on hypergraphs: when do they match?
• Adjacency spectra of random and complete hypergraphs
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
• On some general operators of hypergraphs
• High-ordered random walks and generalized Laplacians on hypergraphs
• Loose Laplacian spectra of random hypergraphs
• Connected hypergraphs with small spectral radius
• Hypergraph Laplacians in Diffusion Framework
• Spectral graph theory via higher order eigenvalues and applications to the analysis of random walks
• Dynamics on networks with higher-order interactions
• Statistical ranking with dynamic covariates
• Centrality measures to control epidemic spreading on uniform hypergraphs or hypernetworks

This page was built for publication: High-order random walks and generalized Laplacians on hypergraphs

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