اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPhase Transitions for the Groeth Rate of Linear Stochastic Evolutions
278
0
0.0
(
0
)
تأليف
Nobuo Yoshida
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a simple discrete-time Markov chain with values in $[0,infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary contact path process and the voter model. We study the phase transition for the growth rate of the total number of particles in this framework. The main results are roughly as follows: If $d ge 3$ and the Markov chain is not too random, then, with positive probability, the growth rate of the total number of particles is of the same order as its expectation. If on the other hand, $d=1,2$, or the Markov chain is random enough, then the growth rate is slower than its expectation. We also discuss the above phase transition for the dual processes and its connection to the structure of invariant measures for the Markov chain with proper normalization.
قيم البحث
اقرأ أيضاً
We consider a discrete-time stochastic growth model on the $d$-dimensional lattice with non-negative real numbers as possible values per site. The growth model describes various interesting examples such as oriented site/bond percolation, directed po
lymers in random environment, time discretizations of the binary contact path process. We show the equivalence between the slow population growth and a localization property in terms of replica overlap. The main novelty of this paper is that we obtain this equivalence even for models with positive probability of extinction at finite time. In the course of the proof, we characterize, in a general setting, the event on which an exponential martingale vanishes in the limit.
We review a recent approach to the mean-field limits in neural networks that takes into account the stochastic nature of input current and the uncertainty in synaptic coupling. This approach was proved to be a rigorous limit of the network equations
in a general setting, and we express here the results in a more customary and simpler framework. We propose a heuristic argument to derive these equations providing a more intuitive understanding of their origin. These equations are characterized by a strong coupling between the different moments of the solutions. We analyse the equations, present an algorithm to simulate the solutions of these mean-field equations, and investigate numerically the equations. In particular, we build a bridge between these equations and Sompolinsky and collaborators approach (1988, 1990), and show how the coupling between the mean and the covariance function deviates from customary approaches.
Products of $M$ i.i.d. non-Hermitian random matrices of size $N times N$ relate Gaussian fluctuation of Lyapunov and stability exponents in dynamical systems (finite $N$ and large $M$) to local eigenvalue universality in random matrix theory (finite
$M$ and large $N$). The remaining task is to study local eigenvalue statistics as $M$ and $N$ tend to infinity simultaneously, which lies at the heart of understanding two kinds of universal patterns. For products of i.i.d. complex Ginibre matrices, truncated unitary matrices and spherical ensembles, as $M+Nto infty$ we prove that local statistics undergoes a transition when the relative ratio $M/N$ changes from $0$ to $infty$: Ginibre statistics when $M/N to 0$, normality when $M/Nto infty$, and new critical phenomena when $M/Nto gamma in (0, infty)$.
We study the averaged products of characteristic polynomials for the Gaussian and Laguerre $beta$-ensembles with external source, and prove Pearcey-type phase transitions for particular full rank perturbations of source. The phases are characterised
by determining the explicit functional forms of the scaled limits of the averaged products of characteristic polynomials, which are given as certain multidimensional integrals, with dimension equal to the number of products.
Under the Kolmogorov--Smirnov metric, an upper bound on the rate of convergence to the Gaussian distribution is obtained for linear statistics of the matrix ensembles in the case of the Gaussian, Laguerre, and Jacobi weights. The main lemma gives an
estimate for the characteristic functions of the linear statistics; this estimate is uniform over the growing interval. The proof of the lemma relies on the Riemann--Hilbert approach.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
