#### Filter Results:

- Full text PDF available (205)

#### Publication Year

1991

2017

- This year (8)
- Last 5 years (61)
- Last 10 years (112)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Aaron Clauset, Mark E. J. Newman, Cristopher Moore
- Physical review. E, Statistical, nonlinear, and…
- 2004

The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many… (More)

- Aaron Clauset, Cristopher Moore, Mark E. J. Newman
- Nature
- 2008

Networks have in recent years emerged as an invaluable tool for describing and quantifying complex systems in many branches of science. Recent studies suggest that networks often exhibit hierarchical organization, in which vertices divide into groups that further subdivide into groups of groups, and so forth over multiple scales. In many cases the groups… (More)

- Cristopher Moore, James P. Crutchfield
- Theor. Comput. Sci.
- 2000

To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We find analogs of several classical theorems, including pumping lemmas, closure properties, rational and… (More)

- Aurelien Decelle, Florent Krzakala, Cristopher Moore, Lenka Zdeborová
- Physical review. E, Statistical, nonlinear, and…
- 2011

In this paper we extend our previous work on the stochastic block model, a commonly used generative model for social and biological networks, and the problem of inferring functional groups or communities from the topology of the network. We use the cavity method of statistical physics to obtain an asymptotically exact analysis of the phase diagram. We… (More)

- Cristopher Moore
- Theor. Comput. Sci.
- 1996

We de ne a class of recursive functions on the reals analogous to the classical recursive functions on the natural numbers corresponding to a conceptual analog computer that operates in continuous time This class turns out to be surprisingly large and includes many functions which are uncomputable in the traditional sense We stratify this class of functions… (More)

- Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore
- J. ACM
- 2005

Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaining this graph structure can be a surprisingly difficult task, as edges cannot be explicitly queried. For instance, empirical studies of the network of Internet Protocol (IP)… (More)

- Cristopher Moore, Alexander Russell
- RANDOM
- 2002

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk… (More)

- Cristopher Moore
- Theor. Comput. Sci.
- 1998

We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in R d by composing iterated maps, and then apply inequalities to the resulting point to test for membership in the language. Each class of maps and inequalities, such as quadratic functions with rational coeecients, is capable of… (More)

- Dimitris Achlioptas, Cristopher Moore
- SIAM J. Comput.
- 2006

Many NP-complete constraint satisfaction problems appear to undergo a “phase transition” from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds on the location of the threshold by showing that above a certain density the first moment (expectation) of the number of… (More)

- Cosma Rohilla Shalizi, Robert Haslinger, Jean-Baptiste Rouquier, Kristina Lisa Klinkner, Cristopher Moore
- Physical review. E, Statistical, nonlinear, and…
- 2006

Most current methods for identifying coherent structures in spatially extended systems rely on prior information about the form which those structures take. Here we present two approaches to automatically filter the changing configurations of spatial dynamical systems and extract coherent structures. One, local sensitivity filtering, is a modification of… (More)