Trees and Markov Convexity

We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant called Markov convexity, and show how it can be used to compute the Euclidean distortion of any metric tree up to universal factors. The research of the first author was conducted while he was at U. C. Berkeley and the Institute for Advanced Study.     

Mode-dependent enhancement of photodissociation and photoionization in a seven atom molecule

We report the first experimental demonstration of vibrational mode-dependent enhancement in photodissociation and photoionization of a seven atom molecule, methylamine (CH(3)NH(2)). The fundamental C-H stretches and the overtones or combinations of CH(3) bends were prepared via stimulated Raman excitation (SRE) prior to their 243.135 nm one-photon dissociation or two-photon ionization. The photodissociation or photoionization of the vibrationally excited molecules was achieved via 10 ns delayed or temporally overlapping SRE and UV pulses, respectively. It is shown that bending modes are more effective than stretches in promoting photodissociation and photoionization, since their UV excitation is favored by larger Franck Condon factors. This behavior provides clear evidence for vibrational mode-dependence in a relatively large molecule with a torsional degree of freedom, indicating that these modes survive intramolecular vibrational redistribution on a time scale considerably longer than hitherto inferred from previous studies.     

Constraining the phase of Bs-Bs mixing

New physics contributions to Bs-Bs mixing can be parametrized by the size (rs2) and the phase (2thetas) of the total mixing amplitude relative to the standard model amplitude. The phase has so far been unconstrained. We first use the D0 measurement of the semileptonic CP asymmetry ASL to obtain the first constraint on the semileptonic CP asymmetry in Bs decays, ASLs=-0.008+/-0.011. Then we combine recent measurements by the CDF and D0 Collaborations--the mass difference (DeltaMs), the width difference (DeltaGammas), and ASL;s--to constrain 2thetas. The errors on DeltaGammas and ASL;s should still be reduced to have a sensitive probe of the phase, yet the central values are such that the regions around 2thetas approximately 3pi/2 and, in particular, 2thetas approximately pi/2, are disfavored.     

Bounds for resultants of univariate and bivariate polynomials

The paper considers bounds on the size of the resultant for univariate and bivariate polynomials. For univariate polynomials we also extend the traditional representation of the resultant by the zeros of the argument polynomials to formal resultants, defined as the determinants of the Sylvester matrix for a pair of polynomials whose actual degree may be lower than their formal degree due to vanishing leading coefficients. For bivariate polynomials, the resultant is a univariate polynomial resulting by the elimination of one of the variables, and our main result is a bound on the largest coefficient of this univariate polynomial. We bring a simple example that shows that our bound is attainable and that a previous sharper bound is not correct.     

Minimum-norm estimation for a bi-exponential survival model

We present a novel semi-parametric model for two-sample survival data, and an estimation method with a simple, closed-form solution. We study analytically the asymptotics of the estimators, and conduct a small simulation study.     

How many matrices can be spectrally balanced simultaneously?

We prove that any ? positive definite d × d matrices, M₁,...,M_?, of full rank, can be simultaneously spectrally balanced in the following sense: for any k < d such that ? ≤ \(\ell \leqslant \left\lfloor {\frac{{d - 1}}{{k - 1}}} \right\rfloor \), there exists a matrix A satisfying \(\frac{{{\lambda _1}\left( {{A^T}{M_i}A} \right)}}{{Tr\left( {{A^T}{M_i}A} \right)}} < \frac{1}{k}\) 1/k for all i, where λ₁(M) denotes the largest eigenvalue of a matrix M. This answers a question posed by Peres, Popov and Sousi ([PPS13]) and completes the picture described in that paper regarding sufficient conditions for transience of self-interacting random walks. Furthermore, in some cases we give quantitative bounds on the transience of such walks.     

Critical percolation on random regular graphs

The behavior of the random graph G(n,p) around the critical probability p_c = is well understood. When p = (1 + O(n^1/3))p_c the components are roughly of size n^2/3 and converge, when scaled by n^?2/3, to excursion lengths of a Brownian motion with parabolic drift. In particular, in this regime, they are not concentrated. When p = (1 ‐ ?(n))p_c with ?(n)n^1/3 →∞ (the subcritical regime) the largest component is concentrated around 2?^?2 log(?³n). When p = (1 + ?(n))p_c with ?(n)n^1/3 →∞ (the supercritical regime), the largest component is concentrated around 2?n and a duality principle holds: other component sizes are distributed as in the subcritical regime. Itai Benjamini asked whether the same phenomenon occurs in a random d‐regular graph. Some results in this direction were obtained by (Pittel, Ann probab 36 (2008) 1359–1389). In this work, we give a complete affirmative answer, showing that the same limiting behavior (with suitable d dependent factors in the non‐critical regimes) extends to random d‐regular graphs. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability

We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie–Weiss Model. For β < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window of order n centered at [2(1 ? β)]^?1 n log n. For β = 1, we prove that the mixing time is of order n ^3/2. For β > 1, we study metastability. In particular, we show that the Glauber dynamics restricted to states of non-negative magnetization has mixing time O(n log n).     

Controlled amine functionality in self-assembled monolayers via the hidden amine route: chemical and electronic tunability

A synthetic strategy for fabricating a dense amine functionalized self-assembled monolayer (SAM) on hydroxylated surfaces is presented. The assembly steps are monitored by X-ray photoelectron spectroscopy, Fourier transform infrared- attenuated total reflection, atomic force microscopy, variable angle spectroscopic ellipsometry, UV-vis surface spectroscopy, contact angle wettability, and contact potential difference measurements. The method applies alkylbromide-trichlorosilane for the fabrication of the SAM followed by surface transformation of the bromine moiety to amine by a two-step procedure: S(N)2 reaction that introduces the hidden amine, phthalimide, followed by the removal of the protecting group and exposing the free amine. The use of phthalimide moiety in the process enabled monitoring the substitution reaction rate on the surface (by absorption spectroscopy) and showed first-order kinetics. The simplicity of the process, nonharsh reagents, and short reaction time allow the use of such SAMs in molecular nanoelectronics applications, where complete control of the used SAM is needed. The different molecular dipole of each step of the process, which is verified by DFT calculations, supports the use of these SAMs as means to tune the electronic properties of semiconductors and for better synergism between SAMs and standard microelectronics processes and devices.     

Globally solving a class of optimal power flow problems in radial networks by tree reduction

We devise an algorithm for finding the global optimal solution of the so-called optimal power flow problem for a class of power networks with a tree topology, also called radial networks, for which an efficient and reliable algorithm was not previously known. The algorithm we present is called the tree reduction/expansion method, and is based on an equivalence between the input network and a single-node network. Finally, our numerical experiments demonstrate the reliability and robustness of our algorithm.