Scaling forms for Relaxation Times of the Fiber Bundle Model S. S. Manna In collaboration with C. Roy,S. Kundu and S. Pradhan Satyendra Nath Bose National.

Slides:



Advertisements
Similar presentations
Probability Distributions CSLU 2850.Lo1 Spring 2008 Cameron McInally Fordham University May contain work from the Creative Commons.
Advertisements

Normal Strain and Stress
Lecture 3 Nonparametric density estimation and classification
Chapter 2 Discrete Random Variables
1 Universality Classes of Constrained Crack Growth Name, title of the presentation Alex Hansen Talk given at the Workshop FRACMEET, Institute for Mathematical.
1 Finite-Length Scaling and Error Floors Abdelaziz Amraoui Andrea Montanari Ruediger Urbanke Tom Richardson.
Engineering Probability and Statistics - SE-205 -Chap 4 By S. O. Duffuaa.
Maximum likelihood (ML) and likelihood ratio (LR) test
CONTINUOUS RANDOM VARIABLES These are used to define probability models for continuous scale measurements, e.g. distance, weight, time For a large data.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 71 Chapter 1 Linear Equations and.
Probability Distributions
Stat 245 Recitation 11 10/25/2007 EA :30am TA: Dongmei Li.
Excellence Justify the choice of your model by commenting on at least 3 points. Your comments could include the following: a)Relate the solution to the.
Chapter 6 The Normal Distribution and Other Continuous Distributions
Probability Distributions Random Variables: Finite and Continuous Distribution Functions Expected value April 3 – 10, 2003.
APPLICATIONS OF DIFFERENTIATION 4. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.
Maximum likelihood (ML)
Copyright © Cengage Learning. All rights reserved. 4 Continuous Random Variables and Probability Distributions.
CHAPTER #3 SHEAR FORCE & BENDING MOMENT
NAZARIN B. NORDIN What you will learn:
Analyzing Graphs of Polynomials Section 3.2. First a little review… Given the polynomial function of the form: If k is a zero, Zero: __________ Solution:
Stat 1510: Introducing Probability. Agenda 2  The Idea of Probability  Probability Models  Probability Rules  Finite and Discrete Probability Models.
1 Statistical Analysis - Graphical Techniques Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering EMIS 7370/5370 STAT 5340 : PROBABILITY AND.
1 Preliminaries Precalculus Review I Precalculus Review II
Estimation Basic Concepts & Estimation of Proportions
Slide 1-1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
AP CALCULUS PERIODIC REVIEW. 1: Limits and Continuity A function y = f(x) is continuous at x = a if: i) f(a) is defined (it exists) ii) iii) Otherwise,
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
1 Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering EMIS 7370/5370 STAT 5340 : PROBABILITY AND STATISTICS FOR SCIENTISTS AND ENGINEERS Systems.
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
1 Chapter 5 Continuous Random Variables. 2 Table of Contents 5.1 Continuous Probability Distributions 5.2 The Uniform Distribution 5.3 The Normal Distribution.
Copyright © 2014, 2010 Pearson Education, Inc. Chapter 2 Polynomials and Rational Functions Copyright © 2014, 2010 Pearson Education, Inc.
Random-Graph Theory The Erdos-Renyi model. G={P,E}, PNP 1,P 2,...,P N E In mathematical terms a network is represented by a graph. A graph is a pair of.
In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The result was that the values.
McGraw-Hill/Irwin Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter 6 Continuous Random Variables.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
The zero-temperature non-equilibrium random-field Ising model (RFIM) has proven very successful in studying avalanches in disordered systems. The Hamiltonian.
Chapter Four Random Variables and Their Probability Distributions
Extreme value statistics Problems of extrapolating to values we have no data about Question: Question: Can this be done at all? unusually large or small.
Numerical Methods.
Stats Probability Theory Summary. The sample Space, S The sample space, S, for a random phenomena is the set of all possible outcomes.
UNIT 5.  The related activities of sorting, searching and merging are central to many computer applications.  Sorting and merging provide us with a.
CY1B2 Statistics1 (ii) Poisson distribution The Poisson distribution resembles the binomial distribution if the probability of an accident is very small.
Interval Notation Interval Notation to/from Inequalities Number Line Plots open & closed endpoint conventions Unions and Intersections Bounded vs. unbounded.
McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Continuous Random Variables Chapter 6.
Analyzing Graphs of Polynomials
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
Brief Review Probability and Statistics. Probability distributions Continuous distributions.
Chapter 4 Continuous Random Variables and Probability Distributions
Slide Copyright © 2009 Pearson Education, Inc. Slide Copyright © 2009 Pearson Education, Inc. Welcome to MM150 – Unit 4 Seminar Unit 4 Seminar.
Logistic regression. Recall the simple linear regression model: y =  0 +  1 x +  where we are trying to predict a continuous dependent variable y from.
Mathematical Modeling
Univariate Gaussian Case (Cont.)
Date: 1.2 Functions And Their Properties A relation is any set of ordered pairs. The set of all first components of the ordered pairs is called the domain.
Continuously Tunable Pareto Exponent in a Random Shuffling Money Exchange Model K. Bhattacharya, G. Mukherjee and S. S. Manna Satyendra Nath Bose National.
CHAPTER 4 ESTIMATES OF MEAN AND ERRORS. 4.1 METHOD OF LEAST SQUARES I n Chapter 2 we defined the mean  of the parent distribution and noted that the.
1 Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering EMIS 7370/5370 STAT 5340 : PROBABILITY AND STATISTICS FOR SCIENTISTS AND ENGINEERS Systems.
PLASTIC ANALYSIS OF BEAMS - SANDEEP DIGAVALLI. AT A GLANCE OF THIS TOPIC  BASIS OF PLASTIC THEORY  STRESS-STRAIN CURVE OF PLASTIC MATERIALS  STRESSES.
Univariate Gaussian Case (Cont.)
ONE DIMENSIONAL RANDOM VARIABLES
Engineering Probability and Statistics - SE-205 -Chap 4
Section 7.3: Probability Distributions for Continuous Random Variables
5.1 Introduction to Curve Fitting why do we fit data to a function?
CHAPTER 8 SHEAR FORCE & BENDING MOMENT
LECTURE 09: BAYESIAN LEARNING
Parametric Methods Berlin Chen, 2005 References:
Learning From Observed Data
Fig. 2 Patterns of impact during a scientific career.
The Normal Distribution
Generating Random Variates
Presentation transcript:

