UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.

Speech Graphs Provide a Quantitative Measure of Thought Disorder in Psychosis

Background: Psychosis has various causes, including mania and schizophrenia. Since the differential diagnosis of psychosis is exclusively based on subjective assessments of oral interviews with patients, an objective quantification of the speech disturbances that characterize mania and schizophrenia is in order. In principle, such quantification could be achieved by the analysis of speech graphs. A graph represents a network with nodes connected by edges; in speech graphs, nodes correspond to words and edges correspond to semantic and grammatical relationships. Methodology/Principal Findings: To quantify speech differences related to psychosis, interviews with schizophrenics, manics and normal subjects were recorded and represented as graphs. Manics scored significantly higher than schizophrenics in ten graph measures. Psychopathological symptoms such as logorrhea, poor speech, and flight of thoughts were grasped by the analysis even when verbosity differences were discounted. Binary classifiers based on speech graph measures sorted schizophrenics from manics with up to 93.8% of sensitivity and 93.7% of specificity. In contrast, sorting based on the scores of two standard psychiatric scales (BPRS and PANSS) reached only 62.5% of sensitivity and specificity. Conclusions/Significance: The results demonstrate that alterations of the thought process manifested in the speech of psychotic patients can be objectively measured using graph-theoretical tools, developed to capture specific features of the normal and dysfunctional flow of thought, such as divergence and recurrence. The quantitative analysis of speech graphs is not redundant with standard psychometric scales but rather complementary, as it yields a very accurate sorting of schizophrenics and manics. Overall, the results point to automated psychiatric diagnosis based not on what is said, but on how it is said.

Effects of a CPT-even and Lorentz-violating nonminimal coupling on electron-positron scattering

We propose a new CPT-even and Lorentz-violating nonminimal coupling between fermions and Abelian gauge fields involving the CPT-even tensor (K-F)(mu nu alpha beta) of the standard model extension. We thus investigate its effects on the cross section of the electron-positron scattering by analyzing the process e(+) + e(-) -> mu(+) + mu(-). Such a study was performed for the parity-odd and parity-even nonbirefringent components of the Lorentz-violating (K-F)(mu nu alpha beta) tensor. Finally, by using experimental data available in the literature, we have imposed upper bounds as tight as 10(-12) (eV)(-1) on the magnitude of the CPT-even and Lorentz-violating parameters while nonminimally coupled. DOI: 10.1103/PhysRevD.86.125033

Strong Coupling Isotropization of Non-Abelian Plasmas Simplified

We study the isotropization of a homogeneous, strongly coupled, non-Abelian plasma by means of its gravity dual. We compare the time evolution of a large number of initially anisotropic states as determined, on the one hand, by the full nonlinear Einstein's equations and, on the other, by the Einstein's equations linearized around the final equilibrium state. The linear approximation works remarkably well even for states that exhibit large anisotropies. For example, it predicts with a 20% accuracy the isotropization time, which is of the order of t(iso) less than or similar to 1/T, with T the final equilibrium temperature. We comment on possible extensions to less symmetric situations.

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

On the motion of particles in covariant Horava-Lifshitz gravity and the meaning of the A-field

We studied the low energy motion of particles in the general covariant. version of Horava-Lifshitz gravity proposed by Horava and Melby-Thompson. Using a scalar field coupled to gravity according to the minimal substitution recipe proposed by da Silva and taking the geometrical optics limit, we could write an effective relativistic metric for a general solution. As a result, we discovered that the equivalence principle is not in general recovered at low energies, unless the spatial Laplacian of A vanishes. Finally, we analyzed the motion on the spherical symmetric solution proposed by Horava and Melby-Thompson, where we could find its effective line element and compute spin-0 geodesics. Using standard methods we have shown that such an effective metric cannot reproduce Newton's gravity law even in the weak gravitational field approximation. (C) 2011 Elsevier B.V All rights reserved.

Quantum exchange interaction of spherically symmetric plasmoids

We study nano-sized spherically symmetric plasma structures which are radial nonlinear oscillations of electrons in plasma. The effective interaction of these plasmoids via quantum exchange forces between ions is described. We calculate the energy of this interaction for the case of a dense plasma. The conditions when the exchange interaction is attractive are examined and it is shown that separate plasmoids can form a single object. The application of our results to the theoretical description of stable atmospheric plasma structures is considered. (C) 2012 Elsevier Ltd. All rights reserved.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Local power properties of some asymptotic tests in symmetric linear regression models

In this paper we obtain asymptotic expansions, up to order n(-1/2) and under a sequence of Pitman alternatives, for the nonnull distribution functions of the likelihood ratio, Wald, score and gradient test statistics in the class of symmetric linear regression models. This is a wide class of models which encompasses the t model and several other symmetric distributions with longer-than normal tails. The asymptotic distributions of all four statistics are obtained for testing a subset of regression parameters. Furthermore, in order to compare the finite-sample performance of these tests in this class of models, Monte Carlo simulations are presented. An empirical application to a real data set is considered for illustrative purposes. (C) 2011 Elsevier B.V. All rights reserved.

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of k-colourings of the edge set of G with no monochromatic matching of size l. Consider the function c(k,l) : N --> N given by c(k,l)(n) = max {c(k,l)(G): vertical bar V(G)vertical bar = n}, the maximum of c(k,l)(G) over all graphs G on n vertices. In this paper, we determine c(k,l)(n) and the corresponding extremal graphs for all large n and all fixed values of k and l.

