Tolerating the community detection resolution limit with edge weighting.

Communities of vertices within a giant network such as the World Wide Web are likely to be vastly smaller than the network itself. However, Fortunato and Barthélemy have proved that modularity maximization algorithms for community detection may fail to resolve communities with fewer than √L/2 edges, where L is the number of edges in the entire network. This resolution limit leads modularity maximization algorithms to have notoriously poor accuracy on many real networks.

Do dynamical systems follow Benford's law?

Data compiled from a variety of sources follow Benford's law, which gives a monotonically decreasing distribution of the first digit (1 through 9). We examine the frequency of the first digit of the coordinates of the trajectories generated by some common dynamical systems. One-dimensional cellular automata fulfill the expectation that the frequency of the first digit is uniform.