262,818 research outputs found
Enumeration of spanning trees in a pseudofractal scale-free web
Spanning trees are an important quantity characterizing the reliability of a
network, however, explicitly determining the number of spanning trees in
networks is a theoretical challenge. In this paper, we study the number of
spanning trees in a small-world scale-free network and obtain the exact
expressions. We find that the entropy of spanning trees in the studied network
is less than 1, which is in sharp contrast to previous result for the regular
lattice with the same average degree, the entropy of which is higher than 1.
Thus, the number of spanning trees in the scale-free network is much less than
that of the corresponding regular lattice. We present that this difference lies
in disparate structure of the two networks. Since scale-free networks are more
robust than regular networks under random attack, our result can lead to the
counterintuitive conclusion that a network with more spanning trees may be
relatively unreliable.Comment: Definitive version accepted for publication in EPL (Europhysics
Letters
An approach to computing downward closures
The downward closure of a word language is the set of all (not necessarily
contiguous) subwords of its members. It is well-known that the downward closure
of any language is regular. While the downward closure appears to be a powerful
abstraction, algorithms for computing a finite automaton for the downward
closure of a given language have been established only for few language
classes.
This work presents a simple general method for computing downward closures.
For language classes that are closed under rational transductions, it is shown
that the computation of downward closures can be reduced to checking a certain
unboundedness property.
This result is used to prove that downward closures are computable for (i)
every language class with effectively semilinear Parikh images that are closed
under rational transductions, (ii) matrix languages, and (iii) indexed
languages (equivalently, languages accepted by higher-order pushdown automata
of order 2).Comment: Full version of contribution to ICALP 2015. Comments welcom
Fractal and Transfractal Recursive Scale-Free Nets
We explore the concepts of self-similarity, dimensionality, and
(multi)scaling in a new family of recursive scale-free nets that yield
themselves to exact analysis through renormalization techniques. All nets in
this family are self-similar and some are fractals - possessing a finite
fractal dimension - while others are small world (their diameter grows
logarithmically with their size) and are infinite-dimensional. We show how a
useful measure of "transfinite" dimension may be defined and applied to the
small world nets. Concerning multiscaling, we show how first-passage time for
diffusion and resistance between hub (the most connected nodes) scale
differently than for other nodes. Despite the different scalings, the Einstein
relation between diffusion and conductivity holds separately for hubs and
nodes. The transfinite exponents of small world nets obey Einstein relations
analogous to those in fractal nets.Comment: Includes small revisions and references added as result of readers'
feedbac
Spanning Trees on Graphs and Lattices in d Dimensions
The problem of enumerating spanning trees on graphs and lattices is
considered. We obtain bounds on the number of spanning trees and
establish inequalities relating the numbers of spanning trees of different
graphs or lattices. A general formulation is presented for the enumeration of
spanning trees on lattices in dimensions, and is applied to the
hypercubic, body-centered cubic, face-centered cubic, and specific planar
lattices including the kagom\'e, diced, 4-8-8 (bathroom-tile), Union Jack, and
3-12-12 lattices. This leads to closed-form expressions for for these
lattices of finite sizes. We prove a theorem concerning the classes of graphs
and lattices with the property that
as the number of vertices , where is a finite
nonzero constant. This includes the bulk limit of lattices in any spatial
dimension, and also sections of lattices whose lengths in some dimensions go to
infinity while others are finite. We evaluate exactly for the
lattices we considered, and discuss the dependence of on d and the
lattice coordination number. We also establish a relation connecting to the free energy of the critical Ising model for planar lattices .Comment: 28 pages, latex, 1 postscript figure, J. Phys. A, in pres
Spanning Trees on Lattices and Integration Identities
For a lattice with vertices and dimension equal or higher
than two, the number of spanning trees grows asymptotically
as in the thermodynamic limit. We present exact integral
expressions for the asymptotic growth constant for spanning trees
on several lattices. By taking different unit cells in the calculation, many
integration identities can be obtained. We also give on the
homeomorphic expansion of -regular lattices with vertices inserted on
each edge.Comment: 15 pages, 3 figures, 1 tabl
Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
We consider the problem of enumeration of planar maps and revisit its
one-matrix model solution in the light of recent combinatorial techniques
involving conjugated trees. We adapt and generalize these techniques so as to
give an alternative and purely combinatorial solution to the problem of
counting arbitrary planar maps with prescribed vertex degrees.Comment: 29 pages, 14 figures, tex, harvmac, eps
GENERATION OF FORESTS ON TERRAIN WITH DYNAMIC LIGHTING AND SHADOWING
The purpose of this research project is to exhibit an efficient method of creating dynamic lighting and shadowing for the generation of forests on terrain. In this research project, I use textures which contain images of trees from a bird’s eye view in order to create a high scale forest. Furthermore, by manipulating the transparency and color of the textures according to the algorithmic calculations of light and shadow on terrain, I provide the functionality of dynamic lighting and shadowing. Finally, by analyzing the OpenGL pipeline, I design my code in order to allow efficient rendering of the forest
- …