Results 31 to 40 of about 40,667 (118)
Tunneling behavior of Ising and Potts models in the low-temperature regime [PDF]
, 2018 We consider the ferromagnetic $q$-state Potts model with zero external field in a finite volume and assume that the stochastic evolution of this system is described by a Glauber-type dynamics parametrized by the inverse temperature $\beta$.
Nardi, Francesca R., Zocca, Alessandro
core +3 more sources
Graph States, Pivot Minor, and Universality of (X,Z)-measurements [PDF]
, 2012 The graph state formalism offers strong connections between quantum information processing and graph theory. Exploring these connections, first we show that any graph is a pivot-minor of a planar graph, and even a pivot minor of a triangular grid.
Mhalla, Mehdi, Perdrix, Simon
core +1 more source
Causal Domain Restriction for Eikonal Equations
, 2014 Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations.
Chacon, Adam +2 more
core +1 more source
An isoperimetric inequality and pursuit-evasion games on triangular grid graphs
Discrete Applied Mathematics19 pages, 10 figures ...
Athipatana Iamphongsai +1 more
openaire +2 more sources
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
, 2017 We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments,
A Garg +29 more
core +1 more source
Reconfiguration of labeled matchings in triangular grid graphs
This paper introduces a new reconfiguration problem of matchings in a triangular grid graph. In this problem, we are given a nearly perfect matching in which each matching edge is labeled, and aim to transform it to a target matching by sliding edges one by one. This problem is motivated to investigate the solvability of a sliding-block puzzle called ``
Kakimura, Naonori, Mishima, Yuta
openaire +4 more sources
The Large Scale Curvature of Networks
, 2009 Understanding key structural properties of large scale networks are crucial for analyzing and optimizing their performance, and improving their reliability and security.
B. Fortz +11 more
core +1 more source
Notes on large angle crossing graphs
, 2010 A graph G is an a-angle crossing (aAC) graph if every pair of crossing edges in G intersect at an angle of at least a. The concept of right angle crossing (RAC) graphs (a=Pi/2) was recently introduced by Didimo et. al.
Dujmovic, Vida +3 more
core +3 more sources
Nova Scientia, 2018 Reverse Cuthill McKee (RCM) reordering can be applied to either edges or elements of unstructured meshes (triangular/tetrahedral) , in accordance to the respective finite element formulation, to reduce the bandwidth of stiffness matrices .
Gerardo Mario Ortigoza Capetillo +2 more
doaj
Sandpile probabilities on triangular and hexagonal lattices
, 2017 We consider the Abelian sandpile model on triangular and hexagonal lattices. We compute several height probabilities on the full plane and on half-planes, and discuss some properties of the universality of the model.Comment: 26 pages, 12 figures.
Poncelet, Adrien, Ruelle, Philippe
core +1 more source