Finding community structure in very large networks.
- A. Clauset, M. Newman, C. Moore
- Computer SciencePhysical review. E, Statistical, nonlinear, and…
- 9 August 2004
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Hierarchical structure and the prediction of missing links in networks
- A. Clauset, C. Moore, M. Newman
- Computer ScienceNature
- 1 May 2008
This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- A. Decelle, F. Krzakala, C. Moore, L. Zdeborová
- Computer SciencePhysical review. E, Statistical, nonlinear, and…
- 14 September 2011
This paper uses the cavity method of statistical physics to obtain an asymptotically exact analysis of the phase diagram of the stochastic block model, a commonly used generative model for social and biological networks, and develops a belief propagation algorithm for inferring functional groups or communities from the topology of the network.
Quantum automata and quantum grammars
- C. Moore, J. Crutchfield
- Computer ScienceTheoretical Computer Science
- 16 July 1997
Spectral redemption in clustering sparse networks
- F. Krzakala, C. Moore, Pan Zhang
- Computer ScienceProceedings of the National Academy of Sciences
- 24 June 2013
A way of encoding sparse data using a “nonbacktracking” matrix, and it is shown that the corresponding spectral algorithm performs optimally for some popular generative models, including the stochastic block model.
Epidemics and percolation in small-world networks.
The resulting models display epidemic behavior when the infection or transmission probability rises above the threshold for site or bond percolation on the network, and are given exact solutions for the position of this threshold in a variety of cases.
Mean-field solution of the small-world network model.
A mean-field solution for the average path length and for the distribution of path lengths in the small-world network model is presented, which is exact in the limit of large system size and either a large or small number of shortcuts.
Quantum Walks on the Hypercube
- C. Moore, A. Russell
- PhysicsInternational Workshop Randomization and…
- 29 April 2001
Two quantum walks on the n-dimensional hypercube are studied, one in discrete time and one in continuous time, showing that the instantaneous mixing time is (π/4)n steps, faster than the Θ(n log n) steps required by the classical walk.
Stability Analysis of Financial Contagion Due to Overlapping Portfolios
- F. Caccioli, Munik Shrestha, C. Moore, J. Farmer
- EconomicsArXiv
- 22 October 2012
A network approach to the amplification of financial contagion due to the combination of overlapping portfolios and leverage is developed, and it is shown how it can be understood in terms of a generalized branching process.
Recursion Theory on the Reals and Continuous-Time Computation
- C. Moore
- Computer ScienceTheoretical Computer Science
- 3 August 1996
...
...