1,741 research outputs found

    Dynamics of a tagged particle in the asymmetric exclusion process with the step initial condition

    Full text link
    The one-dimensional totally asymmetric simple exclusion process (TASEP) is considered. We study the time evolution property of a tagged particle in TASEP with the step-type initial condition. Calculated is the multi-time joint distribution function of its position. Using the relation of the dynamics of TASEP to the Schur process, we show that the function is represented as the Fredholm determinant. We also study the scaling limit. The universality of the largest eigenvalue in the random matrix theory is realized in the limit. When the hopping rates of all particles are the same, it is found that the joint distribution function converges to that of the Airy process after the time at which the particle begins to move. On the other hand, when there are several particles with small hopping rate in front of a tagged particle, the limiting process changes at a certain time from the Airy process to the process of the largest eigenvalue in the Hermitian multi-matrix model with external sources.Comment: 48 pages, 8 figure

    Random walks and random fixed-point free involutions

    Full text link
    A bijection is given between fixed point free involutions of {1,2,...,2N}\{1,2,...,2N\} with maximum decreasing subsequence size 2p2p and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points l1l \ge 1. In one class of walker configurations the maximum displacement of the right most walker is pp. Because the scaled distribution of the maximum decreasing subsequence size is known to be in the soft edge GOE (random real symmetric matrices) universality class, the same holds true for the scaled distribution of the maximum displacement of the right most walker.Comment: 10 page

    Spectra of random Hermitian matrices with a small-rank external source: supercritical and subcritical regimes

    Get PDF
    Random Hermitian matrices with a source term arise, for instance, in the study of non-intersecting Brownian walkers \cite{Adler:2009a, Daems:2007} and sample covariance matrices \cite{Baik:2005}. We consider the case when the n×nn\times n external source matrix has two distinct real eigenvalues: aa with multiplicity rr and zero with multiplicity nrn-r. The source is small in the sense that rr is finite or r=O(nγ)r=\mathcal O(n^\gamma), for 0<γ<10< \gamma<1. For a Gaussian potential, P\'ech\'e \cite{Peche:2006} showed that for a|a| sufficiently small (the subcritical regime) the external source has no leading-order effect on the eigenvalues, while for a|a| sufficiently large (the supercritical regime) rr eigenvalues exit the bulk of the spectrum and behave as the eigenvalues of r×rr\times r Gaussian unitary ensemble (GUE). We establish the universality of these results for a general class of analytic potentials in the supercritical and subcritical regimes.Comment: 41 pages, 4 figure

    Intelligent Embedded Vision for Summarization of Multi-View Videos in IIoT

    Get PDF
    Nowadays, video sensors are used on a large scale for various applications including security monitoring and smart transportation. However, the limited communication bandwidth and storage constraints make it challenging to process such heterogeneous nature of Big Data in real time. Multi-view video summarization (MVS) enables us to suppress redundant data in distributed video sensors settings. The existing MVS approaches process video data in offline manner by transmitting it to the local or cloud server for analysis, which requires extra streaming to conduct summarization, huge bandwidth, and are not applicable for integration with industrial internet of things (IIoT). This paper presents a light-weight CNN and IIoT based computationally intelligent (CI) MVS framework. Our method uses an IIoT network containing smart devices, Raspberry Pi (clients and master) with embedded cameras to capture multi-view video (MVV) data. Each client Raspberry Pi (RPi) detects target in frames via light-weight CNN model, analyzes these targets for traffic and crowd density, and searches for suspicious objects to generate alert in the IIoT network. The frames of each client RPi are encoded and transmitted with approximately 17.02% smaller size of each frame to master RPi for final MVS. Empirical analysis shows that our proposed framework can be used in industrial environments for various applications such as security and smart transportation and can be proved beneficial for saving resources

    Nonintersecting Brownian motions on the half-line and discrete Gaussian orthogonal polynomials

    Full text link
    We study the distribution of the maximal height of the outermost path in the model of NN nonintersecting Brownian motions on the half-line as NN\to \infty, showing that it converges in the proper scaling to the Tracy-Widom distribution for the largest eigenvalue of the Gaussian orthogonal ensemble. This is as expected from the viewpoint that the maximal height of the outermost path converges to the maximum of the Airy2\textrm{Airy}_2 process minus a parabola. Our proof is based on Riemann-Hilbert analysis of a system of discrete orthogonal polynomials with a Gaussian weight in the double scaling limit as this system approaches saturation. We consequently compute the asymptotics of the free energy and the reproducing kernel of the corresponding discrete orthogonal polynomial ensemble in the critical scaling in which the density of particles approaches saturation. Both of these results can be viewed as dual to the case in which the mean density of eigenvalues in a random matrix model is vanishing at one point.Comment: 39 pages, 4 figures; The title has been changed from "The limiting distribution of the maximal height of nonintersecting Brownian excursions and discrete Gaussian orthogonal polynomials." This is a reflection of the fact that the analysis has been adapted to include nonintersecting Brownian motions with either reflecting of absorbing boundaries at zero. To appear in J. Stat. Phy

    Expected length of the longest common subsequence for large alphabets

    Full text link
    We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that the expected value of L, when normalized by n, converges to a constant C_k. We prove a conjecture of Sankoff and Mainville from the early 80's claiming that C_k\sqrt{k} goes to 2 as k goes to infinity.Comment: 14 pages, 1 figure, LaTe

    Vicious Walkers and Hook Young Tableaux

    Full text link
    We consider a generalization of the vicious walker model. Using a bijection map between the path configuration of the non-intersecting random walkers and the hook Young diagram, we compute the probability concerning the number of walker's movements. Applying the saddle point method, we reveal that the scaling limit gives the Tracy--Widom distribution, which is same with the limit distribution of the largest eigenvalues of the Gaussian unitary ensemble.Comment: 23 pages, 5 figure
    corecore