JOVANA
Library Glossary Getting Started Three Levels Fields How it works Mission
Join the mission
Back to the library
網絡科學 1960

隨機圖的演化

保羅·艾狄胥、阿爾弗雷德·雷尼

隨機撒下連線,在某個精確的瞬間,一張巨網驟然成形。

Choose your version
In depth · the introduction

不斷給一群陌生人隨機牽線,到某個精確的瞬間,散落的小團體便會融成一張幾乎囊括所有人的巨網。

把這個想法拆開看

取大量的點,開始一對一對地隨機連線,一條接一條。起初你得到許多細小、彼此分離的碎塊。很長一段時間裡什麼戲劇性的事都沒發生——碎塊只是慢慢變大。然後,在一個精確的臨界點上,驟變發生了:一個碎塊猛地蓋過其餘所有,把整幅畫裡很大一部分的點連成一片。

艾狄胥與雷尼找出了那個臨界點究竟在哪。神奇的數字,是平均每個點一條連線。每點平均不到一條線時,網絡是一盤小碎屑;越過那條線,一張「巨大」的網便驟然成形。這變化不是漸進的,而是一道閾值——就像水在某個確定的溫度結成冰。

它從哪裡來

保羅·艾狄胥——那位四海為家的匈牙利人,幾乎一無所有,睡在同行的沙發上,合作者之多冠絕古今——與阿爾弗雷德·雷尼聯手。雷尼愛說,數學家是把咖啡變成定理的機器。在 1959–1960 年間一連串論文裡,他們問了一個貌似簡單的問題:一個典型的圖,長什麼樣?通過想像圖一條邊一條邊地生長,他們發現它的性格會經由驟然的跳變而改變,並寫下了這些隨機網絡的第一部「自然史」。

它為何重要

在他們之前,圖是一張一張、靠手研究的。艾狄胥與雷尼表明:你可以一次性地對整個隨機系綜作推理,並在規模很大時以近乎確定的把握預言它的特徵。而他們那個臨界點的想法,後來證明無處不在:同一套數學,描述著一場病何時傾覆為流行病、一則流言何時瘋傳、一張電網或互聯網何時變得穩健連通、一種材料何時忽然開始導電。他們找到的,是連接本身的一條法則。

一個打比方

想像一鍋裡散布的爆米花粒,每一粒都能粘住鄰居。隨機撒下粘性的連線,你先得到幾個小團。繼續撒,團仍舊小——直到在某個臨界的粘度上,接下來的幾條線把一個個團搭成一整張、橫貫整鍋的薄片。前一刻:鬆散的碎屑。後一刻:一團相連的整體。這跨越,恰發生在每一粒平均只有一條連線之時。

圓盤裡的七十個點,由隨機的連線相連。滑桿設定每個點的平均連線數。每點不到一條線時,只形成各自分離的小碎塊。當平均數越過 1,一個巨大的連通群以顏色亮起,迅速納入大部分點。

它落在哪裡

這是網絡科學的奠基之作。它與物理學中的滲流理論、生物學中的流行病模型並立——後兩者描述的,正是同一個驟然的臨界點。後來的研究者——Watts 與 Strogatz 的「小世界」、Barabási 與 Albert 的「樞紐」——造出了更豐富的模型,因為真實的網絡(友誼、萬維網、神經元)並非完全隨機。但它們每一個,都對照著艾狄胥–雷尼隨機圖來度量:那是純粹隨機的基線。

The original document
Original source text
P. Erdős & A. Rényi · Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960) · pp. 17–61 · dedicated to Professor P. Turán on his 50th birthday
The model
For n labelled vertices there are C(n,2) = n(n−1)/2 possible edges. Erdős and Rényi study the graph Γ(n,N) formed by choosing N of those edges at random, every such graph being equally likely. They let N grow with n and ask how a typical graph looks at each stage — treating the steadily rising N as a kind of time, so that the graph 'evolves'.
Threshold functions
Their central discovery is that almost every property appears not gradually but at a sharp threshold. For many properties A there is a threshold function: if N grows much more slowly than it, almost no graph has A; if N grows much faster, almost every graph has A. The switch is abrupt, and most of the paper computes these thresholds, property by property.
The double jump — the giant component
The most famous threshold governs the largest connected component, near N ≈ n/2 — that is, an average of about one edge per vertex. Below it (N = cn/2 with c < 1) every component is small, of order log n. Exactly at c = 1 the largest is of order n^(2/3). Above it (c > 1) a single 'giant' component of order n emerges and absorbs a finite fraction of all vertices, while every other component stays small. Erdős and Rényi named this sudden change the 'double jump'.
[ … ]
Connectivity and a whole natural history
Pushing N higher, isolated vertices are the last obstacle to connectivity: around N ≈ (n/2)·ln n the last isolated vertex is absorbed and the graph becomes connected — almost exactly when its minimum degree first reaches 1. Isolated trees appear first (the larger the tree, the later it shows up), then the first cycles arrive together with the giant near mean degree one. The paper charts this whole sequence of thresholds, giving the first detailed natural history of the random graph.
Budapest · 1960