65,030 research outputs found

    Power corrections in heavy-to-light decays at large recoil energy

    Get PDF
    I briefly present recent work on QCD power corrections in heavy-to-light meson decays, using an effective field theory approach.Comment: 4 pages, 1 figure. Talk given at ICHEP 2002, Amsterdam, July 200

    The Yuima-e as Theatre of the State

    Get PDF
    This article analyzes a twelfth-century session of the Yuima-e at Kofukuji as a stage of history to determine the institutional and factional background of its participants. In order to do this, the format of the Yuima-e as it was held in the twelfth century is presented, followed by a study of primary materials related to the 1196 session of this annual ritual. The article then examines the Sanne joichiki, the personal notes of the Todaiji monk Sosho, and diaries, to conclude that these sessions can indeed be considered "theatres of the state" in which the connection between Kuroda Toshio's concepts of kenmon and kenmitsu taisei can be found

    Block-adaptive Cross Approximation of Discrete Integral Operators

    Get PDF
    In this article we extend the adaptive cross approximation (ACA) method known for the efficient approximation of discretisations of integral operators to a block-adaptive version. While ACA is usually employed to assemble hierarchical matrix approximations having the same prescribed accuracy on all blocks of the partition, for the solution of linear systems it may be more efficient to adapt the accuracy of each block to the actual error of the solution as some blocks may be more important for the solution error than others. To this end, error estimation techniques known from adaptive mesh refinement are applied to automatically improve the block-wise matrix approximation. This allows to interlace the assembling of the coefficient matrix with the iterative solution

    Nuclear Multifragmentation Critical Exponents

    Full text link
    We show that the critical exponents of nuclear multi-fragmentation have not been determined conclusively yet.Comment: 3 pages, LaTeX, one postscript figure appended, sub. to Phys.Rev.Lett. as a commen

    Maximal entropy random networks with given degree distribution

    Full text link
    Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the distribution of connected components. We determine the size of the percolation cluster above the percolation threshold. The conditional degree distribution on the percolation cluster is also given. We briefly present the analogous discussion for oriented graphs, giving for example the percolation criterion.Comment: 22 pages, LateX, no figur

    Random incidence matrices: moments of the spectral density

    Full text link
    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

    Affinity and Fluctuations in a Mesoscopic Noria

    Full text link
    We exhibit the invariance of cycle affinities in finite state Markov processes under various natural probabilistic constructions, for instance under conditioning and under a new combinatorial construction that we call ``drag and drop''. We show that cycle affinities have a natural probabilistic meaning related to first passage non-equilibrium fluctuation relations that we establish.Comment: 30 pages, 1 figur
    • …