English
Related papers

Related papers: Power laws and power-of-two-choices

200 papers

We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…

Discrete Mathematics · Computer Science 2014-01-03 Amanda Redlich

Power-law distributions are typical macroscopic features occurring in almost all complex systems observable in nature. As a result, researchers in quantitative analyses must often generate random synthetic variates obeying power-law…

Physics and Society · Physics 2014-11-11 Filippo Radicchi

We consider a version of D. Price's model for the growth of a bibliographic network, where in each iteration a constant number of citations is randomly allocated according to a weighted combination of accidental (uniformly distributed) and…

Physics and Society · Physics 2022-08-31 Grzegorz Siudem , Przemysław Nowak , Marek Gagolewski

Power-law distributions occur in wide variety of physical, biological, and social phenomena. In this paper, we propose a statistical hypothesis test based on the log-likelihood ratio to assess whether two samples of discrete data are drawn…

Methodology · Statistics 2015-03-03 Alessandro Bessi

The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen…

Statistical Mechanics · Physics 2009-11-13 Raissa M. D'Souza , Paul L. Krapivsky , Cristopher Moore

In this paper, we propose an optimization-based mechanism to explain power law distributions, where the function that the optimization process is seeking to optimize is derived mathematically, then the behavior and interpretation of this…

Physics and Society · Physics 2018-12-27 A. M. Khalili

In multi-server distributed queueing systems, the access of stochastically arriving jobs to resources is often regulated by a dispatcher, also known as load balancer. A fundamental problem consists in designing a load balancing algorithm…

Probability · Mathematics 2025-02-23 Jonatha Anselmi , Francois Dufour

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

Power-law distributions are common, particularly in social physics. Here, we explore whether power-laws might arise as a consequence of a general variational principle for stochastic processes. We describe communities of 'social particles',…

Physics and Society · Physics 2011-12-30 G. J. Peterson , K. A. Dill

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems. In this framework,…

Information Theory · Computer Science 2017-07-03 Mahdi Jafari Siavoshani , Ali Pourmiri , Seyed Pooya Shariatpanahi

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

We consider the problem of evaluating designs for a two-arm randomized experiment with the criterion being the power of the randomization test for the one-sided null hypothesis. Our evaluation assumes a response that is linear in one…

Methodology · Statistics 2020-08-14 Abba M. Krieger , David Azriel , Michael Sklar , Adam Kapelner

The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-07-20 Jean-François Marckert , Nasser Saheb-Djahromi , Akka Zemmari

In the last years, researchers have realized the difficulties of fitting power-law distributions properly. These difficulties are higher in Zipf's systems, due to the discreteness of the variables and to the existence of two representations…

Data Analysis, Statistics and Probability · Physics 2022-11-29 Alvaro Corral , Isabel Serra , Ramon Ferrer-i-Cancho

In balanced allocations, the goal is to place $m$ balls into $n$ bins, so as to minimize the gap (difference of max to average load). The One-Choice process places each ball to a bin sampled independently and uniformly at random. The…

Discrete Mathematics · Computer Science 2023-04-24 Dimitrios Los , Thomas Sauerwald

We introduce a non-growth model that generates the power-law distribution with the Zipf exponent. There are N elements, each of which is characterized by a quantity, and at each time step these quantities are redistributed through binary…

Statistical Mechanics · Physics 2012-04-27 Suhan Ree

We introduce preferential behavior into the study on statistical mechanics of money circulation. The computer simulation results show that the preferential behavior can lead to power laws on distributions over both holding time and amount…

Physics and Society · Physics 2009-11-11 Ning Ding , Yougui Wang

When the probability of measuring a particular value of some quantity varies inversely as a power of that value, the quantity is said to follow a power law, also known variously as Zipf's law or the Pareto distribution. Power laws appear…

Statistical Mechanics · Physics 2019-09-23 M. E. J. Newman

We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value…

Data Structures and Algorithms · Computer Science 2007-05-23 David Eppstein , George Lueker

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…

Probability · Mathematics 2007-05-23 Malwina J. Luczak , Colin McDiarmid
‹ Prev 1 2 3 10 Next ›