Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “graph theory”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18Linked to original sources
PubMed2001

Statistical ensemble of scale-free random graphs.

A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is characterized by two global parameters, the fractal and the spectral dimensions, which are explicitly calculated. It is discussed in detail how the geometry of the graphs varies when the weights of the nodes are modified. The stability of the scale-free regime is also considered: when it breaks down, either a scale is spontaneously generated or else, a "singular" node appears and the graphs become crumpled. A new computer algorithm to generate these random graphs is proposed. Possible generalizations are also discussed. In particular, more general ensembles are defined along the same lines and the computer algorithm is extended to arbitrary (degenerate) scale-free random graphs.

Journal Article↗
PubMed2006

A novel electrochemical biosensor for the detection of uric acid and adenine.

A novel electrochemical biosensor for the detection of uric acid and adenine was prepared based on a gel containing multi-walled carbon nanotubes and room-temperature ionic liquid of 1-octyl-3-methylimidazolium hexafluorophosphate. The electrochemistry of uric acid and adenine was studied in this gel modified electrode. There was a significant two-way electrocatalytic activity upon both oxidation and reduction of uric acid. Similar to a bare glassy carbon electrode, uric acid undergoes a 2e,2H+ oxidation in phosphate buffer in the modified electrode. A diimine, the oxidation product of uric acid, was found to be an unstable intermediate, which was converted by a follow-up hydration reaction to an imine alcohol, with the reaction rate constant of 8.5 +/- 0.3 M(-1).s(-1) according to Nicholson's theory. Under optimum conditions, linear calibration graphs were obtained over the concentration range of 1.0 x 10(-7) M approximately 1.0 x 10(-5) M (uric acid) and 1.0 x 10(-5) M approximately 6.0 x 10(-4) M (adenine). Based on the signal-to-noise ratio of 3, the detection limits of the current technique was found to be as low as 9.0 x 10(-8) M (uric acid) and 2.0 x 10(-6) M (adenine), respectively. This novel biosensor was successfully applied for the assay of uric acid in human urine. Because of its good stability and long-term durability, such a gel modified electrode can provide a simple and easy approach for sensitive detection of uric acid and adenine.

Adenine↗
PubMedDate not supplied

Encoding the core electrons with graph concepts.

The core electron problem of atoms in chemical graph studies has always been considered as a minor problem. Usually, chemical graphs had to encode just a small set of second row atoms, i.e., C, N, O, and F, thus, graph and, in some cases, pseudograph concepts were enough to "graph" encode the molecules at hand. Molecular connectivity theory, together with its side-branch the electrotopological state, introduced two "ad hoc" algorithms for the core electrons of higher-row atoms based, mainly, on quantum concepts alike. Recently, complete graphs, and, especially, odd complete graphs have been introduced to encode the core electrons of higher-row atoms. By the aid of these types of graphs a double-valued algorithm has been proposed for the valence delta, deltav, of any type of atoms of the periodic table with a principal quantum number n > or =2. The new algorithm is centered on an invariant suggested by the hand-shaking theorem, and the values it gives rise to parallel in some way the values derived by the aid of the two old "quantum" algorithms. A thorough comparative analysis of the newly proposed algorithms has been undertaken for atoms of the group 1A-7A of the periodic table. This comparative study includes the electronegativity, the size of the atoms, the first ionization energy, and the electron affinity. The given algorithm has also been tested with sequential complete graphs, while the even complete graphs give rise to conceptual difficulties. QSAR/QSPR studies do not show a clear-cut preference for any of the two values the algorithm gives rise to, even if recent results seem to prefer one of the two values.

Journal Article↗
PubMed1985

Eye-contact graphs.

The structure of nonverbal communication expressed as eye-contact between two human beings is analyzed using graph-theoretic tools involving a theorem of König on bipartite graphs and various results concerning directed graphs (as in Harary). A taxonomy for possible eye-contact configurations is constructed; then a theory, formed from a sequence of theorems proved about classes of eye-contact graphs derived from the taxonomy, is interpreted to analyze possible levels of communication. This theory can apply to any living system but it is interpreted here with respect to human subsystems composed of (1) individuals with normal vision, and (2) individuals with vision disorders which lead to crossed eyes.

Esotropia↗
PubMed2004

A method for cross-sector priority setting. Gaps and hypotheses in malaria research: Tanzania.

This study proposes a new priority setting method for identifying critical information gaps in a multisector system. The method uses graph-theoretical concepts and principles of systems theory in characterizing the underlying information structure of the system. Its application is illustrated in the context of malaria control in Tanzania, drawing on the findings of a workshop held in October 2003 in Dar es Salaam. The workshop identified two critical pathways, EVHA and EVHPA, which warrant better understanding. The first suggests that the malaria research should generate information on the effects of environmental changes (E) on vector ecology (V) and then on the effects of V on human health (H) and then on the effects of H on agriculture (A). Interpreted likewise, the second pathway additionally points to the need for information on the effects of socioeconomic conditions (P) on A.

