Chemical Engineering 160/260 Polymer Science and Engineering. Lecture 7 - Statistics of Chain Copolymerization January 31, 2001

Similar documents
CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

6.003 Homework #3 Solutions

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

+ au n+1 + bu n = 0.)

The Random Walk For Dummies

2.4 - Sequences and Series

ECE 308 Discrete-Time Signals and Systems

STAT Homework 1 - Solutions

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

Lecture 19: Convergence

B Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets

Chapter 7: The z-transform. Chih-Wei Liu

Lecture Chapter 6: Convergence of Random Sequences

Math 155 (Lecture 3)

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Chemical Engineering 160/260 Polymer Science and Engineering. Model for Polymer Solutions February 5, 2001

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Probability Refresher and Cycle Analysis. Spring 2018 CS 438 Staff, University of Illinois 1

An Introduction to Randomized Algorithms

The Binomial Theorem

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP

Introduction to Probability. Ariel Yadin. Lecture 2

Generalized Semi- Markov Processes (GSMP)

Injections, Surjections, and the Pigeonhole Principle

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Some discrete distribution

1 Lecture 2: Sequence, Series and power series (8/14/2012)

The target reliability and design working life

Series Review. a i converges if lim. i=1. a i. lim S n = lim i=1. 2 k(k + 2) converges. k=1. k=1

CS284A: Representations and Algorithms in Molecular Biology

Simulation of Discrete Event Systems

Massachusetts Institute of Technology

B. Maddah ENMG 622 ENMG /27/07

Econ 371 Exam #1. Multiple Choice (5 points each): For each of the following, select the single most appropriate option to complete the statement.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

THE SYSTEMATIC AND THE RANDOM. ERRORS - DUE TO ELEMENT TOLERANCES OF ELECTRICAL NETWORKS

STA6938-Logistic Regression Model

Topic 5: Basics of Probability

The Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1

Singular Continuous Measures by Michael Pejic 5/14/10

PROBABILITY LOGIC: Part 2

5.6 Absolute Convergence and The Ratio and Root Tests

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Basics of Probability Theory (for Theory of Computation courses)

Large Deviations in Quantum Information Theory

1 Introduction to Sequences and Series, Part V

As stated by Laplace, Probability is common sense reduced to calculation.

Math 475, Problem Set #12: Answers

AMS570 Lecture Notes #2

Analytic Theory of Probabilities

Spectral Partitioning in the Planted Partition Model

Advanced Stochastic Processes.

Lecture 5. Random variable and distribution of probability

All Excuses must be taken to 233 Loomis before 4:15, Monday, April 30.

1 Convergence in Probability and the Weak Law of Large Numbers

METRO EAST EDUCATION DISTRICT NATIONAL SENIOR CERTIFICATE GRADE 12 MATHEMATICS PAPER 1 SEPTEMBER 2014

Mechanical Efficiency of Planetary Gear Trains: An Estimate

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

Module 1 Fundamentals in statistics

Bertrand s Postulate

Lecture 1 Probability and Statistics

Approximations and more PMFs and PDFs

Lecture 4. Random variable and distribution of probability

Markov Decision Processes

Lecture 14: Graph Entropy

A queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service,

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

New Correlation for Calculating Critical Pressure of Petroleum Fractions

Lecture 15: Strong, Conditional, & Joint Typicality

Integer Programming (IP)

Three State Markov Chain Approach On the Behavior Of Rainfall

The variance of a sum of independent variables is the sum of their variances, since covariances are zero. Therefore. V (xi )= n n 2 σ2 = σ2.

Lecture 1 Probability and Statistics

Please do NOT write in this box. Multiple Choice. Total

The Poisson Distribution

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2

Comparison of Minimum Initial Capital with Investment and Non-investment Discrete Time Surplus Processes

SINGLE-CHANNEL QUEUING PROBLEMS APPROACH

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

Sequences. Notation. Convergence of a Sequence

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues

Roger Apéry's proof that zeta(3) is irrational

Lecture 7: Properties of Random Samples

6.041/6.431 Spring 2009 Final Exam Thursday, May 21, 1:30-4:30 PM.

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).

Complex Stochastic Boolean Systems: Generating and Counting the Binary n-tuples Intrinsically Less or Greater than u

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Unit 4: Polynomial and Rational Functions

Pell and Lucas primes

Entropies & Information Theory

Analysis of composites with multiple rigid-line reinforcements by the BEM

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2

Transcription:

Chemical Egieerig 60/60 Polymer Sciece ad Egieerig Lecture 7 - Statistics of Chai Copolymerizatio Jauary 3, 00

Objectives! To determie the compositioal relatioships betwee lower ad higher order sequeces of uits i a two- compoet copolymer.! To evaluate the coditioal probability i terms of the simple probabilities of occurrece of sequeces of differet orders.! To demostrate how probability theory may be used to develop iformatio about local structure i copolymers,, e.g, average sequece legth.

Outlie! Relatioships betwee simple ad coditioal probability! Evaluatio of microstructure " Markovia statistics Beroullia or radom statistics Termial model Peultimate model " Departure from radom statistics " Number fractio of sequeces of uits " Number average legth of or B rus

