Adjacency Matrix
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Measures of irregularity of graphs
A graph is regular if every vertex is of the same degree. Otherwise, it is an irregular graph. Although there is a vast literature devoted to regular graphs, only a few papers approach the irregular ones. We have found four distinct graph invariants used to measure the irregularity of a graph. All of them are determined through either the average or the vari
Pesqui. Oper.. Publicado em: 08/11/2013
-
2. Transcriptional networks reconstruction: identification of genes involved on cattle response to tick Rhipicephalus (Boophilus) microplus infestation.
In tropical countries, losses caused by tick infestation in cattle lead to a great impact on animal production systems. Weight and feed conversion reduction, together with diseases transmitted by the parasite are some of the problems that lead to economic losses of billion dollars a year. In a general way, Bos taurus indicus cattle are less susceptible to in
INTERNATIONAL CONFERENCE OF THE BRAZILIAN ASSOCIATION FOR BIOINFORMATICS AND COMPUTATIONAL BIOLOGY. Publicado em: 2011
-
3. Aninhamento em redes bipartidas
We present a nestedness index that measures the nestedness pattern of bipartite networks, a problem that arises in theoretical ecology. Our measure is derived using the sum of distances of the occupied elements in the adjacency matrix of the network. This index quantifies directly the deviation of a given matrix from the nested pattern. In the most simple ca
Publicado em: 2010
-
4. Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo
In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is
Publicado em: 2010
-
5. SPACES OF SEQUENCE / ESPAÇOS DE SEQÜÊNCIAS
Estudaremos dinâmicas simbólicas associadas a alfabetos finitos. Consideraremos seqüências bi-infinitas e espaços com memória finita. Estudaremos propriedades invariantes por conjugação. Analisaremos a relação entre os espaços de seqüências e propriedades de matrizes não negativas. O principal exemplo desta correlação é o Teorema de Perron-
Publicado em: 2006
-
6. Computação evolutiva empregada na reconstrução de arvores filogeneticas
This dissertation presents a study about one of the bioinformatic problems: the phylogenetic tree reconstruction. The solution space for this problem is calculated using a factorial formula. This is a combinatorial optimization problem. Evolutionary Computation, one of the component paradigms of computational intelligence, was proved to be a good tool to tac
Publicado em: 2001
-
7. Neutral evolution of mutational robustness
We introduce and analyze a general model of a population evolving over a network of selectively neutral genotypes. We show that the population’s limit distribution on the neutral network is solely determined by the network topology and given by the principal eigenvector of the network’s adjacency matrix. Moreover, the average number of neutral mutant nei
The National Academy of Sciences.
-
8. Spectra of random graphs with given expected degrees
In the study of the spectra of power-law graphs, there are basically two competing approaches. One is to prove analogues of Wigner's semicircle law, whereas the other predicts that the eigenvalues follow a power-law distribution. Although the semicircle law and the power law have nothing in common, we will show that both approaches are essentially correc
National Academy of Sciences.