Health Priorities↗
PubMed1989

Efficiency of graphical perception.

The term graphical perception refers to the part played by visual perception in analyzing graphs. Computer graphics have stimulated interest in the perceptual pros and cons of different formats for displaying data. One way of evaluating the effectiveness of a display is to measure the efficiency (as defined by signal-detection theory) with which an observer extracts information from the graph. We measured observers' efficiencies in detecting differences in the means or variances of pairs of data sets sampled from Gaussian distributions. Sample size ranged from 1 to 20 for viewing times of 0.3 or 1 sec. The samples were displayed in three formats: numerical tables, scatterplots, and luminance-coded displays. Efficiency was highest for the scatterplots (approximately equal to 60% for both means and variances) and was only weakly dependent on sample size and exposure time. The pattern of results suggests parallel perceptual computation in which a constant proportion of the available information is used. Efficiency was lowest for the numerical tables and depended more strongly on sample size and viewing time. The results suggest serial processing in which a fixed amount of the available information is processed in a given time.

Attention↗
PubMedDate not supplied

k-resonant benzenoid systems and k-cycle resonant graphs.

A benzenoid system (or hexagonal system) H is said to be k-resonant if, for 1 < or = t < or = k, any t disjoint hexagons of H are mutually resonant; that is, there is a Kekule structure (or perfect matching) K of H such that each of the k hexagons is an K-alternating hexagon. A connected graph G is said to be k-cycle resonant if, for 1 < or = t < or = k, any t disjoint cycles in G are mutually resonant. The concept of k-resonant benzenoid systems is closely related to Clar's aromatic sextet theory, and the concept of k-cycle resonant graphs is a natural generalization of k-resonant benzenoid systems. Some necessary and sufficient conditions for a benzenoid system (respectively a graph) to be k-resonant (respectively k-cycle resonant) have been established. In this paper, we will give a survey on investigations of k-resonant benzenoid systems and k-cycle resonant graphs.

Journal Article↗
PubMed2006

A graph-based reflexive artificial chemistry.

The conceptual divide between formal systems of computation and abstract models of chemistry is considered. As an attempt to concretely bridge this divide, a formalism is proposed that describes a constructive artificial chemistry on a space of directed graph structures. The idea for the formalism originates in computer science theory, with the traditional abstraction of a physical machine, the finite-state machine (FSM). In the FSM, the machine (state-transition graph) and input string (series of binary digits) are fundamentally distinct objects, separated by nature of the underlying formalism. This distinction is dissolved in the proposed system, resulting in a construction process that is reflexive: graphs interact with their own topological structure to generate a product. It is argued that this property of reflexivity is a key element missing from earlier model chemistries. Examples demonstrate the continuous emergence complex self-similar topologies, novel reaction pathways, and seemingly open-ended diversity. Implications of these findings are discussed.

Chemical Phenomena↗
PubMed2002

Constructing knowledge. The role of graphs and tables in hard and soft psychology.

Because graphs provide a compact, rhetorically powerful way of representing research findings, recent theories of science have postulated their use as a distinguishing feature of science. Studies have shown that the use of graphs in journal articles correlates highly with the hardness of scientific fields, both across disciplines and across sub-fields of psychology. In contrast, the use of tables and inferential statistics in psychology is inversely related to subfield hardness, suggesting that the relationship between hardness and graph use is not attributable to differences in the use of quantitative data in subfields or their commitment to empiricism. Enhanced "graphicacy" among psychologists could contribute to the progress of psychological science by providing alternatives to significance testing and by facilitating communication across subfields.

Computer Graphics↗
PubMed2004

Universal spectral statistics in quantum graphs.

We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random-matrix theory. The stability of these correlations with regard to nonuniversal corrections is analyzed in terms of the linear operator governing the classical dynamics on the graph.

Journal Article↗
PubMed2000

Disease management research using event graphs.

Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course.

Animals↗
PubMed2000

para-Substituted N-nitroso-N-oxybenzenamine ammonium salts: a new class of redox-sensitive nitric oxide releasing compounds.

N-Nitroso-N-oxybenzenamine ammonium salts with -OMe, -Me, -H, -F, -Cl, -CF3, and -SO2Me substituents at the para position of the phenyl ring constitute a new class of-redox sensitive nitric oxide (NO) releasing compounds. These compounds yield nitric oxide and the corresponding nitrosobenzene derivatives by a spontaneous dissociation mechanism after undergoing a one electron oxidation. Oxidation of these compounds can be achieved through chemical, electrochemical and enzymatic methods. It was observed electrochemically that the amount of NO generated was dependent on the substituent effect and the applied oxidation potential. Electron-withdrawing substituents increase the oxidation potential of the compound. A linear correlation was observed when the peak potentials for the oxidation were graphed versus the Hammett substituent constant. Density functional theory calculations were also performed on this series of compounds. The theoretical oxidation energies of the corresponding anions show a strong linear correlation with the experimental potentials. Furthermore, enzymatic oxidation using horseradish peroxidase showed a similar substituent effect. These results indicate that substitution at the para position of the phenyl ring has a profound effect on the stability, oxidation potential and enzymatic kinetic properties of the compounds. Thus para-substituted N-nitroso-N-oxybenzenamine salts comprise a new class of redox-sensitive nitric oxide releasing agents.