Defiitios of Probability Simple probability: P {} N N The simple probability of evet occurrig is just the relative fractio of evets compared to the total umber of evets. Coditioal probability: PB { / } PB { / } N N B PB { } P {} The coditioal probability of evet B occurrig give that has preceded it is just the ratio of the umber of compoud B evets to the umber of simple evets.

Relatioships Betwee Lower ad Higher Order Sequeces: Moad/Diad P{} + P{} B Moad mole fractios sum to. Cosider successor/predecessor relatios: P{} P{ } + P{ B} P{ } + P{ B} P{} B P{ BB} + P{ B} P{ BB} + P{ B} P{ B} P{ B] This is the Priciple of Microscopic Reversibility. Cosider diad mole fractios: P { } + P { B} + P { BB}

Relatioship Betwee Lower ad Higher Order Sequeces: Diad/Triad P { } P{ } + P{ B} P{ } + P{ B} 3 3 3 3 P { B} P{ B} + P{ BB} P{ B} + P{ BB} 3 3 3 3 P { B} P{ B} + P{ BB} P{ B} + P{ BB} 3 3 3 3 P { BB} P{ BB} + P{ BBB} P{ BB} + P{ BBB} 3 3 3 3 P{ B} P{ B} 3 3 P{ BB} P{ BB} 3 3 microscopic reversibility (equal to mirror image) Cosider triad mole fractios: P{ } + P{ B} + P{ B} + P{ BB} + P{ BB} + P{ BBB} 3 3 3 3 3 3

Coditioal ad Simple Probabilities Coditioal probability: Simple probability: PX { / XX X} L + P{ } P{ } P{ / } P{ B} P{ B} P{ / B} P{ } P{ } P{ / } P{ / } 3 P{ B} P{ B} P{ / B} P{ / B} 3

Coditioal Probability i Terms of Ratios of Simple Probabilities P { / } P { / B} PB { / } PB { / B} P { } P{} P { B} P{} B P { B} P{} P { BB} P{} B Moad fractios may be determied from elemetal aalysis. Diad, triad, tetrad, ad petad fractios may be determied from NMR.

Coditioal Probability i Terms of Ratios of Simple Probabilities P { / } P { / B} P { / B} P { / BB} { } P{ } { B} P{ B} { B} P{ B} { BB} P{ BB} PB { / } PB { / B} PB { / B} PB { / BB} { B} P{ } { BB} P{ B} { BB} P{ B} { BBB} P{ BB} Use NMR to determie all triad ad diad fractios.

Probability Sums P { / } + PB { / } P { / B} + BBB { / } P{ / } + P{ B / } P{ / B} + P{ B / B} P{ / B} + P{ B / B} P{ / BB} + P{ B / BB}

Coditioal Probability of Differet Orders If the probability of fidig a particular sequece of uits depeded upo every oe of the precedig (-) uits, the umber fractio of the -uit sequece would be: P{ } P{ } P{ / } P{ / } LP{ / } If the local chemical iteractios oly ifluece reactivity over a sequece legth of k uits, the umber fractio of the -uit sequece would be: P{ } P{ } P{ / } k k k

Coditioal Probability of Differet Orders The umber fractio of a sequece of uits for a kth order Markovia process is give by: P{ } P{ } P{ / } k k k Zero-order Markovia statistics: k 0 P{ } ( P{ }) First-order Markovia statistics: (Beroulia or radom statistics) (Termial model) k P P P { } { }( { / }) Secod-order Markovia statistics: (Peultimate model) k P P P { } { }( { / })

Example: the sequece BB Beroullia statistics (radom model): P { BB} P{} P{} B P{} P{} B P{} 5 3 P { BB} ( P{ }) ( P{ B}) 5 First-order Markovia statistics (termial model): P { BB} P{ } P{ B / } P{ / B} P{ B / } P{ / B} 5 P { BB} P{ }( P{ B / }) ( P{ / B}) 5 Secod-order Markovia statistics (peultimate model): P { BB} P { B} P{ / B} P{ B / B} P{ / B} 5 P { BB} P { B}( P{ / B}) P{ B / B} 5

Measure of the Departure from Radom Statistics χ P B { } P{} P{} B χ χ > χ χ < χ 0 Completely radom copolymer Copolymer with a alteratig tedecy Completely alteratig copolymer Copolymer with a blockig tedecy Completely block copolymer

Number Fractio of Sequeces of Uits N ( ) P + P+ { B B} { B B} P+ { BB} { BB} + P4{ BB} + P5 { BB} + L P+ { BB} P { B} N ( ) Sequeces of uits must be preceded ad succeeded by at least oe B uit. P + ll possible cotributios from B diads will be icluded i the sum. { BB} P{ B} For example, N( ) 3 5 P { BB} P{ B}

Number verage Legth of or B Rus l N N ( ) ( ) Use the umber distributio fuctio for the sequece legth to evaluate the average legth. N ( ) P + { BB} P{ B} Number distributio fuctio N ( ) l P+ { BB} P{ B}

Number verage Legth of or B Rus l P+ { BB} P{ B} P+ { BB} { BB} + P { BB} + 3 P { BB} + L 4 5 P+ { BB} P { } l P{} P{ B} l P {} B B P{ B} ll uits will be icluded i the sum. Recall that P{ B} P{ B}