Results 1  10
of
68
GRAPHONS, CUT NORM AND DISTANCE, COUPLINGS AND REARRANGEMENTS
, 2010
"... We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements. We allow graphons on general probability spaces whenever possible. We ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements. We allow graphons on general probability spaces whenever possible. We
Graph properties, graph limits and entropy
 http://arxiv.org/1312.5626 24 SVANTE JANSON
, 2013
"... Abstract. We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by wellknown results describes the rate of grow ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
of growth. We study also random graphs and their entropies. We show, for example, that if a hereditary property has a unique limiting graphon with maximal entropy, then a random graph with this property, selected uniformly at random from all such graphs with a given order, converges to this maximizing
Oil THE EllTHALFY AND ENTROPY OF SOIL HATER
, 1962
"... This Dissertation is brought to you for free and open access by the ..."
GRAPH LIMITS AND HEREDITARY PROPERTIES
"... Abstract. We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes of intersection graphs (interval graphs, unit interval graphs, threshold graphs, chordal graphs). 1. ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes of intersection graphs (interval graphs, unit interval graphs, threshold graphs, chordal graphs). 1.
On the typical structure of graphs in a monotone property
"... Abstract. Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a monoto ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a
Phonons in carbon nanotubes
, 2000
"... A broad review of the unusual onedimensional properties of phonons in carbon nanotubes is presented, including phonons in isolated nanotubes and in crystalline arrays of nanotubes in nanotube bundles. The main technique for probing the phonon spectra has been Raman spectroscopy and the many unique ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
A broad review of the unusual onedimensional properties of phonons in carbon nanotubes is presented, including phonons in isolated nanotubes and in crystalline arrays of nanotubes in nanotube bundles. The main technique for probing the phonon spectra has been Raman spectroscopy and the many unique
A UNIFIED APPROACH TO STRUCTURAL LIMITS  AND LIMITS OF GRAPHS WITH BOUNDED TREEDEPTH
, 2013
"... In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various approaches to graph limits fit to this framework and that they natu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
and that they naturally appear as “tractable cases ” of a general theory. As an outcome of this, we provide extensions of known results. We believe that this put these into next context and perspective. For example, we prove that the sparse–dense dichotomy exactly corresponds to random free graphons. The second part
Sparse graphs: metrics and random models
"... Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0,1] 2 to the nonnegative reals, although the d ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Recently, Bollobás, Janson and Riordan introduced a very general family of random graph models, producing inhomogeneous random graphs with Θ(n) edges. Roughly speaking, there is one model for each kernel, i.e., each symmetric measurable function from [0,1] 2 to the nonnegative reals, although
A Taxonomy Of Computer Attacks With Applications To Wireless Networks
, 2001
"... The majority of attacks made upon modern computers have been successful due to the exploitation of the same errors and weaknesses that have plagued computer systems for the last thirty years. Because the industry has not learned from these mistakes, new protocols and systems are not designed with th ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
The majority of attacks made upon modern computers have been successful due to the exploitation of the same errors and weaknesses that have plagued computer systems for the last thirty years. Because the industry has not learned from these mistakes, new protocols and systems are not designed with the aspect of security in mind; and security that is present is typically added as an afterthought. What makes these systems so vulnerable is that the security design process is based upon assumptions that have been made in the past; assumptions which now have become obsolete or irrelevant. In addition, fundamental errors in the design and implementation of systems repeatedly occur, which lead to failures. This
Results 1  10
of
68