相关论文: Goldbug Variations
We study the simple random walk on stochastic hyperbolic half planar triangulations constructed in Angel and Ray [3]. We show that almost surely the walker escapes the boundary of the map in positive speed and that the return probability to…
Experimental mathematics is an experimental approach to mathematics in which programming and symbolic computation are used to investigate mathematical objects, identify properties and patterns, discover facts and formulas and even…
Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks…
Quantum random walks are constructed on operator spaces with the aid of matrix-space lifting, a type of ampliation intermediate between those provided by spatial and ultraweak tensor products. Using a form of Wiener-Ito decomposition, a…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
Motivated by applications in mathematical biology concerning randomly alternating motion of micro-organisms, we analyze a generalized integrated telegraph process. The random times between consecutive velocity reversals are…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the…
Following previous theoretical work by Srinivasan (FOCS 2001) and the first author (STACS 2006) and a first experimental evaluation on random instances (ALENEX 2009), we investigate how the recently developed different approaches to…
This text provides a practical introduction to randomness and data analysis, in particular in the context of computer simulations. At the beginning, the most basics concepts of probability are given, in particular discrete and continuous…
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 describe a novel algorithm for rounding packing integer programs based on multidimensional Brownian motion in $\mathbb{R}^n$. Starting from an optimal fractional feasible solution $\bar{x}$, the procedure converges in polynomial time to…
A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
Here we present in a single essay a combination and completion of the several aspects of the problem of randomness of individual objects which of necessity occur scattered in our texbook "An Introduction to Kolmogorov Complexity and Its…
We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In…
In the framework of dependent risks it is a crucial task for risk management purposes to quantify the probability that the aggregated risk exceeds some large value u. Motivated by Asmussen et al. (2011) in this paper we introduce a modified…
We calculate the diffusion coefficients of persistent random walks on cubic and hypercubic lattices, where the direction of a walker at a given step depends on the memory of one or two previous steps. These results are then applied to study…