相关论文: Random walks on the BMW monoid: an algebraic appro…

It is shown in this work how the Wang-Landau algorithm can be parallelized through the concept of the micromagnetic ensemble, when the Hamiltonian contains both spin interaction and the external field terms, and thus energy-magnetization…

We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…

We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…

In this article we propose multiplication based random walk Metropolis Hastings (MH) algorithm on the real line. We call it the random dive MH (RDMH) algorithm. This algorithm, even if simple to apply, was not studied earlier in Markov…

The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum algorithm for solving the element distinctness problem being…

In this work we introduce the concept of Modular Framization or simply Framization. We construct a framization $F_{d,n}$ of the Birman--Wenzl--Murakami algebra, also known as BMW algebra, and start a systematic study of this framization. We…

Graph clustering is an important technique to understand the relationships between the vertices in a big graph. In this paper, we propose a novel random-walk-based graph clustering method. The proposed method restricts the reach of the…

Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on…

Graph sampling via crawling has been actively considered as a generic and important tool for collecting uniform node samples so as to consistently estimate and uncover various characteristics of complex networks. The so-called simple random…

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…

We establish a relationship between the Small-World behavior found in complex networks and a family of Random Walks trajectories using, as a linking bridge, a maze iconography. Simple methods to generate mazes using Random Walks are…

Ideas of Kn\"odel and B\"ohm-Hornik about walks in certain graphs, resembling the classical symmetric random walk on the integers, are combined. All the relevant generating functions (although occasionally quite involved) are made fully…

A notion of quantum matrix (QM-) algebra generalizes and unifies two famous families of algebras from the theory of quantum groups: the RTT-algebras and the reflection equation (RE-) algebras. These algebras being generated by the…

In this paper, we explore the reduction of functionality in a complex system as a consequence of cumulative random damage and imperfect reparation, a phenomenon modeled as a dynamical process on networks. We analyze the global…

The analysis of large collections of image data is still a challenging problem due to the difficulty of capturing the true concepts in visual data. The similarity between images could be computed using different and possibly multimodal…

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on…

In this paper we examine the implications of the statistical large sample theory for the computational complexity of Bayesian and quasi-Bayesian estimation carried out using Metropolis random walks. Our analysis is motivated by the…

We investigate the eigenvalue statistics of random Bernoulli matrices, where the matrix elements are chosen independently from a binary set with equal probability. This is achieved by initiating a discrete random walk process over the space…

We establish a central limit theorem, a local limit theorem, and a law of large numbers for a natural random walk on a symmetric space $M$ of non-compact type and rank one. This class of spaces, which includes the complex and quaternionic…

Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…