3,899 research outputs found

    Impact of Auger processes on carrier dynamics in graphene

    Full text link
    The linear, gapless bandstructure of graphene provides ideal conditions for Auger processes. They are of great importance for fundamental research and technological applications, since they qualitatively change the carrier dynamics. Time-, momentum-, and angle-resolved microscopic calculations reveal an efficient impact excitation giving rise to a significant multiplication of optically excited carriers and a remarkable Coulomb- induced carrier cooling effect. We present an analytic expression for the carrier multiplication predicting ideal conditions for its still missing experimental observation

    Carrier Multiplication in Graphene

    Full text link
    Graphene as a zero-bandgap semiconductor is an ideal model structure to study the carrier relaxation channels, which are inefficient in conventional semiconductors. In particular, it is of fundamental interest to address the question whether Auger-type processes significantly influence the carrier dynamics in graphene. These scattering channels bridge the valence and conduction band allowing carrier multiplication - a process that generates multiple charge carriers from the absorption of a single photon. This has been suggested in literature for improving the efficiency of solar cells. Here we show, based on microscopic calculations within the density matrix formalism, that Auger processes do play an unusually strong role for the relaxation dynamics of photo-excited charge carriers in graphene. We predict that a considerable carrier multiplication takes place, suggesting graphene as a new material for high-efficiency solar cells and for high-sensitivity photodetectors

    Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand

    Full text link
    We study a class of robust network design problems motivated by the need to scale core networks to meet increasingly dynamic capacity demands. Past work has focused on designing the network to support all hose matrices (all matrices not exceeding marginal bounds at the nodes). This model may be too conservative if additional information on traffic patterns is available. Another extreme is the fixed demand model, where one designs the network to support peak point-to-point demands. We introduce a capped hose model to explore a broader range of traffic matrices which includes the above two as special cases. It is known that optimal designs for the hose model are always determined by single-hub routing, and for the fixed- demand model are based on shortest-path routing. We shed light on the wider space of capped hose matrices in order to see which traffic models are more shortest path-like as opposed to hub-like. To address the space in between, we use hierarchical multi-hub routing templates, a generalization of hub and tree routing. In particular, we show that by adding peak capacities into the hose model, the single-hub tree-routing template is no longer cost-effective. This initiates the study of a class of robust network design (RND) problems restricted to these templates. Our empirical analysis is based on a heuristic for this new hierarchical RND problem. We also propose that it is possible to define a routing indicator that accounts for the strengths of the marginals and peak demands and use this information to choose the appropriate routing template. We benchmark our approach against other well-known routing templates, using representative carrier networks and a variety of different capped hose traffic demands, parameterized by the relative importance of their marginals as opposed to their point-to-point peak demands
    corecore