![Page 1: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/1.jpg)
MASSIMO FRANCESCHETTIUniversity of California at Berkeley
Phase transitions an engineering perspective
![Page 2: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/2.jpg)
when small changes in certain parameters of a system result in dramatic shifts in some globally observed behavior of the system.
Phase transition effect
![Page 3: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/3.jpg)
Can we mathematically explain these naturally observed effects?
Phase transition effect
![Page 4: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/4.jpg)
Example 1percolation theory, Broadbent and Hammersley (1957)
![Page 5: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/5.jpg)
Example 1
cp Broadbent and Hammersley (1957)
2
1cp H. Kesten (1980)
pc0 p
P1
![Page 6: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/6.jpg)
if graphs with p(n) edges are selected uniformly at random from the set of n-vertex graphs, there is a threshold function, f(n) such that if p(n) < f(n) a
randomly chosen graph almost surely has property Q; and if p(n)>f(n), such a graph is very unlikely
to have property Q.
Example 2Random graphs, Erdös and Rényi (1959)
![Page 7: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/7.jpg)
Uniform random distribution of points of density λ
One disc per pointStudies the formation of an unbounded connected component
Example 3Continuum percolation, Gilbert (1961)
![Page 8: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/8.jpg)
Example 3Continuum percolation, Gilbert (1961)
The first paper in ad hoc wireless networks !
A
B
![Page 9: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/9.jpg)
0.3 0.4
c0.35910…[Quintanilla, Torquato, Ziff, J. Physics A, 2000]
Example 3
![Page 10: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/10.jpg)
Gilbert (1961)
Mathematics Physics
Percolation theoryRandom graphs
Random Coverage ProcessesContinuum Percolation
Wireless Networks (more recently)Gupta and Kumar (1998)Dousse, Thiran, Baccelli (2003)Booth, Bruck, Franceschetti, Meester (2003)
Models of the internetImpurity ConductionFerromagnetism…
Universality, Ken Wilson Nobel prize
Grimmett (1989)Bollobas (1985)
Hall (1985)Meester and Roy (1996)
Broadbent and Hammersley (1957) Erdös and Rényi (1959)
Phase transitions in graphs
![Page 11: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/11.jpg)
Not only graphs…
![Page 12: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/12.jpg)
Example 4Shannon channel coding theorem (1948)
C H(x)
H(x|y)
Attainable region
H(x|y)=H(x)-C
noise
source coding decoding destination
![Page 13: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/13.jpg)
Example 5“The uncertainty threshold principle, some fundamental limitations
of optimal decision making under dynamic uncertainty”Athans, Ku, and Gershwin (1977)
1 T
...2,1,''min0
tuRuxQx
TEJ ttt
tt
ut
1
xy
BuAxx
tt
tttttt
An optimal solution for exists
T
/1|)(|max Aii
![Page 14: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/14.jpg)
Our work
Kalman filtering over a lossy networkJoint work withB. SinopoliL. SchenatoK. Poolla M. JordanS. Sastry
Two new percolation modelsJoint work withL. Booth J. BruckM. CookR. Meester
![Page 15: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/15.jpg)
Clustered wireless networks
Extending Gilbert’s continuum percolation model
![Page 16: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/16.jpg)
Contribution
Random point
process
Algorithm Connectivity
Algorithm: each point is covered by at least a disc and each disc covers at least a point.
Algorithmic Extension
![Page 17: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/17.jpg)
![Page 18: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/18.jpg)
A Basic Theorem
0
λ
P
λ2λ1
1
r
R
2iffor any covering algorithm, with probability one.
, then for high λ, percolation occurs
P = Prob(exists unbounded connected component)
![Page 19: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/19.jpg)
A Basic Theorem
0
λ
P
1
r
R
P = Prob(exists unbounded connected component)
2if some covering algorithm may avoidpercolation for any value of λ
![Page 20: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/20.jpg)
2r
R Percolation any algorithm
One disc per point 0rNote:
PercolationGilbert (1961)
Need Only
Interpretation
![Page 21: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/21.jpg)
Counter-intuitive
For any covering of the points covering discs will be close to each other and will form bonds
![Page 22: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/22.jpg)
A counter-example
Draw circles of radii {3kr, k }
many finite annuliobtain
no Poisson point falls on the boundaries of the annuli
cover the points without touching the boundaries
2r
R
2r
![Page 23: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/23.jpg)
Each cluster resides into a single annulus
Cluster, whatever
A counter-example 2r
R
2r
![Page 24: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/24.jpg)
counterexample can be made shift invariant(with a lot more work)
A counter-example
![Page 25: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/25.jpg)
2r
R
cannot cover the points with red discs without blue discs touching the boundaries of the annuli
Counter-example does not work
![Page 26: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/26.jpg)
Proof by lack of counter-example?
![Page 27: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/27.jpg)
Coupling proofLet R > 2r
R/2
r
disc small enough, such thatDefinered disc intersects the disc blue disc fully covers it
![Page 28: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/28.jpg)
Coupling proofLet R > 2r
choose c(),then cover points with red discs
disc small enough, such thatDefinered disc intersects the disc blue disc fully covers it
![Page 29: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/29.jpg)
Coupling proof
every disc is intersected by a red disctherefore all discs are covered by blue discs
![Page 30: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/30.jpg)
Coupling proof
every disc is intersected by a red disctherefore all discs are covered by blue discsblue discs percolate!
![Page 31: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/31.jpg)
2r
Rsome algorithms may avoid percolation
Bottom line
2r
Reven algorithms placing discs on a gridmay avoid percolation
Be careful in the design!
2r
Rany algorithm percolates, for high
![Page 32: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/32.jpg)
Which classes of algorithms, for form an unbounded
connected component, a.s. ,when is high?
2
![Page 33: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/33.jpg)
Classes of Algorithms
•Grid•Flat•Shift invariant•Finite horizon•Optimal
Recall Ronald’s lecture(… or see paper)
![Page 34: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/34.jpg)
Another extension of percolationSensor networks with noisy links
![Page 35: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/35.jpg)
Prob(correct reception)
Experiment
![Page 36: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/36.jpg)
1
Connectionprobability
d
Continuum percolationContinuum percolation
2r
Our modelOur model
d
1
Connectionprobability
Connectivity model
![Page 37: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/37.jpg)
Connectionprobability
1
x
A first order question
How does the percolation threshold cchange?
![Page 38: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/38.jpg)
Squishing and Squashing
Connectionprobability
x
) ()( xpgpxgs
)(xg
2
)())((x
xgxgENC
))(())(( xgsENCxgENC
![Page 39: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/39.jpg)
2
)(0x
xg
Theorem
))(())(( xgsxg cc
For all
“longer links are trading off for the unreliability of the connection”
“it is easier to reach connectivity in an unreliable network”
![Page 40: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/40.jpg)
Shifting and Squeezing
Connectionprobability
x
)(
0
1
)()(
))(()(yhs
s
y
dxxxgxdxxgss
xhgxgss
)(xg
2
)())((x
xgxgENC
))(())(( xgssENCxgENC
)(xgss
![Page 41: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/41.jpg)
Example
Connectionprobability
x
1
![Page 42: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/42.jpg)
Mixture of short and long edges
Edges are made all longer
Do long edges help percolation?
![Page 43: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/43.jpg)
2
)(0x
xg
Conjecture
))(())(( xgssxg cc
For all
![Page 44: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/44.jpg)
Theorem
Consider annuli shapes A(r) of inner radius r, unit area, and critical density
For all , there exists a finite , such that A(r*) percolates, for all )(0 * rc rr *
)(rc*
It is possible to decrease the percolation threshold by taking a sufficiently large shift !
![Page 45: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/45.jpg)
CNP
Squishing and squashing Shifting and squeezing
What have we proven?
![Page 46: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/46.jpg)
CNP
Among all convex shapes the hardest to percolate is centrally symmetricJonasson (2001), Annals of Probability.
Is the disc the hardest shape to percolate overall?
What about non-circular shapes?
![Page 47: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/47.jpg)
CNP
To the engineer: above 4.51 we are fine!To the theoretician: can we prove “disc is hardest” conjecture?
can we exploit long links for routing?
Bottom line
![Page 48: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/48.jpg)
Not only graphs…
![Page 49: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/49.jpg)
A pursuit evasion game
![Page 50: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/50.jpg)
A pursuit evasion game
![Page 51: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/51.jpg)
A pursuit evasion game
![Page 52: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/52.jpg)
A pursuit evasion game
![Page 53: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/53.jpg)
A pursuit evasion game
![Page 54: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/54.jpg)
A pursuit evasion game
![Page 55: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/55.jpg)
A pursuit evasion game
![Page 56: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/56.jpg)
A pursuit evasion game
![Page 57: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/57.jpg)
A pursuit evasion game
![Page 58: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/58.jpg)
A pursuit evasion game
![Page 59: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/59.jpg)
A pursuit evasion game
![Page 60: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/60.jpg)
A pursuit evasion game
![Page 61: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/61.jpg)
A pursuit evasion game
![Page 62: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/62.jpg)
• Goal: given observations find the best estimate (minimum variance) for the state
• But may not arrive at each time step when traveling over a sensor network
Intermittent observations
Problem formulation
![Page 63: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/63.jpg)
System
Kalman Filter
M
z-1
ut
et
xt
M
z-1
K+
+
+
-
xt+1
yt+1
![Page 64: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/64.jpg)
• Discrete time LTI system
• and are Gaussian random variables with zero mean and covariance matrices Q and R positive definite.
Loss of observation
![Page 65: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/65.jpg)
• Discrete time LTI system
Let it have a “huge variance” when the observation does not arrive
Loss of observation
![Page 66: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/66.jpg)
• The arrival of the observation at time t is a binary random variable
• Redefine the noise as:
Kalman Filter with losses
Derive Kalman equations using a “dummy” observation when
then take the limit for
t=0
![Page 67: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/67.jpg)
Results on mean error covariance Pt
ci
cPt
ctt
PtMPE
PPE
||max
11
0condition initialany and 1for ][
0condition initial some and 0for ][lim
0
0
0
![Page 68: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/68.jpg)
Special cases
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 10
10
20
30
40
50
60
70
80
90
100S,
V
c
C is invertible, or A has a single unstable eigenvalue
![Page 69: MASSIMO FRANCESCHETTI University of California at Berkeley Phase transitions an engineering perspective](https://reader038.vdocuments.us/reader038/viewer/2022110322/56649d565503460f94a3501d/html5/thumbnails/69.jpg)
Conclusion• Phase transitions are a fundamental effect in
engineering systems with randomness• There is plenty of work for mathematicians