Related papers: Dynamics of hot random hyperbolic graphs
We show that the asymmetric inter-particle interactions can induce rapid decay of the heat current correlation in one-dimensional momentum conserving lattices. When the asymmetry degree is appropriate, even exponential decay may arise. This…
The thermal degradation of a graphene-like two-dimensional triangular membrane with bonds undergoing temperature-induced scission is studied by means of Molecular Dynamics simulation using Langevin thermostat. We demonstrate that the…
The contact process is a non-equilibrium Hamiltonian model that, even in one dimension, lacks an exact solution and has been extensively studied via Monte Carlo simulations, both in steady-state and time-dependent scenarios. Although the…
In this work, we study a family of random geometric graphs on hyperbolic spaces. In this setting, N points are chosen randomly on a hyperbolic space and any two of them are joined by an edge with probability that depends on their hyperbolic…
Power law cumulative frequency $(P)$ vs. event size $(l)$ distributions $P(\geq l)\sim l^{-\alpha}$ are frequently cited as evidence for complexity and serve as a starting point for linking theoretical models and mechanisms with observed…
The hydrodynamic part of the velocity autocorrelation function of a granular fluid in the homogeneous cooling state has been calculated by using mode-coupling theory for a finite system with periodic boundary conditions. The existence of…
Consider an interacting particle system indexed by the vertices of a (possibly random) locally finite graph whose vertices and edges are equipped with marks representing parameters of the model such as the environment and initial…
We introduce a novel approach linking fractal geometry to partially hyperbolic dynamics, revealing several new phenomena related to regularity jumps and rigidity. One key result demonstrates a sharp phase transition for partially hyperbolic…
We study numerically the paramagnetic phase of the spin-1/2 random transverse-field Ising chain, using a mapping to non-interacting fermions. We extend our earlier work, Phys. Rev. 53, 8486 (1996), to finite temperatures and to dynamical…
The type-I intermittency route to (or out of) chaos is investigated within the Horizontal Visibility graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and…
We find the exact critical temperature $T_c$ of the nearest-neighbor ferromagnetic Ising model on an `equilibrium' random graph with an arbitrary degree distribution $P(k)$. We observe an anomalous behavior of the magnetization, magnetic…
We introduce a minimalistic model based on dynamic node deletion and node duplication with heterodimerisation. The model is intended to capture the essential features of the evolution of protein interaction networks. We derive an exact…
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks…
A new model, called "Human Dynamics", has been recently proposed that individuals execute activities based on a perceived priority of tasks, which can be characterized by a power-law distribution of waiting time between consecutive tasks…
We give an upper bound for the uniqueness transition on an arbitrary locally finite graph ${\cal G}$ in terms of the limit of the spectral radii $\rho\left[ H({\cal G}_t)\right]$ of the non-backtracking (Hashimoto) matrices for an…
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that…
Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…
Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…
Hyperbolic random graphs inherit many properties that are present in real-world networks. The hyperbolic geometry imposes a scale-free network with a strong clustering coefficient. Other properties like a giant component, the small world…
The total energy E(t) in a fluid of inelastic particles is dissipated through inelastic collisions. When such systems are prepared in a homogeneous initial state and evolve undriven, E(t) decays initially as t^{-2} \aprox exp[ - 2\epsilon…