Hitting times, commute times, and cover times for random walks on random hypergraphs

  title={Hitting times, commute times, and cover times for random walks on random hypergraphs},
  author={Amine Helali and Matthias Lowe},
  journal={Statistics \& Probability Letters},

A Central Limit Theorem for the average target hitting time for a random walk on a random graph

. Consider a simple random walk on a realization of an Erd˝os-R´enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture,

Random walks and community detection in hypergraphs

A one-parameter family of random walk processes on hypergraphs, where a parameter biases the dynamics of the walker towards hyperedges of low or high cardinality, is proposed and tested on artificial and real-world hyper graphs.

Spectra of Random Regular Hypergraphs

The main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs, which relates the second eigenvalues to both its expansion property and the mixing rate of the non-backtracking random walk on regular hyper graphs.

Random walks on hypergraphs

This work contributes to unraveling the effect of higher-order interactions on diffusive processes in higher- order networks, shedding light on mechanisms at the heart of biased information spreading in complex networked systems.

A Central Limit Theorem for the Mean Starting Hitting Time for a Random Walk on a Random Graph

<jats:p>We consider simple random walk on a realization of an Erdős–Rényi graph with <jats:italic>n</jats:italic> vertices and edge probability

Missing Mass in Markov Chains

—The problem of missing mass in statistical inference (posed by McAllester and Ortiz, NIPS’02; most recently revisited by Changa and Thangaraj, ISIT’2019) seeks to estimate the weight of symbols that

On some building blocks of hypergraphs: units, twin-units, regular, co-regular, and symmetric sets

. Here, we introduce and investigate different building blocks, named units, twin units, regular sets, symmetric sets, and co-regular sets in a hypergraph. Our work shows that the presence of these

Modelling non-linear consensus dynamics on hypergraphs

The non-linear dynamics of consensus on hypergraphs is explored, allowing for interactions within hyperedges of any cardinality, and the role of involvement and stubbornness on polarisation is explored.



The Cover Times of Random Walks on Hypergraphs

An expression for C(H) is given which is tractable for many classes of hypergraphs, and C (H) and I(H ) are calculated exactly for random r-regular, s-uniform hyper graphs.

Random Walks on Graphs: a Survey

Dedicated to the marvelous random walk of Paul Erd} os through universities, c ontinents, and mathematics Various aspects of the theory of random walks on graphs are surveyed. In particular,

First-passage properties of the Erdos Renyi random graph

An effective medium approximation is developed that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first- passage time, are insensitive to the fraction p of occupied links.

Asymptotic normality of the size of the giant component in a random hypergraph

It is shown that the same method applies to the analogous model of random k ‐uniform hypergraphs, establishing asymptotic normality throughout the (sparse) supercritical regime.

Random Walks on Infinite Graphs and Groups

Part I. The Type Problem: 1. Basic facts 2. Recurrence and transience of infinite networks 3. Applications to random walks 4. Isoperimetric inequalities 5. Transient subtrees, and the classification

Spectral statistics of Erdős–Rényi graphs I: Local semicircle law

We consider the ensemble of adjacency matrices of Erdős–Renyi random graphs, that is, graphs on N vertices where every edge is chosen independently and with probability p≡p(N). We rescale the matrix

A phase transition for the limiting spectral density of random matrices

We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of

Markov Chains and Mixing Times

This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary