Searcharxiv⌕ Search

arXiv subjects

Ananias M. Mariz

Publications and source records attributed to Ananias M. Mariz.

2 recordsLinked to original sources

Long memory constitutes a unified mesoscopic mechanism consistent with nonextensive statistical mechanics

We unify two paradigmatic mesoscopic mechanisms for the emergence of nonextensive statistics, namely the multiplicative noise mechanism leading to a {\it linear} Fokker-Planck (FP) equation with {\it inhomogenous} diffusion coefficient, and the non-Markovian process leading to the {\it nonlinear} FP equation with {\it homogeneous} diffusion coefficient. More precisely, we consider the equation $\frac{\partial p(x,t)}{\partial t}=-\frac{\partial}{\partial x}[F(x) p(x,t)] + 1/2D \frac{\partial^2}{\partial x^2} [ϕ(x,p)p(x,t)]$, where $D \in {\cal R}$ and $F(x)=-\partial V(x) /\partial x$, $V(x)$ being the potential under which diffusion occurs. Our aim is to find whether $ϕ(x,p)$ exists such that the inhomogeneous linear and the homogeneous nonlinear FP equations become unified in such a way that the (ubiquitously observed) $q$-exponentials remain as stationary solutions. It turns out that such solutions indeed exist for a wide class of systems, namely when $ϕ(x,p)=[A+BV(x)]^θ[p(x,t)]^η$, where $A$, $B$, $θ$ and $η$ are (real) constants. Our main result can be sumarized as follows: For $θ\neq 1$ and arbitrary confining potential $V(x)$, $p(x,\infty) \propto \lbrace 1-β(1-q)V(x)\rbrace ^{1/(1-q)} \equiv e_q^{-βV(x)}$, where $q= 1+ η/(θ-1)$. The present approach unifies into a single mechanism, essentially {\it long memory}, results currently discussed and applied in the literature.

cond-mat.stat-mech↗

Preferential attachment growth model and nonextensive statistical mechanics

We introduce a two-dimensional growth model where every new site is located, at a distance $r$ from the barycenter of the pre-existing graph, according to the probability law $1/r^{2+α_G} (α_G \ge 0)$, and is attached to (only) one pre-existing site with a probability $\propto k_i/r^{α_A}_i (α_A \ge 0$; $k_i$ is the number of links of the $i^{th}$ site of the pre-existing graph, and $r_i$ its distance to the new site). Then we numerically determine that the probability distribution for a site to have $k$ links is asymptotically given, for all values of $α_G$, by $P(k) \propto e_q^{-k/κ}$, where $e_q^x \equiv [1+(1-q)x]^{1/(1-q)}$ is the function naturally emerging within nonextensive statistical mechanics. The entropic index is numerically given (at least for $α_A$ not too large) by $q = 1+(1/3) e^{-0.526 α_A}$, and the characteristic number of links by $κ\simeq 0.1+0.08 α_A$. The $α_A=0$ particular case belongs to the same universality class to which the Barabasi-Albert model belongs. In addition to this, we have numerically studied the rate at which the average number of links $ $ increases with the scaled time $t/i$; asymptotically, $ \propto (t/i)^β$, the exponent being close to $β={1/2}(1-α_A)$ for $0 \le α_A \le 1$, and zero otherwise. The present results reinforce the conjecture that the microscopic dynamics of nonextensive systems typically build (for instance, in Gibbs $Γ$-space for Hamiltonian systems) a scale-free network.

cond-mat.stat-mech↗