The discriminants associated to isotropy representations of symmetric spaces

We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum number of squares required to represent the discrimininant is developed and applied in examples.

Analog circuit synthesis performing fast Pareto frontier exploration and analysis through 3D graphs

This paper presents a technique for performing analog design synthesis at circuit level providing feedback to the designer through the exploration of the Pareto frontier. A modified simulated annealing which is able to perform crossover with past anchor points when a local minimum is found which is used as the optimization algorithm on the initial synthesis procedure. After all specifications are met, the algorithm searches for the extreme points of the Pareto frontier in order to obtain a non-exhaustive exploration of the Pareto front. Finally, multi-objective particle swarm optimization is used to spread the results and to find a more accurate frontier. Piecewise linear functions are used as single-objective cost functions to produce a smooth and equal convergence of all measurements to the desired specifications during the composition of the aggregate objective function. To verify the presented technique two circuits were designed, which are: a Miller amplifier with 96 dB Voltage gain, 15.48 MHz unity gain frequency, slew rate of 19.2 V/mu s with a current supply of 385.15 mu A, and a complementary folded cascode with 104.25 dB Voltage gain, 18.15 MHz of unity gain frequency and a slew rate of 13.370 MV/mu s. These circuits were synthesized using a 0.35 mu m technology. The results show that the method provides a fast approach for good solutions using the modified SA and further good Pareto front exploration through its connection to the particle swarm optimization algorithm.

Mixed-valence state of symmetric diruthenium complexes: synthesis, characterization, and electron transfer investigation

Complexes of the type {[(pyS)Ru(NH3)(4)](2)-mu-L}(n), where pyS = 4-mercaptopyridine, L = 4,4'-dithiodipyridine (pySSpy), pyrazine (pz) and 1,4-dicyanobenzene (DCB), and n = +4 and +5 for fully reduced and mixed-valence complexes, respectively, were synthesized and characterized. Electrochemical data showed that there is electron communication between the metal centers with comproportionation constants of 33.2, 1.30 x 10(8) and 5.56 x 10(5) for L = pySSpy, pz and DCB, respectively. It was also observed that the electronic coupling between the metal centers is affected by the p-back-bonding interaction toward the pyS ligand. Raman spectroscopy showed a dependence of the intensity of the vibrational modes on the exciting radiations giving support to the assignments of the electronic transitions. The degree of electron communication between the metal centers through the bridging ligands suggests that these systems can be molecular wire materials.

Width of buccal and posterior corridors: differences between cases treated with asymmetric and symmetric extractions

OBJECTIVE: To verify if there is difference in the buccal and posterior corridor width in cases treated with extraction of one and four premolars. METHODS: Through posed smile photographs of 23 Class II patients, subdivision, treated with extraction of one premolar and 25 Class I and Class II patients, subdivision, treated with extraction of four premolars, the percentage of buccal and posterior corridor width was calculated. The two protocols of extractions were compared regarding the buccal and posterior corridor width by independent t tests. RESULTS: There was no statistically significant difference on the buccal and posterior corridor widths between patients treated with symmetric and asymmetric extraction. CONCLUSION: The buccal and posterior corridor did not differ between the evaluated protocols of extractions.

Infective endocarditis with left to right intracardiac fistula due to Streptococcus anginosus - a rare complication caused by an even rarer bacterium

Although infective endocarditis (IE) has been described in reports dating from the Renaissance, the diagnosis still challenges and the outcome often surprises. In the course of time, diagnostic criteria have been updated and validated to reduce misdiagnosis. Some risk factors and epidemiology have shown dynamic changes since degenerative valvular disease became more predominant in developed countries, and the mean age of the affected population increased. Despite streptococci have been being well known as etiologic agents, some groups, although rare, have been increasingly reported (e.g., Streptococcus milleri.) Intracardiac complications of IE are common and have a worse prognosis, frequently requiring surgical treatment. We report a case of a middle-aged diabetic man who presented with prolonged fever, weight loss, and ultimately severe dyspnea. IE was diagnosed based on a new valvular regurgitation murmur, a positive blood culture for Streptococcus anginosus, an echocardiographic finding of an aortic valve vegetation, fever, and pulmonary thromboembolism. Despite an appropriate antibiotic regimen, the patient died. Autopsy findings showed vegetation attached to a bicuspid aortic valve with an associated septal abscess and left ventricle and aortic root fistula connecting with the pulmonary artery. A large thrombus was adherent to the pulmonary artery trunk and a pulmonary septic thromboemboli were also identified.