Related papers: A leader-election procedure using records
We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…
We introduce a stochastic model of a population with overlapping generations and arbitrary levels of self-fertilization versus outcrossing. We study how the global graph of reproductive relationships, or population pedigree, influences the…
The Poisson process is one of the simplest stochastic processes defined in continuous time, having interesting mathematical properties, leading, in many situations, to applications mathematically treatable. One of the limitations of the…
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work,…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
The two-parameter Poisson-Dirichlet diffusion takes values in the infinite ordered simplex and extends the celebrated infinitely-many-neutral-alleles model, having a two-parameter Poisson-Dirichlet stationary distribution. Here we identify…
We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of…
The classical model for the genealogies of a neutrally evolving population in a fixed environment is due to Kingman. Kingman's coalescent process, which produces a binary tree, universally emerges from many microscopic models in which the…
We consider an extension of the noisy $N$-Branching Random Walk that models the evolution of a population subject to natural selection. We show the existence of a critical value for the noise which separates the limiting genealogical…
We study random spatial permutations on Z^3 where each jump x -> \pi(x) is penalized by a factor exp(-T ||x-\pi(x)||^2). The system is known to exhibit a phase transition for low enough T where macroscopic cycles appear. We observe that the…
We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform random scheduler. We show a protocol for leader election that…
We show that for planar dispersing billiards the return times distribution is, in the limit, Poisson for metric balls almost everywhere w.r.t. the SRB measure. Since the Poincar\'e return map is piecewise smooth but becomes singular at the…
The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…
We establish a complete picture of condensation in the inclusion process in the thermodynamic limit with vanishing diffusion, covering all scaling regimes of the diffusion parameter and including large deviation results for the maximum…
This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
The finite intrinsic nature of the most distributed algorithms gives us this ability to use model checking tools for verification of this type of algorithms. In this paper, I attempt to use NuSMV as a model checking tool for verifying…
We explore the behaviour emerging from learning agents repeatedly interacting strategically for a wide range of learning dynamics, including $Q$-learning, projected gradient, replicator and log-barrier dynamics. Going beyond the better…
We study the totally asymmetric simple exclusion process (TASEP) on $\mathbb{Z}$ with step initial condition, in which all particles have distinct types. Our main object of interest is the type of the rightmost particle -- the leader -- at…
We study an infinite system of particles initially occupying a half-line $y\leq 0$ and undergoing random walks on the entire line. The right-most particle is called a leader. Surprisingly, every particle except the original leader may never…