English
Related papers

Related papers: Horizontal Visibility graphs generated by type-II …

200 papers

In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…

Combinatorics · Mathematics 2019-04-16 Gi-Sang Cheon , Ji-Hwan Jung , Sergey Kitaev , Seyed Ahmad Mojallal

In this paper we develop a novel Topological Data Analysis (TDA) approach for studying graph representations of time series of dynamical systems. Specifically, we show how persistent homology, a tool from TDA, can be used to yield a…

Chaotic Dynamics · Physics 2020-01-28 Audun Myers , Elizabeth Munch , Firas A. Khasawneh

We determine the limit distributions of sums of deterministic chaotic variables in unimodal maps assisted by a novel renormalization group (RG) framework associated to the operation of increment of summands and rescaling. In this framework…

Statistical Mechanics · Physics 2015-05-14 Miguel A. Fuentes , A. Robledo

We introduce a ``spatial'' Lyapunov exponent to characterize the complex behavior of non chaotic but convectively unstable flow systems. This complexity is of spatial type and is due to sensitivity to the boundary conditions. We show that…

chao-dyn · Physics 2009-10-31 M. Falcioni , D. Vergni , A. Vulpiani

Here we present a network theory-based approach to investigate the Mack-mode instability signature found in high-speed schlieren data from a Mach 6 laminar boundary layer flow over a $7^\circ$ cone. The data contain instability wave packets…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

General Topology · Mathematics 2011-10-28 Agelos Georgakopoulos

A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…

Probability · Mathematics 2025-02-24 Anna Brandenberger , Serte Donderwinkel , Céline Kerriou , Gábor Lugosi , Rivka Mitchell

The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they…

Physics and Society · Physics 2016-12-28 Christoph Norrenbrock , Oliver Melchert , Alexander K. Hartmann

We explore the chaotic dynamics of Rayleigh-B\'enard convection using large-scale, parallel numerical simulations for experimentally accessible conditions. We quantify the connections between the spatiotemporal dynamics of the leading-order…

Fluid Dynamics · Physics 2018-10-23 Rachel Levanger , Mu Xu , Jacek Cyranka , Michael Schatz , Konstantin Mischaikow , Mark Paul

A simple quasiperiodically forced one-dimensional cubic map is shown to exhibit very many types of routes to chaos via strange nonchaotic attractors (SNAs) with reference to a two-parameter $(A-f)$ space. The routes include transitions to…

Chaotic Dynamics · Physics 2009-10-31 A. Venkatesan , M. Lakshmanan

It is possible to investigate emergence in many real systems using time-ordered data. However, classical time series analysis is usually conditioned by data accuracy and quantity. A modern method is to map time series onto graphs and study…

Biological Physics · Physics 2023-11-22 Juliane T. Moraes , Silvio C. Ferreira

We give a hierarchy of many-parameter families of maps of the interval [0,1] with an invariant measure and using the measure, we calculate Kolmogorov--Sinai entropy of these maps analytically. In contrary to the usual one-dimensional maps…

Chaotic Dynamics · Physics 2015-06-26 M. A. Jafarizadeh , S. Behnia

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

Mathematical Physics · Physics 2015-04-02 Monika Kotorowicz , Yuri Kozitsky

We present a systematic study of the regularity phenomena for NIP hypergraphs and connections to the theory of (locally) generically stable measures, providing a model-theoretic hypergraph version of the results from [L. Lov\'asz, B.…

Logic · Mathematics 2021-03-11 Artem Chernikov , Sergei Starchenko

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Combinatorics · Mathematics 2007-07-18 Matthew Baker , Serguei Norine

The limited penetrable horizontal visibility algorithm is a new time analysis tool and is a further development of the horizontal visibility algorithm. We present some exact results on the topological properties of the limited penetrable…

Hyperchaos is distinguished from chaos by the presence of at least two positive Lyapunov exponents instead of just one in dynamical systems. A general scenario is presented here that shows emergence of hyperchaos with a sudden large…

Adaptation and Self-Organizing Systems · Physics 2022-09-13 S. Leo Kingston , Tomasz Kapitaniak , Syamal K. Dana

We study the low-energy physics of the critical (2+1)-dimensional random transverse-field Ising model. The one-dimensional version of the model is a paradigmatic example of a system governed by an infinite-randomness fixed point, for which…

Statistical Mechanics · Physics 2023-11-21 Akshat Pandey , Aditya Mahadevan , Aditya Cowsik

We present the results of a search of log-periodic corrections to scaling in the moments of the energy dissipation rate in experiments at high Reynolds number (2500) of three-dimensional fully developed turbulence. A simple dynamical…

Statistical Mechanics · Physics 2009-11-07 Wei-Xing Zhou , Didier Sornette

Time evolution of diluted neural networks with a nonmonotonic transfer function is analitically described by flow equations for macroscopic variables. The macroscopic dynamics shows a rich variety of behaviours: fixed-point, periodicity and…

Disordered Systems and Neural Networks · Physics 2009-10-31 D. Caroppo , M. Mannarelli , G. Nardulli , S. Stramaglia
‹ Prev 1 4 5 6 7 8 10 Next ›