Deterministic vectorial effects lead to multiple filamentation

The standard explanation for multiple filamentation of laser pulses is that it is caused by noise in the input beam. We propose an alternative explanation that is based on deterministic vectorial (polarization) effects. We present numerical simulations in support of the vectorial-effects explanation and suggest a simple experiment for deciding whether multiple filamentation is due to vectorial effects.     

On the maximum number of Hamiltonian paths in tournaments

By using the probabilistic method, we show that the maximum number of directed Hamiltonian paths in a complete directed graph with n vertices is at least (e?o(1)) (n!/2^n?1). © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 291–296, 2001     

Signatures of non-Abelian statistics in nonlinear Coulomb blockade transport

Signatures of the non-Abelian statistics of quasiparticles in the ν=5/2 quantum Hall state are predicted to be present in the current-voltage characteristics of tunneling through one or two quantum Hall puddles of Landau filling ν(a) embedded in a bulk of filling ν(b) with (ν(a),ν(b))=(2,5/2) and (ν(a),ν(b))=(5/2,2).     

Analysis of a statistical multiplexer with generalized periodic sources

We provide solution techniques for the analysis of multiplexers with periodic arrival streams, which accurately account for the effects of active and idle periods and of gradual arrival. In the models considered in this paper, it is assumed that each source alternates (periodically) between active and idle periods of fixed durations. Incoming packets are transmitted on the network link and excess information is stored in the multiplexing buffer when the aggregate input rate exceeds the capacity of the link. We are interested in the probability distribution of the buffer content for a given network link speed as a function of the number of sources and their characteristics, i.e., rate and duration of idle and active periods. We derive this distribution from two models: discrete time and continuous time systems. Discrete time systems operate in a slotted fashion, with a slot defining the base unit for data generation and transmission. In particular, in each slot the link is capable of transmitting one data unit and conversely an active source generates one data unit in that time. The continuous time model of the paper falls in the category of fluid models. Compared to previous works we allow a more general model for the periodic packet arrival process of each source. In discrete time, this means that the active period of a source can now extend over several consecutive slots instead of a single slot as in previous models. In continuous time, packet arrivals are not required to be instantaneous, but rather the data generation process can now take place over the entire duration of the active period. In both cases, these generalizations allow us to account for the progressive arrival of source data as a function of both the source speed and the amount of data it generates in an active period.This work was done while at the IBM T.J. Watson Research Center.This work was done while at the IBM T.J. Watson Research Center.Part of the work was done while visiting the IBM T.J. Watson Research Center.     

Flow auctions

Flow goods (like electricity) are sold through auctions in a dynamic framework. An important design question is the frequency of such auctions. We use a simple dynamic auction model in continuous time to answer this question. We focus on the relationship between the persistency of bidders’ valuations and the optimal choice of frequency. If the seller focuses on the equilibrium in which bidders follow a repeated static Nash strategy, then the frequency of auctions should typically increase when persistency declines. However, accounting for the fact that bidders can follow different equilibria that are collusive in nature, the comparative statics are reversed, forcing the seller to reduce the frequency when bidders’ valuations are less persistent. The argument builds on the fact that high frequency auctions are more conducive to collusion among bidders.     

From crack deflection to lattice vibrations—macro to atomistic examination of dynamic cleavage fracture

A set of cleavage experiments with strip-shaped single-crystal silicon specimens subjected to three-point bending is reported. The experiments enabled examination of the relationships between the dynamic energy release rate, the velocity, the orientation-dependent cleavage energy, and the cleavage plane of propagation.Dynamic crack propagation experiments show that when a [0 0 1] silicon single crystal is fractured under three-point bending at ‘parallel’ velocity (directly measured at the bottom surface of the specimen) of up to , it prefers to cleave along the vertical (1 1 0) plane, while when the specimen is fractured under the same conditions but at a velocity higher than , it cleaves along the inclined (1 1 1) plane. At intermediate velocities, the crack will deflect from the (1 1 0) plane to the (1 1 1) plane. Crack velocity was determined by the initial notch length. The local (calculated) velocity of deflection between the cleavage planes ranges from , for a crack propagating on the (1 1 0) plane in the direction, to about , for a crack on the (1 1 0) plane, but in the [0 0 1] direction.It is suggested that the cause of the deflection phenomenon is the anisotropic, velocity-dependent cleavage energy, resulted phonon radiation caused by anisotropic, velocity-dependent lattice vibrations. We have studied the effect of material properties and propose selection criteria to explain the deflection phenomenon: the crack will deflect to the plane of least-energy, for which G−Γ_i(V)=max, or to the plane with maximum crack tip velocity, V_i(Γ)=max.     

Combined carbometalation-zinc homologation-allylation reactions as a new approach for alkoxyallylation of aldehydes

The combined carbometalation reaction of ynol ethers followed by a zinc homologation and further allylation reactions lead to an efficient preparation of allylic vicinal diols. The stereochemical outcome of the reaction shows that the substituent of the aldehyde occupies a pseudoaxial position in a Zimmerman-Traxler transition state.     

Distributed multi-agent optimization with state-dependent communication

We study distributed algorithms for solving global optimization problems in which the objective function is the sum of local objective functions of agents and the constraint set is given by the intersection of local constraint sets of agents. We assume that each agent knows only his own local objective function and constraint set, and exchanges information with the other agents over a randomly varying network topology to update his information state. We assume a state-dependent communication model over this topology: communication is Markovian with respect to the states of the agents and the probability with which the links are available depends on the states of the agents. We study a projected multi-agent subgradient algorithm under state-dependent communication. The state-dependence of the communication introduces significant challenges and couples the study of information exchange with the analysis of subgradient steps and projection errors. We first show that the multi-agent subgradient algorithm when used with a constant stepsize may result in the agent estimates to diverge with probability one. Under some assumptions on the stepsize sequence, we provide convergence rate bounds on a “disagreement metric” between the agent estimates. Our bounds are time-nonhomogeneous in the sense that they depend on the initial starting time. Despite this, we show that agent estimates reach an almost sure consensus and converge to the same optimal solution of the global optimization problem with probability one under different assumptions on the local constraint sets and the stepsize sequence.