Scaling forms for Relaxation Times of the Fiber Bundle Model S. S. Manna In collaboration with C. Roy,S. Kundu and S. Pradhan Satyendra Nath Bose National Center for Basics Sciences, Kolkata SINTEF Petroleum Research, Trondheim, Norway FracMeet III, IMSc, Chennai, January, 2013

FIBER BUNDLE MODEL ● What is a fiber bundle? Fiber bundle models study breakdown properties of a bundle composed of a large number of N parallel elastic fibers. ● Arrangement All fibers of the bundle are rigidly clamped at one end and is externally loaded at the other end. The load is equally distributed among all fibers. ● Disorder Each fiber i has a breaking threshold b i of its own. If the stress acting through it exceeds b i the fiber breaks. The bi values are drawn from a distribution p(b) whose cumulative distribution is

● Suppose σ is the external load per fiber applied on a complete bundle. Then the fibers having breaking thresholds b i < σ would break. ● They release the total amount of stress that were acting through them. ● The released stress gets distributed among some other fibers. In the Equal Load Sharing (ELS) version the released stress is equally distributed among all intact fibers. ● This is one time step. ● If the new stress per fiber is σ’ then there will be another set of fibers which will break again and release stress. ● A cascade of such activities follows for T time steps which stops when the system reaches a stable state. ● A stable state may have (i) all fibers broken – supercritical state, (ii) n fibers broken when n < N – subcritical state. STRESS RELAXATION

SYSTEM RELAXES LONGER, CLOSER TO A SPECIFIC σ c ● An ensemble of many fiber bundles with same size N is considered, each has a different set of thresholds {b i }. ● The external load σ per fiber is applied on each bundle. ● The bundle relaxes for time T(σ,N) and its average is calculated, varying σ from 0 to 1/2, with Δσ = ● For uniformly distributed {b i }, curves for all three values of N show sharp peaks at or very close to σ c ≈ N = 10000, 30000,

