Oxford Index Browse

You are looking at 1-10 of 133 items for:

Computer Science x Mathematics x clear all

Refine by type

Refine by product

 

Active discovery of network roles for predicting the classes of network nodes

Leto Peel.

in Journal of Complex Networks

September 2015; p ublished online November 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 8356 words.

Nodes in real world networks often have class labels, or underlying attributes, that are related to the way in which they connect to other nodes. Sometimes this relationship is simple, for...

Go to Oxford Journals »  home page

Adding cohesion constraints to models for modularity maximization in networks

Sonia Cafieri, Alberto Costa and Pierre Hansen.

in Journal of Complex Networks

September 2015; p ublished online December 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 9401 words.

Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so have been proposed, the most studied...

Go to Oxford Journals »  home page

Advances in Network Complexity by Matthias Dehmer, Abbe Mowshowitz and Frank Emmet-Streib

Mark Buchanan and Antonia Scala.

in Journal of Complex Networks

March 2014; p ublished online March 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 295 words.

Go to Oxford Journals »  abstract

Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs

Richard K. Darst, David R. Reichman, Peter Ronhovde and Zohar Nussinov.

in Journal of Complex Networks

September 2015; p ublished online October 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 12426 words.

We derive rigorous bounds for well-defined community structure in complex networks for a stochastic block model (SBM) benchmark. In particular, we analyse the effect of inter-community...

Go to Oxford Journals »  home page

Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets

Jose C. Nacher and Tatsuya Akutsu.

in Journal of Complex Networks

December 2014; p ublished online July 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 7603 words.

Recent studies have drawn attention to the problem of how complex networks can be controlled through a small number of controller nodes. Here, we develop an algorithmic procedure and...

Go to Oxford Journals »  home page

Assortativity in complex networks

Rogier Noldus and Piet Van Mieghem.

in Journal of Complex Networks

December 2015; p ublished online March 2015 .

Journal Article. Subjects: Mathematics; Computer Science. 17347 words.

We survey the concept of assortativity, starting from its original definition by Newman in 2002. Degree assortativity is the most commonly used form of assortativity. Degree assortativity...

Go to Oxford Journals »  home page

1-Bit matrix completion

Mark A. Davenport, Yaniv Plan, Ewout van den Berg and Mary Wootters.

in Information and Inference: A Journal of the IMA

September 2014; p ublished online July 2014 .

Journal Article. Subjects: Science and Mathematics; Mathematics; Applied Mathematics; Computer Science. 0 words.

In this paper, we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix null...

Go to Oxford Journals »  home page

Border sensitive centrality in global patent citation networks

Greg Morrison, Eleftherios Giovanis, Fabio Pammolli and Massimo Riccaboni.

in Journal of Complex Networks

December 2014; p ublished online August 2014 .

Journal Article. Subjects: Mathematics; Computer Science. 8779 words.

When resources are shared between interacting networks, the importance of each node depends strongly on how collaborative or competitive each sub-network is. In this paper, we develop a new...

Go to Oxford Journals »  home page

Cascading behaviour in complex socio-technical networks

Javier Borge-Holthoefer, Raquel A. Baños, Sandra González-Bailón and Yamir Moreno.

in Journal of Complex Networks

June 2013; p ublished online April 2013 .

Journal Article. Subjects: Mathematics; Computer Science. 10223 words.

Most human interactions today take place with the mediation of information and communications technology. This is extending the boundaries of interdependence: the group of reference, ideas...

Go to Oxford Journals »  full text: open access   » abstract

CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion

Jeffrey D. Blanchard, Jared Tanner and Ke Wei.

in Information and Inference: A Journal of the IMA

December 2015; p ublished online November 2015 .

Journal Article. Subjects: Science and Mathematics; Mathematics; Applied Mathematics; Computer Science. 16576 words.

We introduce the conjugate gradient iterative hard thresholding (CGIHT) family of algorithms for the efficient solution of constrained underdetermined linear systems of equations arising in...

Go to Oxford Journals »  full text: open access