Search results for 'Graph' (try it on Scholar)

730 found
Sort by:
  1. Rafael de Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661-672.score: 18.0
    Recently, several authors have claimed to have found graph-theoretic counterexamples to the Principle of the Identity of Indiscernibles. In this paper, I argue that their counterexamples presuppose a certain view of what unlabeled graphs are, and that this view is optional at best.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Nicholas Shackel (2011). The World as a Graph: Defending Metaphysical Graphical Structuralism. Analysis 71 (1):10-21.score: 18.0
    Metaphysical graphical structuralism is the view that at some fundamental level the world is a mathematical graph of nodes and edges. Randall Dipert has advanced a graphical structuralist theory of fundamental particulars and Alexander Bird has advanced a graphical structuralist theory of fundamental properties. David Oderberg has posed a powerful challenge to graphical structuralism: that it entails the absurd inexistence of the world or the absurd cessation of all change. In this paper I defend graphical structuralism. A sharper formulation, (...)
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  3. Priti Shah & Eric G. Freedman (2011). Bar and Line Graph Comprehension: An Interaction of Top‐Down and Bottom‐Up Processes. Topics in Cognitive Science 3 (3):560-578.score: 18.0
    This experiment investigated the effect of format (line vs. bar), viewers’ familiarity with variables, and viewers’ graphicacy (graphical literacy) skills on the comprehension of multivariate (three variable) data presented in graphs. Fifty-five undergraduates provided written descriptions of data for a set of 14 line or bar graphs, half of which depicted variables familiar to the population and half of which depicted variables unfamiliar to the population. Participants then took a test of graphicacy skills. As predicted, the format influenced viewers’ interpretations (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Haiyan Xu, Keith W. Hipel, D. Marc Kilgour & Ye Chen (2010). Combining Strength and Uncertainty for Preferences in the Graph Model for Conflict Resolution with Multiple Decision Makers. Theory and Decision 69 (4):497-521.score: 18.0
    A hybrid preference framework is proposed for strategic conflict analysis to integrate preference strength and preference uncertainty into the paradigm of the graph model for conflict resolution (GMCR) under multiple decision makers. This structure offers decision makers a more flexible mechanism for preference expression, which can include strong or mild preference of one state or scenario over another, as well as equal preference. In addition, preference between two states can be uncertain. The result is a preference framework that is (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Zhang Chen, Min Liu, Donald William Gross & Christian Beaulieu (2013). Graph Theoretical Analysis of Developmental Patterns of the White Matter Network. Frontiers in Human Neuroscience 7.score: 18.0
    Understanding the development of human brain organization is critical for gaining insight into how the enhancement of cognitive processes is related to the fine-tuning of the brain network. However, the developmental trajectory of the large-scale white matter (WM) network is not fully understood. Here, using graph theory, we examine developmental changes in the organization of WM networks in 180 typically-developing participants. WM networks were constructed using whole brain tractography and 78 cortical regions of interest were extracted from each participant. (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. R. C. Miall S. Sami (2013). Graph Network Analysis of Immediate Motor-Learning Induced Changes in Resting State BOLD. Frontiers in Human Neuroscience 7.score: 18.0
    Recent studies have demonstrated that following learning tasks, changes in the resting state activity of the brain shape regional connections in functionally specific circuits. Here we expand on these findings by comparing changes induced in the resting state immediately following four motor tasks. Two groups of participants performed a visuo-motor joystick task with one group adapting to a transformed relationship between joystick and cursor. Two other groups were trained in either explicit or implicit procedural sequence learning. Resting state BOLD data (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Samuel Coskey, Paul Ellis & Scott Schneider (2011). The Conjugacy Problem for the Automorphism Group of the Random Graph. Archive for Mathematical Logic 50 (1):215-221.score: 18.0
    We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. Martin Kronbichler Melanie Tschernegg, Julia S. Crone, Tina Eigenberger, Philipp Schwartenbeck, Mira Fauth-Bühler, Tagrid Lemènager, Karl Mann, Natasha Thon, Friedrich M. Wurst (2013). Abnormalities of Functional Brain Networks in Pathological Gambling: A Graph-Theoretical Approach. Frontiers in Human Neuroscience 7.score: 18.0
    Functional neuroimaging studies of pathological gambling demonstrate alterations in frontal and subcortical regions of the mesolimbic reward system. However, most investigations were performed using tasks involving reward processing or executive functions. Little is known about brain network abnormalities during task-free resting state in pathological gambling. In the present study, graph-theoretical methods were used to investigate network properties of resting state functional MRI data in pathological gambling. We compared 19 patients with pathological gambling to 19 healthy controls using the (...) Analysis Toolbox (GAT). None of the examined global metrics differed between groups. At the nodal level, pathological gambler showed a reduced clustering coefficient in the left paracingulate cortex and the left juxtapositional lobe (SMA), reduced local efficiency in the left SMA, as well as an increased node betweenness for the left and right paracingulate cortex and the left SMA. At an uncorrected threshold level, the node betweenness in the left inferior frontal gyrus was decreased and increased in the caudate. Additionally, increased functional connectivity between fronto-striatal regions and within frontal regions has also been found for the gambling patients. These findings suggest that regions associated with the reward system demonstrate reduced segregation but enhanced integration while regions associated with executive functions demonstrate reduced integration. The present study makes evident that pathological gambling is also associated with abnormalities in the topological network structure of the brain during rest. Since alterations in pathological gambling cannot be explained by direct effects of abused substances on the brain, these findings will be of relevance for understanding functional connectivity in other addictive disorders. (shrink)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Dao-Zhi Zeng, Liping Fang, Keith W. Hipel & D. Marc Kilgour (2004). Policy Stable States in the Graph Model for Conflict Resolution. Theory and Decision 57 (4):345-365.score: 18.0
    A new approach to policy analysis is formulated within the framework of the graph model for conflict resolution. A policy is defined as a plan of action for a decision maker (DM) that specifies the DM’s intended action starting at every possible state in a graph model of a conflict. Given a profile of policies, a Policy Stable State (PSS) is a state that no DM moves away from (according to its policy), and such that no DM would (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Sahotra Sarkar (1990). On Adaptation: A Reduction of the Kauffman-Levin Model to a Problem in Graph Theory and its Consequences. [REVIEW] Biology and Philosophy 5 (2):127-148.score: 16.0
    It is shown that complex adaptations are best modelled as discrete processes represented on directed weighted graphs. Such a representation captures the idea that problems of adaptation in evolutionary biology are problems in a discrete space, something that the conventional representations using continuous adaptive landscapes does not. Further, this representation allows the utilization of well-known algorithms for the computation of several biologically interesting results such as the accessibility of one allele from another by a specified number of point mutations, the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Jun Soo Kwon Seung-Goo Kim, Wi Hoon Jung, Sung Nyun Kim, Joon Hwan Jang (2013). Disparity Between Dorsal and Ventral Networks in Patients with Obsessive-Compulsive Disorder: Evidence Revealed by Graph Theoretical Analysis Based on Cortical Thickness From MRI. Frontiers in Human Neuroscience 7.score: 15.0
  12. William Gasarch & Jeffry L. Hirst (1998). Reverse Mathematics and Recursive Graph Theory. Mathematical Logic Quarterly 44 (4):465-473.score: 15.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  13. Matthias Dehmer & Abbe Mowshowitz (2011). Generalized Graph Entropies. Complexity 17 (2):45-50.score: 15.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  14. D. Marc Kilgour, Liping Fang & Keith W. Hipel (1990). A Decision Support System for the Graph Model of Conflicts. Theory and Decision 28 (3):289-311.score: 15.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Ismo T. Koponen (2014). Systemic View of Learning Scientific Concepts: A Description in Terms of Directed Graph Model. Complexity 19 (3):27-37.score: 15.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. J. H. Schmerl (2000). Graph Coloring and Reverse Mathematics. Mathematical Logic Quarterly 46 (4):543-548.score: 15.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Stephen F. Bush & Sanjay Goel (forthcoming). Graph Spectra for Communications in Biological and Carbon Nanotube Networks. Ieee Journal on Selected Areas in Communications:1--10.score: 15.0
    No categories
     
    My bibliography  
     
    Export citation  
  18. Nataša Pržulj (2011). Protein‐Protein Interactions: Making Sense of Networks Via Graph‐Theoretic Modeling. Bioessays 33 (2):115-123.score: 15.0
  19. Landon Rabern, Brian Rabern & Matthew Macauley (2013). Dangerous Reference Graphs and Semantic Paradoxes. Journal of Philosophical Logic 42 (5):727-765.score: 12.0
    The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  20. D. S. Oderberg (2012). Graph Structuralism and its Discontents: Rejoinder to Shackel. Analysis 72 (1):94-98.score: 12.0
    Nicholas Shackel (2011) has proposed a number of arguments to save the Dipert–Bird model of physical reality from the sorts of unpalatable consequence I identified in Oderberg 2011. Some consequences, he thinks, are only apparent; others are real but palatable. In neither case does he seem to me to have deflected the concerns I raised, leaving graph structuralism on Dipert–Bird lines as problematic as ever.
    No categories
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  21. Wilfried Sieg & John Byrnes, K-Graph Machines: Generalizing Turing's Machines and Arguments.score: 12.0
    Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Eero Hyvönen (1986). Applying a Logical Interpretation of Semantic Nets and Graph Grammars to Natural Language Parsing and Understanding. Synthese 66 (1):177 - 190.score: 12.0
    In this paper a logical interpretation of semantic nets and graph grammars is proposed for modelling natural language understanding and creating language understanding computer systems. An example of parsing a Finnish question by graph grammars and inferring the answer to it by a semantic net representation is provided.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  23. Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.score: 12.0
    In this paper the existence or nonexistence of isomorphic mappings between graph models for the untyped lambda calculus is studied. It is shown that Engeler's D A is completely determined, up to isomorphism, by the cardinality of its `atom-set' A. A similar characterization is given for a collection of graph models of the Pω-type; from this some propositions regarding automorphisms are obtained. Also we give an indication of the complexity of the first-order theory of graph models by (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. Wilfried Sieg & John Byrnes, Gödel, Turing, and K-Graph Machines.score: 12.0
    Wilfried Sieg and John Byrnes. Gödel, Turing, and K-Graph Machines.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  25. Alexander Gebharter & Marie I. Kaiser (2014). Causal Graphs and Biological Mechanisms. In Marie I. Kaiser, Oliver Scholz, Daniel Plenge & Andreas Hüttemann (eds.), Explanation in the special sciences: The case of biology and history. Springer. 55-85.score: 12.0
    Modeling mechanisms is central to the biological sciences – for purposes of explanation, prediction, extrapolation, and manipulation. A closer look at the philosophical literature reveals that mechanisms are predominantly modeled in a purely qualitative way. That is, mechanistic models are conceived of as representing how certain entities and activities are spatially and temporally organized so that they bring about the behavior of the mechanism in question. Although this adequately characterizes how mechanisms are represented in biology textbooks, contemporary biological research practice (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  26. Yun Lu (2013). Reducts of the Random Bipartite Graph. Notre Dame Journal of Formal Logic 54 (1):33-46.score: 12.0
    Let $\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\Gamma$ that preserve sides. We classify the closed permutation subgroups containing the group $\operatorname {Aut}(\Gamma)^{\ast}$ , where $\operatorname {Aut}(\Gamma)^{\ast}$ is the group of all isomorphisms and anti-isomorphisms of $\Gamma$ preserving the two sides. Our results rely on a combinatorial theorem of Nešetřil and Rödl and (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  27. Stephen G. Simpson (1994). On the Strength of König's Duality Theorem for Countable Bipartite Graphs. Journal of Symbolic Logic 59 (1):113-123.score: 12.0
    Let CKDT be the assertion that for every countably infinite bipartite graph G, there exist a vertex covering C of G and a matching M in G such that C consists of exactly one vertex from each edge in M. (This is a theorem of Podewski and Steffens [12].) Let ATR0 be the subsystem of second-order arithmetic with arithmetical transfinite recursion and restricted induction. Let RCA0 be the subsystem of second-order arithmetic with recursive comprehension and restricted induction. We show (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  28. Matthew Tugby (2013). Graph-Theoretic Models of Dispositional Structures. International Studies in the Philosophy of Science 27 (1):23-39.score: 12.0
    The focus of this article is the view about fundamental natural properties known as dispositional monism. This is a holistic view about nature, according to which all properties are essentially interrelated. The general question to be addressed concerns what kinds of features relational structures of properties should be thought to have. I use Bird's graph-theoretic framework for representing dispositional structures as a starting point, before arguing that it is inadequate in certain important respects. I then propose a more parsimonious (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  29. Steve Warner (2001). The Cofinality of the Random Graph. Journal of Symbolic Logic 66 (3):1439-1446.score: 12.0
    We show that under Martin's Axiom, the cofinality cf(Aut(Γ)) of the automorphism group of the random graph Γ is 2 ω.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  30. John M. Harris, Jeffry L. Hirst & Michael J. Mossinghoff (2008). Combinatorics and Graph Theory. Springer.score: 12.0
    This book covers a wide variety of topics in combinatorics and graph theory.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  31. V. Le Rolle, A. I. Hernandez, P. Y. Richard, J. Buisson & G. Carrault (2005). A Bond Graph Model of the Cardiovascular System. Acta Biotheoretica 53 (4).score: 12.0
    The study of the autonomic nervous system (ANS) function has shown to provide useful indicators for risk stratification and early detection on a variety of cardiovascular pathologies. However, data gathered during different tests of the ANS are difficult to analyse, mainly due to the complex mechanisms involved in the autonomic regulation of the cardiovascular system (CVS). Although model-based analysis of ANS data has been already proposed as a way to cope with this complexity, only a few models coupling the main (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. James E. Baumgartner (1984). Generic Graph Construction. Journal of Symbolic Logic 49 (1):234-240.score: 12.0
    It is shown that if ZF is consistent, then so is ZFC + GCH + "There is a graph with cardinality ℵ 2 and chromatic number ℵ 2 such that every subgraph of cardinality ≤ ℵ 1 has chromatic number ≤ ℵ 0 ". This partially answers a question of Erdos and Hajnal.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  33. Gregor Betz (2005). The Vicious Circle Theorem – a Graph-Theoretical Analysis of Dialectical Structures. Argumentation 19 (1):53-64.score: 12.0
    This article sets up a graph-theoretical framework for argumentation-analysis (dialectical analysis) which expands classical argument-analysis. Within this framework, a main theorem on the existence of inconsistencies in debates is stated and proved: the vicious circle theorem. Subsequently, two corollaries which generalize the main theorem are derived. Finally, a brief outlook is given on further expansions and possible applications of the developed framework.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  34. Madalina Croitoru, A Conceptual Graph Approach to the Generation of Referring Expressions.score: 12.0
    This paper presents a Conceptual Graph (CG) framework to the Generation of Referring Expressions (GRE). Employing Conceptual Graphs as the underlying formalism allows a rigorous, semantically rich, approach to GRE. A number of advantages over existing work are discussed. The new framework is also used to revisit existing complexity results in a fully rigorous way, showing that the expressive power of CGs does not increase the theoretical complexity of GRE.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  35. Mirna Džamonja, Péter Komjáth & Charles Morgan (2004). Wild Edge Colourings of Graphs. Journal of Symbolic Logic 69 (1):255 - 264.score: 12.0
    We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ is (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  36. Thomas Richardson & Peter Spirtes, Scoring Ancestral Graph Models.score: 12.0
    Thomas Richardson and Peter Spirtes. Scoring Ancestral Graph Models.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. B. Courcelle (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press.score: 12.0
    Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index.
    Direct download  
     
    My bibliography  
     
    Export citation  
  38. Matthew Jura, Oscar Levin & Tyler Markkanen (2014). Domatic Partitions of Computable Graphs. Archive for Mathematical Logic 53 (1-2):137-155.score: 12.0
    Given a graph G, we say that a subset D of the vertex set V is a dominating set if it is near all the vertices, in that every vertex outside of D is adjacent to a vertex in D. A domatic k-partition of G is a partition of V into k dominating sets. In this paper, we will consider issues of computability related to domatic partitions of computable graphs. Our investigation will center on answering two types of questions (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Osamu Katai, Katsushi Minamizono, Takayuki Shiose & Hiroshi Kawakami (2007). System Design of “Ba”-Like Stages for Improvisational Acts Via Leibnizian Space–Time and Peirce's Existential Graph Concepts. AI and Society 22 (2):101-112.score: 12.0
    A framework for “improvisational” social acts and communication is introduced by referring to the idea of “relationalism” such as natural farming, permaculture and deep ecology. Based on this conception, the notion of Existential Graph by C. S. Peirce is introduced. The notion of extended self in deep ecology is substantiated based on the Roy Adaptation Model in Nursing Theory and Narrative approaches. By focusing on Leibnizian notions of space and time and by introducing Petri net, a spatio-temporal model of (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  40. Christopher Meek, Related Graphical Frameworks: Undircted, Directed Acyclic and Chain Graph Models.score: 12.0
    Christopher Meek. Related Graphical Frameworks: Undircted, Directed Acyclic and Chain Graph Models.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Rafael De Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661 - 672.score: 12.0
    Recently, several authors have claimed to have found graph-theoretic counterexamples to the Principle of the Identity of Indiscernibles (PII). In this paper, I argue that their counterexamples presuppose a certain view of what unlabeled graphs are, and that this view is optional at best.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  42. Lauri Hella & Juha Nurmonen (2000). Vectorization Hierarchies of Some Graph Quantifiers. Archive for Mathematical Logic 39 (3):183-207.score: 12.0
    We give a sufficient condition for the inexpressibility of the k-th extended vectorization of a generalized quantifier $\sf Q$ in ${\rm FO}({\vec Q}_k)$ , the extension of first-order logic by all k-ary quantifiers. The condition is based on a model construction which, given two ${\rm FO}({\vec Q}_1)$ -equivalent models with certain additional structure, yields a pair of ${\rm FO}({\vec Q}_k)$ -equivalent models. We also consider some applications of this condition to quantifiers that correspond to graph properties, such as connectivity (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Christopher D. Manning, Robust Textual Inference Via Graph Matching.score: 12.0
    We present a system for deciding whether a given sentence can be inferred from text. Each sentence is represented as a directed graph (extracted from a dependency parser) in which the nodes represent words or phrases, and the links represent syntactic and semantic relationships. We develop a learned graph matching model to approximate entailment by the amount of the sentence’s semantic content which is contained in the text. We present results on the Recognizing Textual Entailment dataset (Dagan et (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  44. Stephan Eliez Marie-Christine Ottet, Marie Schaer, Martin Debbané, Leila Cammoun, Jean-Philippe Thiran (2013). Graph Theory Reveals Dysconnected Hubs in 22q11DS and Altered Nodal Efficiency in Patients with Hallucinations. Frontiers in Human Neuroscience 7.score: 12.0
    Schizophrenia is postulated to be the prototypical dysconnection disorder, in which hallucinations are the core symptom. Due to high heterogeneity in methodology across studies and the clinical phenotype, it remains unclear whether the structural brain dysconnection is global or focal and if clinical symptoms result from this dysconnection. In the present work, we attempt to clarify this issue by studying a population considered as a homogeneous genetic sub-type of schizophrenia, namely the 22q11.2 deletion syndrome (22q11.2DS). Cerebral MRIs were acquired for (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  45. Steve Warner (2004). The Cofinality of the Saturated Uncountable Random Graph. Archive for Mathematical Logic 43 (5):665-679.score: 12.0
    Assuming CH, let be the saturated random graph of cardinality ω1. In this paper we prove that it is consistent that and can be any two prescribed regular cardinals subject only to the requirement.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Jun Soo Kwon Wi Hoon Jung, Sung Nyun Kim, Tae Young Lee, Joon Hwan Jang, Chi-Hoon Choi, Do-Hyung Kang (2013). Exploring the Brains of Baduk (Go) Experts: Gray Matter Morphometry, Resting-State Functional Connectivity, and Graph Theoretical Analysis. Frontiers in Human Neuroscience 7.score: 12.0
    One major characteristic of experts is intuitive judgment, which is an automatic process whereby patterns stored in memory through long-term training are recognized. Indeed, long-term training may influence brain structure and function. A recent study revealed that chess experts at rest showed differences in structure and functional connectivity (FC) in the head of caudate, which is associated with rapid best next-move generation. However, less is known about the structure and function of the brains of Baduk experts compared with those of (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Laurence Kirby (2013). Ordinal Operations on Graph Representations of Sets. Mathematical Logic Quarterly 59 (1):19-26.score: 11.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  48. Edward C. Rosenthal (1988). Communication and its Cost in Graph-Restricted Games. Theory and Decision 25 (3):275-286.score: 11.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  49. Jeffrey J. Kline & Shravan Luckraz, A Note on the Relationship Between Graphs and Information Protocols.score: 10.0
    Information protocols (IP's) were developed to describe players who learn their social situation by their experiences. Although IP's look similar to colored multi-graphs (MG's), the two objects are constructed in fundamentally different ways. IP's are constructed using the global concept of history, whereas graphs are constructed using the local concept of edges. We give necessary and sufficient conditions for each theory to be captured by the other. We find that the necessary and sufficient condition for IP theory to be captured (...)
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  50. Thomas Richardson & Peter Spirtes, Ancestral Graph Markov Models.score: 10.0
    This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 730