We consider random walks on discrete state spaces, such as general undirected graphs,
where the random walkers are designed to approximate a target quantity over the network …

In 1984, Hopfield introduced an artificial neural network to understand the memory in living
organisms. Under a condition of symmetry, he showed that there exists a Lyapunov function …

We present a novel quasi-Monte Carlo mechanism to improve graph-based sampling,
coined repelling random walks. By inducing correlations between the trajectories of an …

We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the
hypergraph is injective, there exists a point $ v= v (H) $ such that the random process …

Nesta dissertação consideramos um modelo de urnas interagentes, onde a interação é em
parte definida pela estrutura de um grafo finito. Nosso trabalho surge como uma …