4,053 research outputs found
Symmetric isostatic frameworks with or distance constraints
Combinatorial characterisations of minimal rigidity are obtained for
symmetric 2-dimensional bar-joint frameworks with either or
distance constraints. The characterisations are expressed in
terms of symmetric tree packings and the number of edges fixed by the symmetry
operations. The proof uses new Henneberg-type inductive construction schemes.Comment: 20 pages. Main theorem extended. Construction schemes refined. New
titl
Convergence towards an asymptotic shape in first-passage percolation on cone-like subgraphs of the integer lattice
In first-passage percolation on the integer lattice, the Shape Theorem
provides precise conditions for convergence of the set of sites reachable
within a given time from the origin, once rescaled, to a compact and convex
limiting shape. Here, we address convergence towards an asymptotic shape for
cone-like subgraphs of the lattice, where . In particular, we
identify the asymptotic shapes associated to these graphs as restrictions of
the asymptotic shape of the lattice. Apart from providing necessary and
sufficient conditions for - and almost sure convergence towards this
shape, we investigate also stronger notions such as complete convergence and
stability with respect to a dynamically evolving environment.Comment: 23 pages. Together with arXiv:1305.6260, this version replaces the
old. The main results have been strengthened and an earlier error in the
statement corrected. To appear in J. Theoret. Proba
FS^3: A Sampling based method for top-k Frequent Subgraph Mining
Mining labeled subgraph is a popular research task in data mining because of
its potential application in many different scientific domains. All the
existing methods for this task explicitly or implicitly solve the subgraph
isomorphism task which is computationally expensive, so they suffer from the
lack of scalability problem when the graphs in the input database are large. In
this work, we propose FS^3, which is a sampling based method. It mines a small
collection of subgraphs that are most frequent in the probabilistic sense. FS^3
performs a Markov Chain Monte Carlo (MCMC) sampling over the space of a
fixed-size subgraphs such that the potentially frequent subgraphs are sampled
more often. Besides, FS^3 is equipped with an innovative queue manager. It
stores the sampled subgraph in a finite queue over the course of mining in such
a manner that the top-k positions in the queue contain the most frequent
subgraphs. Our experiments on database of large graphs show that FS^3 is
efficient, and it obtains subgraphs that are the most frequent amongst the
subgraphs of a given size
The Gewirtz graph: An exercise in the theory of graph spectra
Graphs;mathematics
On the hardness of recognizing triangular line graphs
Given a graph G, its triangular line graph is the graph T(G) with vertex set
consisting of the edges of G and adjacencies between edges that are incident in
G as well as being within a common triangle. Graphs with a representation as
the triangular line graph of some graph G are triangular line graphs, which
have been studied under many names including anti-Gallai graphs, 2-in-3 graphs,
and link graphs. While closely related to line graphs, triangular line graphs
have been difficult to understand and characterize. Van Bang Le asked if
recognizing triangular line graphs has an efficient algorithm or is
computationally complex. We answer this question by proving that the complexity
of recognizing triangular line graphs is NP-complete via a reduction from
3-SAT.Comment: 18 pages, 8 figures, 4 table
- …