CRITICAL LOAD σ c ● Each fiber is assigned a random breaking threshold b i that consists a set {b i }. These thresholds are drawn from a probability density p(b). Let p(b) be the uniform distribution: p(b)=1. ● Initially let the applied load be F and σ = F/N be the stress per fiber. ● All fibers with b i < σ break. Each broken fiber releases σ amount of stress. ● This stress is distributed equally to N[1 - P( σ)] intact fibers on the average. ● If x 1 be the stress per fiber after the first relaxation then F=Nx 1 [1 - P( σ)]. ● Therefore after successive relaxations we have F = Nx 1 [1 - P( σ)] = Nx 2 [1 - P(x 1 )] = Nx 3 [1 - P(x 2 )] = …… ● After T steps the process converges to a stable state when x T+1 – x T < 1/N. ● The applied load F on the bundle can be written as function of the stress x per fiber at the final state: F(x) = Nx[1 - P(x)] ● F(x) has a maximum at x c where dF/dx=0 1 - P(x c ) - x c p(x c ) = 0 ● With uniform distribution of p(x) = 1, x c = 1/2, F c = N/4 and therefore: σ c = 1/4.

NUMERICAL ESTIMATION OF σ c (N) ● An ensemble of fiber bundles, one member is α Let a fiber bundle with a specific sequence of breaking thresholds {b i } be denoted by α. ● Critical load of the bundle α Let σ α c (N) be the maximum value of the applied load σ per fiber in the subcritical phase. If σ is increased by a least possible amount to include only a single additional fiber the system crosses over to the supercritical phase. On the average this increment is 1/N. ● Bisection method Breaking threshold for the fiber α. Let σ sub and σ sup be the initial guesses for which the system is subcritical and supercritical respectively. For the same fiber α one tries σ = (σ sub + σ sup )/2; if the system is subcritical one makes σ sub = σ otherwise σ sup = σ. This is continued iteratively till σ sup - σ sub ≤ 1/N. At this stage: σ α c (N) = (σ sub + σ sup )/2. ● Averaging over many different bundles α: σ c (N) =.

FINITE SIZE CORRECTION AND EXTRAPOLATION ● Assume that the average value of the critical load σ c (N) for bundle size N converges to the asymptotic value σ c ( ∞ ) as: σ c (N) - σ c ( ∞ ) = A N -1/ ν ● Fig (a): Used σ c (∞) = 1/4 and 1/ν = to plot the data and then least sq. fit a straight line which is found to be: σ c (N) – 1/4 = x N -1/ ν. ● Fig (b): Plot of: [σ c (N) – 1/4]N against ln(N). We tried to make the middle portion horizontal, by tuning the exponent ν and the best value of 1/ν = 0.661

RELAXATION AWAY FROM THE CRITICAL POINT ● For every bundle α we first calculate the critical load σ α c and then for the same bundle calculate T(σ,N) for different values of | Δ σ| = | σ α c – σ | ● The limiting values of the relaxation times from both sides as | Δ σ| → 0 are distinctly different. ● The ratio of and approaches 2 as N →∞

RELAXATION TIME AT THE CRITICAL APPLIED LOAD ● For each bundle two different times T. ● T sub and T sup are the maximal relaxation times for the subcritical and supercritical phases. ● Plot and and with N for 2 8, 2 10, …., Assume: ~ N η ● Small curvature in the small N regime. ● Estimated slopes between successive pts. ● Plotted η (sub,N )-1/3 ~ N and η( sup,N )-1/3 ~ N The intercepts are and respectively. Conclusion: η ≈ 1/3

ANALYTICAL RESULTS FOR RELAXATION TIMES ● For supercritical phase σ > σ c T(σ, N) ≈ (π/2)(σ – σ c ) -1/2 ● For subcritical phase σ < σ c T(σ, N) ≈ (ln(N)/4)(σ c – σ) -1/2 S. Pradhan and P. C. Hemmer, Phys. Rev. E, 75, (2007).

