Random incidence matrices: moments of the spectral density

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the eigenvalue distribution as explicit polynomials in N and p. For large N and fixed p the spectrum contains a large eigenvalue at Np and a semi-circle of "small" eigenvalues. For large N and fixed average connectivity pN (dilute or sparse random matrices limit), we show that the spectrum always contains a discrete component. An anomaly in the spectrum near eigenvalue 0 for connectivity close to e=2.72... is observed. We develop recursion relations to compute the moments as explicit polynomials in pN. Their growth is slow enough so that they determine the spectrum. The extension of our methods to the Laplacian matrix is given in Appendix. Keywords: random graphs, random matrices, sparse matrices, incidence matrices spectrum, momentsComment: 39 pages, 9 figures, Latex2e, [v2: ref. added, Sect. 4 modified

Core percolation in random graphs: a critical phenomena analysis

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated vertices plus an induced subgraph we call the "core". In the thermodynamic limit of an infinite random graph, we compute analytically the dynamics of leaf removal, the number of isolated vertices and the number of vertices and edges in the core. We show that a second order phase transition occurs at "alpha = e = 2.718...": below the transition, the core is small but above the transition, it occupies a finite fraction of the initial graph. The finite size scaling properties are then studied numerically in detail in the critical region, and we propose a consistent set of critical exponents, which does not coincide with the set of standard percolation exponents for this model. We clarify several aspects in combinatorial optimization and spectral properties of the adjacency matrix of random graphs. Key words: random graphs, leaf removal, core percolation, critical exponents, combinatorial optimization, finite size scaling, Monte-Carlo.Comment: 15 pages, 9 figures (color eps) [v2: published text with a new Title and addition of an appendix, a ref. and a fig.

The Correlator Toolbox, Metrics and Moduli

We discuss the possible set of operators from various boundary conformal field theories to build meaningful correlators that lead via a Loewner type procedure to generalisations of SLE($\kappa,\rho$). We also highlight the necessity of moduli for a consistent kinematic description of these more general stochastic processes. As an illustration we give a geometric derivation of $\text{SLE}(\kappa,\rho)$ in terms of conformally invariant random growing compact subsets of polygons. The parameters $\rho_j$ are related to the exterior angles of the polygons. We also show that $\text{SLE}(\kappa,\rho)$ can be generated by a Brownian motion in a gravitational background, where the metric and the Brownian motion are coupled. The metric is obtained as the pull-back of the Euclidean metric of a fluctuating polygon.Comment: 3 figure

QCD-Factorization of inclusive B decays and |Vub|

Recent progress in the theoretical description of inclusive B to X_u l nu decays in the shape-function region is reported. Finite moments of the shape function are related to HQET parameters. Event fractions for several experimental cuts are presented, with a particular emphasis on the hadronic variable P+. The aim of this talk is to introduce the P+ spectrum, to compare it to the hadronic invariant mass spectrum and the charged-lepton energy spectrum, and to study the prospect of evaluating |Vub| in the presence of a large background from B to X_c decays.Comment: 8 pages, 7 figures, uses espcrc2.sty (included). Talk presented at the Sixth International Conference on Hyperons, Charm and Beauty Hadrons, IIT, Chicago, June 27--July 3 200

Stochastic Loewner evolution in multiply connected domains

We construct radial stochastic Loewner evolution in multiply connected domains, choosing the unit disk with concentric circular slits as a family of standard domains. The natural driving function or input is a diffusion on the associated Teichm\"uller space. The diffusion stops when it reaches the boundary of the Teichm\"uller space. We show that for this driving function the family of random growing compacts has a phase transition for $\kappa=4$ and $\kappa=8$, and that it satisfies locality for $\kappa=6$.Comment: Corrected version, references adde