#### Filter Results:

- Full text PDF available (115)

#### Publication Year

1979

2017

- This year (10)
- Last 5 years (59)
- Last 10 years (108)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas J. Winter
- Electr. J. Comb.
- 2007

Peter J. Cameron, Michael W. Newman, ∗ Ashley Montanaro, Simone Severini, † and Andreas Winter School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, U.K. Department of Computer Science, University of Bristol, Bristol BS8 1UB, U.K. Department of Mathematics, University of York, York YO10 5DD, U.K. Department of Mathematics,… (More)

- James A. West, Ginestra Bianconi, Simone Severini, Andrew E. Teschendorff
- Scientific reports
- 2012

The cellular phenotype is described by a complex network of molecular interactions. Elucidating network properties that distinguish disease from the healthy cellular state is therefore of critical importance for gaining systems-level insights into disease mechanisms and ultimately for developing improved therapies. By integrating gene expression data with a… (More)

We study entanglement properties of mixed density matrices obtained from combinatorial laplacian matrices of graphs. We observe that some classes of graphs give arise to entangled (separable) states independently of their labelings. MSC2000: 05C50; PACS numbers: 03.67.-a, 03.67.-Mn

- Filippo Passerini, Simone Severini
- IJATS
- 2009

The authors introduce a novel entropic notion with the purpose of quantifying disorder/uncertainty in networks. This is based on the Laplacian and it is exactly the von Neumann entropy of certain quantum mechanical states. It is remarkable that the von Neumann entropy depends on spectral properties and it can be computed efficiently. The analytical results… (More)

- Runyao Duan, Simone Severini, Andreas J. Winter
- ISIT
- 2011

We study the quantum channel version of Shannon’s zero-error capacity problem. Motivated by recent progress on this question, we propose to consider a certain linear space operators as the quantum generalisation of the adjacency matrix, in terms of which the plain, quantum and entanglement-assisted capacity can be formulated, and for which we show some new… (More)

In view of applications like the distribution of cryptographic keys 1,2 or communication between registers in quantum devices 3,4 , the study of the natural evolution of permanently coupled spin networks has become increasingly important. A special case of interest consists of homogeneous networks of particles coupled by constant and fixed nearestneighbor… (More)

- J. Richard Lundgren, K. Brooks Reid, Simone Severini, Dustin J. Stewart
- Australasian J. Combinatorics
- 2006

The pattern of a matrix M is a (0, 1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M . If M is an orthogonal matrix, then a digraph which supports M must satisfy a condition known as quadrangularity. We look at quadrangularity in tournaments and determine for which… (More)

- Andrew E. Teschendorff, Simone Severini
- BMC Systems Biology
- 2010

The statistical study of biological networks has led to important novel biological insights, such as the presence of hubs and hierarchical modularity. There is also a growing interest in studying the statistical properties of networks in the context of cancer genomics. However, relatively little is known as to what network features differ between the cancer… (More)

- Christopher R. S. Banerji, Diego Miranda-Saavedra, +4 authors Andrew E. Teschendorff
- Scientific reports
- 2013

Differentiation is a key cellular process in normal tissue development that is significantly altered in cancer. Although molecular signatures characterising pluripotency and multipotency exist, there is, as yet, no single quantitative mark of a cellular sample's position in the global differentiation hierarchy. Here we adopt a systems view and consider the… (More)

- Toufik Mansour, Simone Severini
- Discrete Mathematics
- 2008

A partition Π of the set [n] = {1, 2, . . . , n} is a collection B1, B2, . . . , Bd of nonempty disjoint subsets of [n]. The elements of a partition are called blocks. We assume that B1, B2, . . . , Bd are listed in the increasing order of their minimum elements, that is minB1 < minB2 < · · · < minBd. The set of all partitions of [n] with d blocks is… (More)