Learn More
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sublinear-time algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The(More)
The charged pion form factor, F π (Q 2), is an important quantity that can be used to advance our knowledge of hadronic structure. However, the extraction of F π from data requires a model of the 1 H(e, e π +)n reaction and thus is inherently model dependent. Therefore, a detailed description of the extraction of the charged pion form factor from(More)
We revisit the classic problem of estimating the degree distribution moments of an undirected graph. Consider an undirected graph G = (V, E) with n (non-isolated) vertices, and define (for s > 0) µ s = 1 n · v∈V d s v. Our aim is to estimate µ s within a multiplicative error of (1 + ε) (for a given approximation parameter ε > 0) in sublinear time. We(More)
The function f : {−1, 1} n → {−1, 1} is a k-junta if it depends on at most k of its variables. We consider the problem of tolerant testing of k-juntas, where the testing algorithm must accept any function that is ǫ-close to some k-junta and reject any function that is ǫ ′-far from every k ′-junta for some ǫ ′ = O(ǫ) and k ′ = O(k). Our first result is an(More)
We report measurements of cross sections for the reaction p(e,e ′ K +)Y, for both the Λ and Σ 0 hyperon states, at an invariant mass of W =1.84 GeV and four-momentum transfers 0.5 < Q 2 < 2 (GeV/c) 2. Data were taken for three values of virtual photon polarization ǫ, allowing the decomposition of the cross sections into longitudinal and transverse(More)
  • 1