Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
نویسندگان
چکیده
منابع مشابه
Horizontal visibility graphs: exact results for random time series.
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows us to apply methods of complex network theory for characterizing time series. In this work we present the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series (se...
متن کاملDetecting Series Periodicity with Horizontal Visibility Graphs
The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore...
متن کاملDegree Distributions in General Random Intersection Graphs
Random intersection graphs, denoted by G(n,m, p), are introduced in [9, 14] as opposed to classical Erdős-Rényi random graphs. Let us consider a set V with n vertices and another universal set W with m elements. Define a bipartite graph B(n,m, p) with independent vertex sets V and W . Edges between v ∈ V and w ∈ W exist independently with probability p. The random intersection graph G(n,m, p) d...
متن کاملDirected Random Graphs with Given Degree Distributions
Abstract: Given two distributions F and G on the nonnegative integers we propose an algorithm to construct inand out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that is, from which a simple directed graph can be drawn. We then analyze a directed version of the configuration model and show that, provided that F an...
متن کاملPartitioning Random Graphs with General Degree Distributions
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) from a random graph. During the last 30 years many algorithms for this problem have been developed that work provably well on models resembling the Erdős-Rényi model Gn,m. Since in these random graph models edges are distributed very uniformly, the recent theory of large networks provides convinci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2017
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/119/48008