RELAXATION AWAY FROM THE CRITICAL LOAD: PREVIOUS RESULTS S. Pradhan and P. C. Hemmer, Phys. Rev. E, 75, (2007). N = 2 20, 2 22, 2 24

RELAXATION AWAY FROM THE CRITICAL LOAD ● (a) [ /ln(N)] against [σ c (N) – σ] data collapse is not very well. ● (b) [ /N η ] against [σ c (N) – σ]N ζ collapse is good for small values of [σ c (N) – σ]N ζ with η = and ζ = /N η ~ G[{σ c (N) – σ}N ζ ] There are two regimes: ● A constant regime where / N η = C i.e., here ~ N -η This regime is extended to: [σ c (N) – σ]N ζ ~ 1 i.e., [σ c (N) – σ] ~ N - ζ ζ = 1/ν ● A power law regime which in N →∞ limit is G(y) ~ y -τ so that -τζ + η = 0 i. e., τ = η / ζ From the estimates of η and ζ τ = 0.50(1)

SUBCRITICAL STATESUPERCRITICAL STATE [ /N η ] ~ G[{σ c (N) – σ}N ζ ] with η = and ζ =

DETERMINISTIC FIBER BUNDLE (DFBM) MODEL ● A deterministic version of FB where the breaking thresholds are uniformly spaced: b i = n/N where n = 1, 2, 3, …., N. ● Plot of [σ c (N) – 1/4] with 1/N gives a nice straight line σ c (N) – 1/4 = -1.3x /N. ● Plot of [σ c (N) – 1/4]N against log(N) gives a nice st. line parallel to x-axis with the average value at (1). We conjecture: σ c (N) = 1/4 +1/(2N) i.e., the exponent ζ = 1.

DFBM: RELAXATION AT THE CRITICAL POINT ● Again two relaxation times are estimated. ● T sub (σ c (N),N) and T sup (σ c (N),N) are the relaxation times right before and right after the critical point, plotted with N on a log-log scale. ● The little curvature for small values of N is absent -- only a single slope for the entire range. T sub (σ c (N),N) ~ N η sub and T sup (σ c (N),N) ~ N η sup with η sub = and η sup = Our conjecture: η sub = η sup = 1/2, (ref. Pradhan and Hemmer)

DFBM: RELAXATION AWAY FROM CRITICALITY ● Relaxation times T( σ, N) are estimated for both subcritical and supercritical regimes. ● N = 2 18, 2 20, 2 22, 2 24 and ● Data collapse is obtained for a finite size scaling of: T( σ, N) / N 1/2 ~ G[(1/4 - σ)N] η = 1/2 and ζ = 1 implies τ = 1/2

P(b)σcσc νηζτ Uniform P(b) = b 0.250(1) 1/4 1.50(1) 3/ (5) 1/ (5) 2/3 0.50(1) 1/2 Weibull P(b) = 1-exp(-b 5 ) 0.593(1) (5e) -1/5 1.50(1) 3/ (5) 1/ (5) 2/3 0.50(1) 1/2 DFBM0.2500(1) 1/4 1.00(1) (1) 1/2 1.00(1) (1) 1/2 Numerical Estimates Exact Results Conjectures CRITICAL POINTS AND CRITICAL EXPONENTS Exact values are from: S. Pradhan and P. C. Hemmer, Phys. Rev. E, 75, (2007).

SUMMARY ● An extensive numerical analysis has been performed for revisiting the behavior of relaxation times of the ELS version of the Fiber Bundle model. ● It has been observed that the average critical load σ c (N) depends on the bundle size N and extrapolates to σ c = σ c ( ∞ ) = 1/4 as N in the limit of N →∞. ● The average relaxation time at the critical load grows as ~ N ● Away from the critical point, the relaxation times obey the finite-size scaling form: [ /N η ] ~ G[{σ c (N) – σ}N ζ ] at both subcritical and supercritical states with with η = and ζ = This implies that in the asymptotic limit of N →∞ T( σ, N) ~ |σ c – σ| -1/2. ● The deterministic fiber bundle model has different set of exponents.