The out-degree distribution of citation networks is investigated. Statistical data of the number of papers cited within a paper (out-degree) for different journals in the period 1991-1999 is reported. The out-degree distribution is characterized by a maximum at intermediate out-degrees. At the left of the maximum there are strong fluctuations from journal to journal while is quite universal at ...

We used straightforward linear mixed effects models as described in Worsley et al. together with recent advances in smoothing to control the degrees of freedom, and random field theory based on discrete local maxima. This has been implemented in BRAINSTAT, a Python version of FMRISTAT. Our main novelty is voxel-wise inference for both magnitude and delay (latency) of the hemodynamic response. O...

Let G be a connected graph of order n . The Steiner distance d ( S ) set vertices is the minimum size subgraph that contains all For k ≤ , -diameter sdiam maximum among sets generalises classical diameter, which coincides with 2-diameter. problem determining given order, diameter and degree was first studied by Erdös Rényi. In this paper we consider corresponding for -diameter. Δ ∈ N define e a...

We consider the question: “What is the smallest degree that can be achieved for a plane spanner of a Euclidean graph E?” The best known bound on the degree is 14. We show that E always contains a plane spanner of maximum degree 6 and stretch factor 6. This spanner can be constructed efficiently in linear time given the Triangular Distance Delaunay triangulation introduced by Chew.