clustering effects in ga asbi
play

Clustering Effects in Ga(AsBi) Sebastian Imhof 07/15/2010 - PowerPoint PPT Presentation

Jan 20, 2023 •208 likes •404 views

Clustering Effects in Ga(AsBi) Sebastian Imhof 07/15/2010 Technische Universitt Chemnitz, Germany Motivation: S-Shape Imhof et al., Appl. Phys. Lett. 96, 131115 (2010) Outline Photoluminescence in disorderd semiconductors Kinetic

  1. Clustering Effects in Ga(AsBi) Sebastian Imhof 07/15/2010 Technische Universität Chemnitz, Germany

  2. Motivation: S-Shape Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

  3. Outline ● Photoluminescence in disorderd semiconductors ● Kinetic Monte-Carlo simulation ● Experimental results ● Two scale approach for Ga(AsBi) ● Conclusion and outlook

  4. Disorder Model ● Localized states Mobility randomly distributed edge Exciton in space X ● N 0 : Area density of localized states E ● α : Exciton localization radius ● Energies given by a certain distribution function

  5. Hopping of Excitons ● Excitons can move Mobility among localized edge states ● Motion of excitons X independent in the E case of low densities X ● Excitons can decay radiatively

  6. Hopping of Excitons ● Hopping transition Mobility given by Miller- edge Abrahams Indices ● Excitons can decay X with life time E

  7. Hopping of Excitons ● Hopping transition Mobility given by Miller- edge Abrahams Indices ● Excitons can decay X with life time E ● Decay rate of exciton on ith site: ● Dynamic of exciton: ● Spectra depend on three parameters:

  8. Explanation of the S-Shape 3 1 E 3 2 1 2

  9. Kinetic Monte-Carlo Simulation 1.Calculate energies and positions of localized states 2.Choose start position of exciton randomly 3.Calculate hopping rates 4.Decide whether exciton decays or performs a hop ● Decay: save the energy and restart with a new exciton ● Hopping transition: Go to step 3

  10. Ga(AsBi) Sample Properties ● Thickness ~30nm ● Bi content: 4% - 5% ● Substrate: GaAs ● MBE-grown Grown by: T. Tiedje D. Beaton Univ. of Victoria, Kanada Univ. of British Columbia, Kanada X. Lu Arizona State University, USA

  11. Experimental results I ● Band gap from linear absorption spectrum around 1.2 eV Stokes-Shift ● Gaussian shaped density of states at low energy tail Imhof et al., Appl. Phys. Lett. 96, 131115 (2010) Experiments done by A. Chernikov, K. Kolata, N. Köster, M. Koch, S. Chatterjee Philipps University Marburg, Germany

  12. Experimental results II ● Zero-temperature Stokes- shift excitation power dependent ● Maximal Stokes-shift around 110 K ● Finite Stokes-shift at high temperatures ● Disorder effects still present at high temperatures Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

  13. Experimental results III ● Very broad PL spectra, FWHM at T=0 around 70meV ● PL linewidth at T=0 excitation power independent ● FWHM has maximum at 140 K ● Sign of exponential DOS Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

  14. Summary: Experimental results ● Gaussian shaped low energy tail of linear absorption spectra ● Sign of Gaussian DOS ● Maximum Stokes-shift at T=110 K and maximum FWHM at T=140 K ● Sign of exponential DOS with energy scale of 11 meV ● Disorder effects still present at high temperatures ● Inconsistent with energy scale of 11 meV

  15. Two energy scales ● Alloy disorder of CB Bi only affects the valence band ● Gaussian distribution E ● Additional Bi- Cluster sites beyond the VB valence band ● Exponential distribution

  16. Experiment-Theory Comparison Stokes-Shift Experiment Theory Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

  17. Experiment-Theory Comparison FWHM Experiment Theory Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

  18. Conclusion and Outlook ● Experimental spectra show both, Gaussian and exponential behavior of DOS ● Spectra can be fitted using the approach of two energy scales ● Next steps: ● Time dependent photoluminescence spectra ● Analysis of systematic sample series

  19. Acknowledgements D. Beaton C. Wagner and A. Thränhardt University of British Columbia, Chemnitz Technical University, Kanada Germany T. Tiedje A. Chernikov, K. Kolata, N. Köster, University of Victoria, Kanada M. Koch, S. Chatterjee and S.W. Koch O. Rubel Philipps University Marburg, Lakehead University, Kanada Germany X. Lu and S. Johnson Arizona State University, USA Further Details: Imhof et al., Appl. Phys. Lett. 96, 131115 (2010)

