Vertex - PDFSEARCH.IO - Document Search Engine

Vertex
Results: 1582

#	Item
261	SYMBOLIC REPRESENTATIONS OF NONEXPANSIVE GROUP AUTOMORPHISMS ELON LINDENSTRAUSS AND KLAUS SCHMIDT Abstract. If α is an irreducible nonexpansive ergodic automorphism of a compact abelian group X (such as an irreducible n Add to Reading List Source URL: www.ma.huji.ac.il Language: English - Date: 2005-01-17 11:24:56 Ergodic theory Stochastic processes Operator theory Mixing Symbol Invariant measure Ergodicity Constructible universe Von Neumann algebra Vertex operator algebra Differential forms on a Riemann surface
262	Jaccard Coefficients as a Potential Graph Benchmark Peter M. Kogge McCourtney Prof. of CSE Univ. of Notre Dame Add to Reading List Source URL: graphanalysis.org Language: English - Date: 2016-06-14 13:01:56 Graph theory Graph Vertex Distance Tree Jaccard index
263	Network Topology and Equilibrium Existence in Weighted Network Congestion Games Add to Reading List Source URL: faculty.biu.ac.il Language: English - Date: 2016-06-03 10:53:08 Game theory Congestion game Potential game Vertex Graph Nash equilibrium Strategy End
264	arXiv:1409.1201v1 [math.RT] 3 SepTWISTED DEMAZURE MODULES, FUSION PRODUCT DECOMPOSITION AND TWISTED Q–SYSTEMS DENIZ KUS AND R. VENKATESH Abstract. In this paper, we introduce a family of indecomposable finite– Add to Reading List Source URL: www.math.tifr.res.in Language: English - Date: 2014-11-05 03:49:05 Lie algebras Ring theory Representation theory Lie groups Demazure module Root system Graded ring Symbol Ring Weight Vertex operator algebra Quantum group
265	Graph Data in R with RNeo4j Jesús Barrasa London, 30th Nov 2015 London R Meeting These are not graphs, they are charts Add to Reading List Source URL: www.londonr.org - Date: 2015-12-01 07:21:17 Graph theory Igraph Graph Vertex Graph Modelling Language Bipartite graph
266	Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks Bernold Fiedler* Atsushi Mochizuki Gen Kurosawa Add to Reading List Source URL: dynamics.mi.fu-berlin.de Language: English - Date: 2013-04-16 09:35:12
267	Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1 Add to Reading List Source URL: discretemath.imp.fu-berlin.de Language: English - Date: 2015-05-31 09:10:32
268	New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2015-07-28 05:00:07 Polyhedral combinatorics Polytopes Polyhedra Convex geometry Real algebraic geometry Face Vertex enumeration problem Upper bound theorem Cyclic polytope LemkeHowson algorithm Abstract polytope
269	Erratum: Long-Range Frustration in a Spin-Glass Model of the Vertex-Cover Problem [Phys. Rev. Lett. 94, Haijun Zhou State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Chinese Ac Add to Reading List Source URL: power.itp.ac.cn Language: English - Date: 2012-11-04 02:00:50
270	Microsoft Word - word_tzmen6YPC596WbU8QXko.doc Add to Reading List Source URL: cnls-www.lanl.gov Language: English - Date: 2014-09-24 18:52:42 Condensed matter physics Physics Materials science Statistical mechanics Lattice models Mechanics Geometrical frustration Thermodynamic entropy Vertex model Thermodynamic temperature Spin ice Ice Ih

UPDATE