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

441 found
Order:
  1. Nicholas Shackel (2011). The World as a Graph: Defending Metaphysical Graphical Structuralism. Analysis 71 (1):10-21.
    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 (10 more)  
     
    Export citation  
     
    My bibliography  
  2. Rafael de Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661-672.
    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)  
     
    Export citation  
     
    My bibliography  
  3.  26
    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.
    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)  
     
    Export citation  
     
    My bibliography   4 citations  
  4.  13
    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.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  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.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  6.  10
    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.
    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)  
     
    Export citation  
     
    My bibliography  
  7.  4
    J. H. Schmerl (2000). Graph Coloring and Reverse Mathematics. Mathematical Logic Quarterly 46 (4):543-548.
    Improving a theorem of Gasarch and Hirst, we prove that if 2 ≤ k ≤ m < ω, then the following is equivalent to WKL0 over RCA0 Every locally k-colorable graph is m-colorable.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  37
    Matthias Dehmer & Abbe Mowshowitz (2011). Generalized Graph Entropies. Complexity 17 (2):45-50.
  9.  4
    Thomas M. Gruenenfelder, Gabriel Recchia, Tim Rubin & Michael N. Jones (2015). Graph‐Theoretic Properties of Networks Based on Word Association Norms: Implications for Models of Lexical Semantic Memory. Cognitive Science 40 (1):n/a-n/a.
    We compared the ability of three different contextual models of lexical semantic memory and of a simple associative model to predict the properties of semantic networks derived from word association norms. None of the semantic models were able to accurately predict all of the network properties. All three contextual models over-predicted clustering in the norms, whereas the associative model under-predicted clustering. Only a hybrid model that assumed that some of the responses were based on a contextual model and others on (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  10.  10
    William Gasarch & Jeffry L. Hirst (1998). Reverse Mathematics and Recursive Graph Theory. Mathematical Logic Quarterly 44 (4):465-473.
    We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  10
    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.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  12.  9
    Ismo T. Koponen (2014). Systemic View of Learning Scientific Concepts: A Description in Terms of Directed Graph Model. Complexity 19 (3):27-37.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  13.  4
    Nataša Pržulj (2011). Protein‐Protein Interactions: Making Sense of Networks Via Graph‐Theoretic Modeling. Bioessays 33 (2):115-123.
  14.  8
    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.
    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)  
     
    Export citation  
     
    My bibliography  
  15. 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.
    No categories
     
    Export citation  
     
    My bibliography  
  16. Andrey Bovykin (2010). Unprovability Threshold for the Planar Graph Minor Theorem. Annals of Pure and Applied Logic 162 (3):175-181.
    This note is part of the implementation of a programme in foundations of mathematics to find exact threshold versions of all mathematical unprovability results known so far, a programme initiated by Weiermann. Here we find the exact versions of unprovability of the finite graph minor theorem with growth rate condition restricted to planar graphs, connected planar graphs and graphs embeddable into a given surface, assuming an unproved conjecture : ‘there is a number a>0 such that for all k≥3, and (...) minor theorem. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  17.  14
    Marcel Weber, On the Incompatibility of Dynamical Biological Mechanisms and Causal Graph Theory.
    I examine the adequacy of the causal graph-structural equations approach to causation for modeling biological mechanisms. I focus in particular on mechanisms with complex dynamics such as the PER biological clock mechanism in Drosophila. I show that a quantitative model of this mechanism that uses coupled differential equations – the well-known Goldbeter model – cannot be adequately represented in the standard causal graph framework, even though this framework does permit causal cycles. The reason is that the model contains (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18.  9
    Gregor Betz (2005). The Vicious Circle Theorem – a Graph-Theoretical Analysis of Dialectical Structures. Argumentation 19 (1):53-64.
    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)  
     
    Export citation  
     
    My bibliography   5 citations  
  19.  16
    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.
    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)  
     
    Export citation  
     
    My bibliography   1 citation  
  20.  3
    B. Courcelle (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press.
    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  
     
    Export citation  
     
    My bibliography   1 citation  
  21.  2
    Laurence Kirby (2013). Ordinal Operations on Graph Representations of Sets. Mathematical Logic Quarterly 59 (1):19-26.
    Any set x is uniquely specified by the graph of the membership relation on the set obtained by adjoining x to the transitive closure of x. Thus any operation on sets can be looked at as an operation on these graphs. We look at the operations of ordinal arithmetic of sets in this light. This turns out to be simplest for a modified ordinal arithmetic based on the Zermelo ordinals, instead of the usual von Neumann ordinals. In this arithmetic, (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22.  44
    D. S. Oderberg (2012). Graph Structuralism and its Discontents: Rejoinder to Shackel. Analysis 72 (1):94-98.
    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)  
     
    Export citation  
     
    My bibliography  
  23.  4
    Mario Benevides & L. Schechter (2009). Using Modal Logics to Express and Check Global Graph Properties. Logic Journal of the IGPL 17 (5):559-587.
    Graphs are among the most frequently used structures in Computer Science. Some of the properties that must be checked in many applications are connectivity, acyclicity and the Eulerian and Hamiltonian properties. In this work, we analyze how we can express these four properties with modal logics. This involves two issues: whether each of the modal languages under consideration has enough expressive power to describe these properties and how complex it is to use these logics to actually test whether a given (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  18
    Matthew Tugby (2013). Graph-Theoretic Models of Dispositional Structures. International Studies in the Philosophy of Science 27 (1):23-39.
    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)  
     
    Export citation  
     
    My bibliography  
  25.  7
    Steve Warner (2004). The Cofinality of the Saturated Uncountable Random Graph. Archive for Mathematical Logic 43 (5):665-679.
    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.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  8
    Lauri Hella & Juha Nurmonen (2000). Vectorization Hierarchies of Some Graph Quantifiers. Archive for Mathematical Logic 39 (3):183-207.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  27.  17
    Wilfried Sieg & John Byrnes, K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  28.  17
    Madalina Croitoru, A Conceptual Graph Approach to the Generation of Referring Expressions.
    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
      Direct download  
     
    Export citation  
     
    My bibliography  
  29.  24
    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.
    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)  
     
    Export citation  
     
    My bibliography  
  30.  4
    Bruno Courcelle & Igor Walukiewicz (1998). Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Annals of Pure and Applied Logic 92 (1):35-62.
    We prove that every monadic second-order property of the unfolding of a transition system is a monadic second-order property of the system itself. An unfolding is an instance of the general notion of graph covering. We consider two more instances of this notion. A similar result is possible for one of them but not for the other.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  16
    Steve Warner (2001). The Cofinality of the Random Graph. Journal of Symbolic Logic 66 (3):1439-1446.
    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)  
     
    Export citation  
     
    My bibliography  
  32.  5
    James E. Baumgartner (1984). Generic Graph Construction. Journal of Symbolic Logic 49 (1):234-240.
    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 (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  33.  6
    Christopher Meek, Related Graphical Frameworks: Undircted, Directed Acyclic and Chain Graph Models.
    Christopher Meek. Related Graphical Frameworks: Undircted, Directed Acyclic and Chain Graph Models.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34.  8
    Thomas Richardson & Peter Spirtes, Scoring Ancestral Graph Models.
    Thomas Richardson and Peter Spirtes. Scoring Ancestral Graph Models.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35.  9
    Wilfried Sieg & John Byrnes, Gödel, Turing, and K-Graph Machines.
    Wilfried Sieg and John Byrnes. Gödel, Turing, and K-Graph Machines.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36.  11
    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):295-312.
    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 (3 more)  
     
    Export citation  
     
    My bibliography  
  37.  9
    Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
    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 (7 more)  
     
    Export citation  
     
    My bibliography  
  38.  5
    Yun Lu (2013). Reducts of the Random Bipartite Graph. Notre Dame Journal of Formal Logic 54 (1):33-46.
    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)  
     
    Export citation  
     
    My bibliography  
  39.  1
    Su Gao & Chuang Shao (2006). Random Generations of the Countable Random Graph. Annals of Pure and Applied Logic 143 (1):79-86.
    We consider random processes more general than those considered by Erdös and Rényi for generating the countable random graph. It is proved that, in the category sense, almost all random processes we consider generate the countable random graph with probability 1. Under a weak boundedness assumption we give a criterion for the random processes which generate the countable random graph almost surely. We also consider further questions asked by Jackson regarding the outcome graphs when the process fails (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  40.  2
    Rafael De Clercq (2012). On Some Putative Graph-Theoretic Counterexamples to the Principle of the Identity of Indiscernibles. Synthese 187 (2):661 - 672.
    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.
    Direct download  
     
    Export citation  
     
    My bibliography  
  41.  1
    Christopher D. Manning, Robust Textual Inference Via Graph Matching.
    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
      Direct download  
     
    Export citation  
     
    My bibliography  
  42.  4
    John M. Harris, Jeffry L. Hirst & Michael J. Mossinghoff (2008). Combinatorics and Graph Theory. Springer.
    This book covers a wide variety of topics in combinatorics and graph theory.
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  43. Matthias Dehmer, Xueliang Li & Yongtang Shi (2015). Connections Between Generalized Graph Entropies and Graph Energy. Complexity 21 (1):35-41.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  44. Jinhui Wang, Xindi Wang, Mingrui Xia, Xuhong Liao, Alan Evans & Yong He (2015). Corrigendum: GRETNA: A Graph Theoretical Network Analysis Toolbox for Imaging Connectomics. Frontiers in Human Neuroscience 9.
  45. Jinhui Wang, Xindi Wang, Mingrui Xia, Xuhong Liao, Alan Evans & Yong He (2015). GRETNA: A Graph Theoretical Network Analysis Toolbox for Imaging Connectomics. Frontiers in Human Neuroscience 9.
  46. Randall R. Dipert (1997). The Mathematical Structure of the World: The World as Graph. Journal of Philosophy 94 (7):329-358.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  47. Harvey Friedman, P01 INCOMPLETENESS: Finite Graph Theory.
    For digraphs G, we write V(G) for the set of all vertices of G, and E(G) for the set of all edges of G. A digraph on a set E is a digraph G where V(G) = E.
    No categories
     
    Export citation  
     
    My bibliography  
  48.  23
    Peter Spirtes, Ancestral Graph Markov Models.
    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
    Direct download  
     
    Export citation  
     
    My bibliography  
  49.  82
    David S. Oderberg (2010). The World is Not an Asymmetric Graph. Analysis 71 (1):3-10.
    mix of the concrete and the abstract (if we include universals, laws, propositions and the like), but whichever of these is the case, the world is not purely abstract, as a formal structure is. One might claim, however, that the world is a structure1 in the sense that it instantiates a structure and is nothing else. In other words, all there is to the..
    No categories
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  50.  68
    Luca Incurvati (2014). The Graph Conception of Set. Journal of Philosophical Logic 43 (1):181-208.
    The non-well-founded set theories described by Aczel (1988) have received attention from category theorists and computer scientists, but have been largely ignored by philosophers. At the root of this neglect might lie the impression that these theories do not embody a conception of set, but are rather of mere technical interest. This paper attempts to dispel this impression. I present a conception of set which may be taken as lying behind a non-well-founded set theory. I argue that the axiom AFA (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 441