اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFinite size induces crossover temperature in growing spin chains
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a growing one-dimensional quenched spin model that bases on asymmetrical one-side Ising interactions in the presence of external field. Numerical simulations and analytical calculations based on Markov chain theory show that when the external field is smaller than the exchange coupling constant $J$ there is a non-monotonous dependence of the mean magnetization on the temperature in a finite system. The crossover temperature $T_c$ corresponding to the maximal magnetization decays with system size, approximately as the inverse of the W Lambert function. The observed phenomenon can be understood as an interplay between the thermal fluctuations and the presence of the first cluster determined by initial conditions. The effect exists also when spins are not quenched but fully thermalized after the attachment to the chain. We conceive the model is suitable for a qualitative description of online emotional discussions arranged in a chronological order, where a spin in every node conveys emotional valence of a subsequent post.
قيم البحث
اقرأ أيضاً
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree distribution
. We use two different approaches: the deterministic mean-field approximation used by Barabasi and Albert (but taking into account the nodes of the starting network), and the probability distribution of the degree of each node, which considers the stochastic process. Numerical simulations show that the accuracy of the predictions of the mean-field approximation depend on the contribution of the dispersion in the final distribution. The results in terms of the probability distribution of the degree of each node are very accurate when compared to numerical simulations. The analysis of the standard deviation of the degree distribution allows us to assess the influence of the starting core when fitting the model to real data.
In some systems, the connecting probability (and thus the percolation process) between two sites depends on the geometric distance between them. To understand such process, we propose gravitationally correlated percolation models for link-adding netw
orks on the two-dimensional lattice $G$ with two strategies $S_{rm max}$ and $S_{rm min}$, to add a link $l_{i,j}$ to connect site $i$ and site $j$ with mass $m_i$ and $m_j$, respectively; $m_i$ and $m_j$ are sizes of the clusters which contain site $i$ and site $j$, respectively. The probability to add the link $l_{i,j}$ is related to the generalized gravity $g_{ij} equiv m_i m_j/r_{ij}^d$, where $r_{ij}$ is the geometric distance between $i$ and $j$, and $d$ is an adjustable decaying exponent. In the beginning of the simulation, all sites of $G$ are occupied and there is no link. In the simulation process, two inter-cluster links $l_{i,j}$ and $l_{k,n}$ are randomly chosen and the generalized gravities $g_{ij}$ and $g_{kn}$ are computed. In the strategy $S_{rm max}$, the link with larger generalized gravity is added. In the strategy $S_{rm min}$, the link with smaller generalized gravity is added, which include percolation on the ErdH os-Renyi random graph and the Achlioptas process of explosive percolation as the limiting cases, $d to infty$ and $d to 0$, respectively. Adjustable strategies facilitate or inhibit the network percolation in a generic view. We calculate percolation thresholds $T_c$ and critical exponents $beta$ by numerical simulations. We also obtain various finite-size scaling functions for the node fractions in percolating clusters or arrival of saturation length with different intervening strategies.
Popularity is attractive -- this is the formula underlying preferential attachment, a popular explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribut
ion of the number of connections that nodes have follows power laws observed in many real networks. Preferential attachment has been directly validated for some real networks, including the Internet. Preferential attachment can also be a consequence of different underlying processes based on node fitness, ranking, optimization, random walks, or duplication. Here we show that popularity is just one dimension of attractiveness. Another dimension is similarity. We develop a framework where new connections, instead of preferring popular nodes, optimize certain trade-offs between popularity and similarity. The framework admits a geometric interpretation, in which popularity preference emerges from local optimization. As opposed to preferential attachment, the optimization framework accurately describes large-scale evolution of technological (Internet), social (web of trust), and biological (E.coli metabolic) networks, predicting the probability of new links in them with a remarkable precision. The developed framework can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon.
We present a detailed analysis of the self-organization phenomenon in which the stylized facts originate from finite size effects with respect to the number of agents considered and disappear in the limit of an infinite population. By introducing the
possibility that agents can enter or leave the market depending on the behavior of the price, it is possible to show that the system self-organizes in a regime with a finite number of agents which corresponds to the stylized facts. The mechanism to enter or leave the market is based on the idea that a too stable market is unappealing for traders while the presence of price movements attracts agents to enter and speculate on the market. We show that this mechanism is also compatible with the idea that agents are scared by a noisy and risky market at shorter time scales. We also show that the mechanism for self-organization is robust with respect to variations of the exit/entry rules and that the attempt to trigger the system to self-organize in a region without stylized facts leads to an unrealistic dynamics. We study the self-organization in a specific agent based model but we believe that the basic ideas should be of general validity.
We study the Krapivsky-Redner (KR) network growth model but where new nodes can connect to any number of existing nodes, $m$, picked from a power-law distribution $p(m)sim m^{-alpha}$. Each of the $m$ new connections is still carried out as in the KR
model with probability redirection $r$ (corresponding to degree exponent $gamma_{rm KR}=1+1/r$, in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and total-degree distributions and on the potential tension between the degree exponent $alpha$, characterizing new connections (outgoing links), and the degree exponent $gamma_{rm KR}(r)$ dictated by the redirection mechanism.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