Electrochemistry↗
PubMed2004

Universal spectral statistics in Wigner-Dyson, chiral, and Andreev star graphs. I. Construction and numerical results.

In a series of two papers we investigate the universal spectral statistics of chaotic quantum systems in the ten known symmetry classes of quantum mechanics. In this first paper we focus on the construction of appropriate ensembles of star graphs in the ten symmetry classes. A generalization of the Bohigas-Giannoni-Schmit conjecture is given that covers all these symmetry classes. The conjecture is supported by numerical results that demonstrate the fidelity of the spectral statistics of star graphs to the corresponding Gaussian random-matrix theories.

Journal Article↗
PubMed2003

[Application of ordinary Kriging method in entomologic ecology].

Geostatistics is a statistic method based on regional variables and using the tool of variogram to analyze the spatial structure and the patterns of organism. In simulating the variogram within a great range, though optimal simulation cannot be obtained, the simulation method of a dialogue between human and computer can be used to optimize the parameters of the spherical models. In this paper, the method mentioned above and the weighted polynomial regression were utilized to simulate the one-step spherical model, the two-step spherical model and linear function model, and the available nearby samples were used to draw on the ordinary Kriging procedure, which provided a best linear unbiased estimate of the constraint of the unbiased estimation. The sum of square deviation between the estimating and measuring values of varying theory models were figured out, and the relative graphs were shown. It was showed that the simulation based on the two-step spherical model was the best simulation, and the one-step spherical model was better than the linear function model.

Algorithms↗
PubMed2004

The image foresting transform: theory, algorithms, and applications.

The image foresting transform (IFT) is a graph-based approach to the design of image processing operators based on connectivity. It naturally leads to correct and efficient implementations and to a better understanding of how different operators relate to each other. We give here a precise definition of the IFT, and a procedure to compute it-a generalization of Dijkstra's algorithm-with a proof of correctness. We also discuss implementation issues and illustrate the use of the IFT in a few applications.

Algorithms↗
PubMed1989

An AI-based communication system for motor and speech disabled persons: design methodology and prototype testing.

An intelligent communication device is developed to assist the nonverbal, motor disabled in the generation of written and spoken messages. The device is centered on a knowledge base of the grammatical rules and message elements. A "belief" reasoning scheme based on both the information from external sources and the embedded knowledge is used to optimize the process of message search. The search for the message elements is conceptualized as a path search in the language graph, and a special frame architecture is used to construct and to partition the graph. Bayesian "belief" reasoning from the Dempster-Shafer theory of evidence is augmented to cope with time-varying evidence. An "information fusion" strategy is also introduced to integrate various forms of external information. Experimental testing of the prototype system is discussed.

Artificial Intelligence↗
PubMed2026

GenOT: generative optimal transport enables spatiotemporal interpolation and generation in cross-platform spatial transcriptomics.

Spatial transcriptomics technologies have revolutionized the analysis of spatial gene expression, yet integrating spatial information and generating data across heterogeneous samples remain challenging. We present GenOT, a generative framework combining multi-scale graph self-supervised contrastive learning with optimal transport barycenter theory for efficient cross-slice and cross-platform spatiotemporal interpolation. The core innovation of GenOT lies in introducing an optimal transport barycenter-based interpolation algorithm, which mathematically models spatial distribution differences across heterogeneous samples to reconstruct spatiotemporal gene expression dynamics. Extensive evaluations demonstrate that GenOT consistently outperforms existing approaches in spatial domain identification, cross-platform interpolation, and developmental trajectory reconstruction.

Spatial Transcriptomics↗
PubMed1977

The design of the detector and collimators for a hybrid scanner.

The hybrid scanner is a scanning device in which a long crystal with two or more photomultiplier (PM) tubes acts as a gamma camera along the crystal axis; the device acts as a linear scanner in a direction perpendicular to the crystal axis. A detailed analysis of the intrinsic resolution and uniformity is given for a two-PM-tube hybrid scanner (with one PM tube at each end) and the expressions derived should help the designer to choose the best crystal system. Collimation theory is discussed for the general hybrid scanner. Expressions and graphs are given to help in the design of a collimator with the best balance between the conflicting requirements of resolution, sensitivity, depth independence and freedom from artifacts (collimator holes may be seen in the image at high energy). Examples of practical collimators are given for energies of 80-140,364,511,662 and 840 keV.

Mathematics↗