Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0706.3785

Order from Randomness

Krzysztof Maślanka·Jerzy Cisło
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider an elementary discrete process which starts from purely random configuration and leads to well-ordered and stable state. Complete analytical solution to this problem is presented.

Explore related subjects

math.HO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Krzysztof Maślanka, Jerzy Cisło. 2007-06-26. Order from Randomness. https://arxiv.org/abs/0706.3785

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

What math means to me

This is a personal essay about how I see math, what I value about it, and what it means to me.

math.HO↗
arXiv2026

Training Mathematicians in the Age of AI: Intellectual Agency, Cognitive Offloading, and the PhD Thesis

Powerful artificial intelligence is weakening the traditional relationship between mathematical output and evidence of mathematical expertise. In particular, the production of an original theorem or a polished dissertation can no longer, by itself, certify the intellectual formation of its nominal author. I argue that graduate mathematical education should therefore be organized around the formation of intellectual agency: internal technical competence, mathematical judgment, understanding, and responsible participation in a shared intellectual culture. I distinguish productive from premature cognitive offloading, propose complementary independent and AI-augmented modes of training, and suggest a corresponding reformulation of the role of the PhD thesis and dissertation defense. More broadly, I argue that academic mathematics should understand itself increasingly as an institution for the reproduction and stewardship of human mathematical expertise rather than primarily as a mechanism for producing theorems.

math.HO↗
arXiv2026

Percolation on Finite Graphs

Lecture notes from a graduate course given by Michael Krivelevich at the School of Mathematical Sciences of Tel Aviv University in the spring semester of 2026. Topics covered include: phase transition and the giant component in $G(n,p)$; long paths and cycles in supercritical and sparse random graphs; thresholds for connectedness and perfect matching; general model of a random subgraph of a finite graph; phase transition and the giant component in the random hypercube; polynomial diameter of the giant component; perfect matchings in the random hypercube.

math.HO↗