Long Paths in Random Apollonian Networks
نویسندگان
چکیده
We consider the length L(n) of the longest path in a randomly generated Apollonian Network (ApN) An. We show that w.h.p. L(n) ≤ ne− log c n for any constant c < 2/3.
منابع مشابه
The Degree Sequence of Random Apollonian Networks
We analyze the asymptotic behavior of the degree sequence of Random Apollonian Networks [11]. For previous weaker results see [10, 11].
متن کاملParallel Random Apollonian Networks
We present and study in this paper a simple algorithm that produces so called growing Parallel Random Apollonian Networks (P-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scalefree characteristics. To characterize further the structure of P-RAN, we introduce new parameters that we refer to as the parallel degree and the parallel coefficien...
متن کاملWheel Random Apollonian Graphs
In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic graph properties like vertices and edges cardinality, some question concerning cycles and the chromaticity in such type of graphs, we suggest further work on t...
متن کاملRamified Random Apollonian Networks
We present a simple algorithm that produces a so called growing Ramified Random Apollonian Networks (R-RAN) in any dimension d. Analytical derivations show that these networks still exhibit small-word and scale-free characteristics. To characterize further the structure of R-RAN, we introduce new parameters that we refer to as the parallel degree and the ramification coefficient, that determine...
متن کاملOn Certain Properties of Random Apollonian Networks
In this work we analyze fundamental properties of Random Apollonian Networks [34,35], a popular random graph model which generates planar graphs with power law properties. Specifically, we analyze (a) the degree distribution, (b) the k largest degrees, (c) the k largest eigenvalues and (d) the diameter, where k is a constant.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Internet Mathematics
دوره 11 شماره
صفحات -
تاریخ انتشار 2015