Recommend

Hierarchically clustering time-directed graphs and the effects of teleportation and memory Jevin

Hierarchically clustering time-directed graphs and the effects of teleportation and memory Jevin

Hierarchically clustering time-directed graphs and the effects of teleportation and memory Jevin West, Information School, University of Washington Network Clustering Graph Partitioning Community Detection Block Models Module Detection

789 views • 52 slides
Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering?

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering?

Lecture 23: Spectral clustering Hierarchical clustering What is a good clustering? Aykut Erdem May 2016 Hacettepe University Last time K-Means An iterative clustering algorithm - Initialize: Pick K random points as cluster

932 views • 64 slides
Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and

Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and

Clustering Hierarchical clustering, k-mean clustering Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity

772 views • 40 slides
EFFECTS OF PLY CLUSTERING IN LAMINATED COMPOSITE PLATES UNDER LOW-VELOCITY IMPACT LOADING E.V.

EFFECTS OF PLY CLUSTERING IN LAMINATED COMPOSITE PLATES UNDER LOW-VELOCITY IMPACT LOADING E.V.

18 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS EFFECTS OF PLY CLUSTERING IN LAMINATED COMPOSITE PLATES UNDER LOW-VELOCITY IMPACT LOADING E.V. Gonzlez 1 *, P. Maim 1 , P.P. Camanho 2 , A. Turon 1 , J. Costa 3 1 Department of Engineering

541 views • 6 slides
Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns

Graph Clustering Graph Clustering What is clustering? What is clustering? Finding patterns in data, or grouping similar groups of data-points together into clusters . Clustering algorithms for numeric data: Lloyds K-means, EM

688 views • 19 slides
Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics

Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics

Clustering Hierarchical clustering and k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity and high separation Many

768 views • 43 slides
Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find

Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find

Clustering DSE 210 Clustering in R d Two common uses of clustering: Vector quantization Find a finite set of representatives that provides good coverage of a complex, possibly infinite, high-dimensional space. Finding meaningful

396 views • 36 slides
Clustering: Hierarchical Clustering and K- Means Clustering Machine

Clustering: Hierarchical Clustering and K- Means Clustering Machine

Clustering: Hierarchical Clustering and K- Means Clustering Machine Learning 10-601B Seyoung Kim Many of these slides are derived from William Cohen,

660 views • 46 slides
Clustering and Dimensionality Reduction Preview Clustering K -means clustering

Clustering and Dimensionality Reduction Preview Clustering K -means clustering

Clustering and Dimensionality Reduction Preview Clustering K -means clustering Mixture models Hierarchical clustering Dimensionality reduction Principal component analysis Multidimensional scaling Isomap

1.61k views • 17 slides
Clustering A Categorization of Major Clustering Methods Partitioning Methods

Clustering A Categorization of Major Clustering Methods Partitioning Methods

Clustering What is Clustering? Types of Data in Cluster Analysis Clustering A Categorization of Major Clustering Methods Partitioning Methods Hierarchical Methods 1 2 What is Clustering? What is Clustering? Typical

647 views • 18 slides
Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative

Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative

LUDWIG- MAXIMILIANS- INSTITUTE DATABASE UNIVERSITT FOR SYSTEMS MNCHEN MNCHEN INFORMATICS INFORMATICS GROUP GROUP Subspace Clustering Ensemble Clustering Subspace Clustering, Ensemble Clustering, Alternative Clustering, Multiview

513 views • 9 slides
Wavelet-based clustering for mixed-effects functional models in high dimension. Franck Picard,

Wavelet-based clustering for mixed-effects functional models in high dimension. Franck Picard,

Wavelet-based clustering for mixed-effects functional models in high dimension. Franck Picard, LBBE - Lyon Madison Giacofci LJK (Grenoble) Sophie Lambert-Lacroix (TIMC - Grenoble) Guillemette Marot (Univ. Lille 2) F. Picard (LBBE) SSB -

537 views • 34 slides
Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering

Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering

Finding Clusters Types of Clustering Approaches: Linkage Based, e.g. Hierarchical Clustering Clustering by Partitioning, e.g. k-Means Density Based Clustering, e.g. DBScan Grid Based Clustering Compendium slides for Guide to Intelligent

