1,556 research outputs found
Exponential sum approximations for
Given and , the function may be approximated
for in a compact interval by a sum of terms of the form
, with parameters and . One such an approximation, studied
by Beylkin and Monz\'on, is obtained by applying the trapezoidal rule to an
integral representation of , after which Prony's method is applied
to reduce the number of terms in the sum with essentially no loss of accuracy.
We review this method, and then describe a similar approach based on an
alternative integral representation. The main difference is that the new
approach achieves much better results before the application of Prony's method;
after applying Prony's method the performance of both is much the same.Comment: 18 pages, 5 figures. I have completely rewritten this paper because
after uploading the previous version I realised that there is a much better
approach. Note the change to the title. Have included minor corrections
following revie
Finding community structure in networks using the eigenvectors of matrices
We consider the problem of detecting communities or modules in networks,
groups of vertices with a higher-than-average density of edges connecting them.
Previous work indicates that a robust approach to this problem is the
maximization of the benefit function known as "modularity" over possible
divisions of a network. Here we show that this maximization process can be
written in terms of the eigenspectrum of a matrix we call the modularity
matrix, which plays a role in community detection similar to that played by the
graph Laplacian in graph partitioning calculations. This result leads us to a
number of possible algorithms for detecting community structure, as well as
several other results, including a spectral measure of bipartite structure in
networks and a new centrality measure that identifies those vertices that
occupy central positions within the communities to which they belong. The
algorithms and measures proposed are illustrated with applications to a variety
of real-world complex networks.Comment: 22 pages, 8 figures, minor corrections in this versio
Extremal Optimization for Graph Partitioning
Extremal optimization is a new general-purpose method for approximating
solutions to hard optimization problems. We study the method in detail by way
of the NP-hard graph partitioning problem. We discuss the scaling behavior of
extremal optimization, focusing on the convergence of the average run as a
function of runtime and system size. The method has a single free parameter,
which we determine numerically and justify using a simple argument. Our
numerical results demonstrate that on random graphs, extremal optimization
maintains consistent accuracy for increasing system sizes, with an
approximation error decreasing over runtime roughly as a power law t^(-0.4). On
geometrically structured graphs, the scaling of results from the average run
suggests that these are far from optimal, with large fluctuations between
individual trials. But when only the best runs are considered, results
consistent with theoretical arguments are recovered.Comment: 34 pages, RevTex4, 1 table and 20 ps-figures included, related papers
available at http://www.physics.emory.edu/faculty/boettcher
Researching the use of force: The background to the international project
This article provides the background to an international project on use of force by the police that was carried out in eight countries. Force is often considered to be the defining characteristic of policing and much research has been conducted on the determinants, prevalence and control of the use of force, particularly in the United States. However, little work has looked at police officersâ own views on the use of force, in particular the way in which they justify it. Using a hypothetical encounter developed for this project, researchers in each country conducted focus groups with police officers in which they were encouraged to talk about the use of force. The results show interesting similarities and differences across countries and demonstrate the value of using this kind of research focus and methodology
- âŠ