1 / 11

Diffusion in Disordered Media

Explore the relationship between average displacement and time in diffusion processes in random and disordered media. Discuss the behavior of blind and myopic ants, exact enumeration, and different computational methods for studying diffusion.

tanyamorris
Download Presentation

Diffusion in Disordered Media

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Diffusion in Disordered Media Nicholas Senno PHYS 527 12/12/2013

  2. Random Walk • Need to consider relationship between average displacement and time: <R2>  4Dt • Can define diffusion constant from properties of classical random walk. • However, because each cluster has different structure we need to average over many random walkers per cluster and then again over many clusters

  3. Blind Ant • Consider a random walker that can choose to move to any neighboring site with equal probability • If the move is possible it makes the move • If not the ant remains at the current location for the time step ? ? ? ?

  4. When p = pc the asymptotic behavior changes to <R2> ∝ t0.79

  5. Diffusion cannot occur for clusters generated with p < pc

  6. Myopic Ant • What if the ant can see which neighboring sites are available? • Then we can save some computational steps by allowing the ant to move every time.

  7. Exact Enumeration • So far we have considered averages over many walkers but what if consider the probability distribution of every random walk? • The probability of being at a cluster site i at a time t+1 (call this number Wt+1(i)) only depends on the probability of the neighboring sites at time t. • This makes exact enumeration a recursive algorithm not a Monte Carlo Simulation.

  8. Exact enumeration produces the same results as the myopic ant if enough clusters are averaged over.

  9. Diffusion In Random Media • It is possible to define a diffusion constant in analogy to the classical random walk • The blind ant, myopic ant, and exact enumeration methods all give similar results but the implantation of each increases in complexity • The Monte Carlo simulations are good for large systems that scale well while the Recursive approach is better for smaller work stations.

More Related