1.32k views • 82 slides
Introduction to Machine Learning, Clustering and EM Barnab s P czos Contents Clustering

Introduction to Machine Learning, Clustering and EM Barnab s P czos Contents Clustering

Introduction to Machine Learning, Clustering and EM Barnab s P czos Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 2 Clustering 3 K- means clustering What is clustering?

1.32k views • 66 slides
The effects of assembly bias on galaxy clustering predictions Arnau Pujol, Enrique Gaztaaga

The effects of assembly bias on galaxy clustering predictions Arnau Pujol, Enrique Gaztaaga

The effects of assembly bias on galaxy clustering predictions Arnau Pujol, Enrique Gaztaaga Marseille, July 15th, 2014 Pujol & Gaztaaga 2014, MNRAS, 442, 1939 Pujol et al. 2014, MNRAS, 438, 3205 Institut dEstudis Espacials de

189 views • 16 slides
PAC-Bayesian Analysis of Co-clustering, Graph Clustering and Pairwise Clustering Yevgeny Seldin

PAC-Bayesian Analysis of Co-clustering, Graph Clustering and Pairwise Clustering Yevgeny Seldin

PAC-Bayesian Analysis of Co-clustering, Graph Clustering and Pairwise Clustering Yevgeny Seldin Motivation Example Clustering cannot be analyzed without specifying what it will be used for! be used for! Example Cluster then pack

293 views • 28 slides
Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means

Clustering kMeans, Expectation Maximization, Self-Organizing Maps Outline K-means clustering Hierarchical clustering Incremental clustering Probability-based clustering Self-Organising Maps Classification vs. Clustering

1k views • 67 slides
Chapter 7: Clustering (Unsupervised Data Organization) 7.1 Hierarchical Clustering 7.2 Flat

Chapter 7: Clustering (Unsupervised Data Organization) 7.1 Hierarchical Clustering 7.2 Flat

Chapter 7: Clustering (Unsupervised Data Organization) 7.1 Hierarchical Clustering 7.2 Flat Clustering 7.3 Embedding into Vector Space for Visualization 7.4 Applications Clustering: unsupervised grouping (partitioning) of objects into

763 views • 49 slides
Graph Clustering Why graph clustering is useful? Distance matrices are graphs as useful as

Graph Clustering Why graph clustering is useful? Distance matrices are graphs as useful as

Graph Clustering Why graph clustering is useful? Distance matrices are graphs as useful as any other clustering Identification of communities in social networks Webpage clustering for better data management of web data Outline

607 views • 41 slides
Clustering: Models and Algorithms Shikui Tu 2019-02-28 1 Outline Clustering K-mean

Clustering: Models and Algorithms Shikui Tu 2019-02-28 1 Outline Clustering K-mean

Clustering: Models and Algorithms Shikui Tu 2019-02-28 1 Outline Clustering K-mean clustering, hierarchical clustering Adaptive learning (online learning) CL, FSCL, RPCL Gaussian Mixture Models (GMM)

805 views • 34 slides
Web Information Retrieval Lecture 15 Clustering Todays Topic: Clustering Document

Web Information Retrieval Lecture 15 Clustering Todays Topic: Clustering Document

Web Information Retrieval Lecture 15 Clustering Todays Topic: Clustering Document clustering Motivations Document representations Success criteria Clustering algorithms Partitional Hierarchical Ch. 16 What is

766 views • 61 slides
LECTURE 7 Clustering The k-means algorithm Hierarchical Clustering The DBSCAN algorithm

LECTURE 7 Clustering The k-means algorithm Hierarchical Clustering The DBSCAN algorithm

DATA MINING LECTURE 7 Clustering The k-means algorithm Hierarchical Clustering The DBSCAN algorithm Clustering Evaluation What is a Clustering? In general a grouping of objects such that the objects in a group (cluster) are similar (or

1.39k views • 110 slides
Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review

Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review

Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity and high separation Clustering (unsupervised) vs.

526 views • 30 slides
Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review

Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review

Clustering k-mean clustering Genome 373 Genomic Informatics Elhanan Borenstein A quick review The clustering problem: partition genes into distinct sets with high homogeneity and high separation Clustering (unsupervised) vs.

356 views • 31 slides

More recommend