Lecture

Randomness in Social Self-Organization

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-234: Technologies for democratic society

This course will offer students a broad but hands-on introduction to technologies of human self-organization. ...

Description

This lecture explores the concept of randomness in social self-organization, discussing precedents such as dividing populations into smaller groups, parallelism, and diversity of opinion. The instructor delves into the role of randomness in democratic processes, including tie-breaking rules and magisterial position selection. More recent precedents like census processes and opinion polling are also examined, highlighting the challenges of representation and accuracy in gathering information. The lecture concludes by discussing fundamental tensions between representation and expertise, illustrated through examples like trial by jury and deliberative polling.

Instructors (2)

Bryan Alexander Ford

Links DEDIS lab home pagePersonal home page Curriculum vitae https://bford.info/cv.pdf Teaching & PhD PhD Students Shailesh Mishra Past EPFL PhD Students Eleftherios Kokoris Kogias, Kirill Nikitin, Cristina Basescu, Enis Ceyhun Alp, Simone Colombo, Pasindu Nivanthaka Tennage, Louis-Henri Manuel Jakob Merino Past EPFL PhD Students as codirector David Froelicher, Ludovic Barman, Georgia Fragkouli Courses Decentralized systems engineering CS-438 A decentralized system is one that works when n

Verónica del Carmen Estrada Galiñanes

Official source

Related concepts (31)

Randomness test

A randomness test (or test for randomness), in data evaluation, is a test used to analyze the distribution of a set of data to see whether it can be described as random (patternless). In stochastic modeling, as in some computer simulations, the hoped-for randomness of potential input data can be verified, by a formal test for randomness, to show that the data are valid for use in simulation runs. In some cases, data reveals an obvious non-random pattern, as with so-called "runs in the data" (such as expecting random 0–9 but finding "4 3 2 1 0 4 3 2 1.

Statistical randomness

A numeric sequence is said to be statistically random when it contains no recognizable patterns or regularities; sequences such as the results of an ideal dice roll or the digits of π exhibit statistical randomness. Statistical randomness does not necessarily imply "true" randomness, i.e., objective unpredictability. Pseudorandomness is sufficient for many uses, such as statistics, hence the name statistical randomness. Global randomness and local randomness are different.

Jury trial

A jury trial, or trial by jury, is a legal proceeding in which a jury makes a decision or findings of fact. It is distinguished from a bench trial in which a judge or panel of judges makes all decisions. Jury trials are used in a significant share of serious criminal cases in many but not all common law judicial systems. The majority of common law jurisdictions in Asia (such as Singapore, India, Pakistan and Malaysia) have abolished jury trials on the grounds that juries are susceptible to bias.

Random number generation

Random number generation is a process by which, often by means of a random number generator (RNG), a sequence of numbers or symbols that cannot be reasonably predicted better than by random chance is generated. This means that the particular outcome sequence will contain some patterns detectable in hindsight but unpredictable to foresight. True random number generators can be hardware random-number generators (HRNGs), wherein each generation is a function of the current value of a physical environment's attribute that is constantly changing in a manner that is practically impossible to model.

Algorithmically random sequence

Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-free or not) universal Turing machine. The notion can be applied analogously to sequences on any finite alphabet (e.g. decimal digits). Random sequences are key objects of study in algorithmic information theory. As different types of algorithms are sometimes considered, ranging from algorithms with specific bounds on their running time to algorithms which may ask questions of an oracle machine, there are different notions of randomness.

Related lectures (41)

Randomness in Social Process

Explores randomness in social processes, focusing on the selection of authority roles.

Monte Carlo methods: single particle diffusion MOOC: Sorption and transport in cementitious materials

Covers Monte Carlo methods for simulating single particle diffusion in cementitious materials, including random functions and number generators.

Quantum Random Number Generation

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Statistical Theory: Decision Theory Framework

Explores the Decision Theory Framework in Statistical Theory, viewing statistics as a random game with key concepts like admissibility, minimax rules, and Bayes rules.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.