MJMilton Jara

Milton Jara

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Milton Jara has a total of 45 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Delayed Logistic Equation as a Limit of Long Memory Markov Chains

    by Eldon Barros, Dirk Erhard, Tertuliano Franco, Milton Jara

    We introduce and analyze a long memory continuous-time Markov chain on $${\mathbb R}_+$$ R + whose jump mechanism depends explicitly on a state in the past. From the present state $$x_0$$ x 0 , the process jumps to $$x_0(1+\frac{1}{N})$$ x 0 ( 1 + 1 N ) or to $$x_0(1-\frac{x_{-\lfloor \tau N\rfloor }}{N^2})$$ x 0 ( 1 - x - ⌊ τ N ⌋ N 2 ) , each at rate 1/2, where $$x_{-\lfloor \tau N\rfloor }$$ x - ⌊ τ N ⌋ denotes the state located $$\lfloor \tau N\rfloor $$ ⌊ τ N ⌋ jumps backward in time. Here the delay $$\tau >0$$ τ > 0 is fixed and N is the scaling parameter. The initial condition is prescribed by a vector of length $$\lfloor \tau N\rfloor +1$$ ⌊ τ N ⌋ + 1 , all of whose entries are equal to $$\mu N$$ μ N . Using a genuine space-time replacement lemma, we prove that, as $$N\rightarrow \infty $$ N → ∞ , the rescaled process converges to a deterministic limit governed by the Delayed Logistic Equation (also known as the Hutchinson equation ) with delay $$\tau $$ τ and initial condition $$\rho (t)\equiv \mu $$ ρ ( t ) ≡ μ for $$t\in [-\tau ,0]$$ t ∈ [ - τ , 0 ] .

  • Open Access

    Relaxation time for a parametric family of zero-range processes

    by F. Hernández-Romero, M. Jara, F. Valentim

    Based on well-known heuristic arguments that provide an upper bound for the relaxation time of zero-range processes and trying to establish a connection between the results obtained in Landim et al. (Ann Probab 24(4), 1996), Morris (Ann Probab 34(5):1645–1664, 2006) and Nagahata (Stoch Process Appl 120(6):949–958, 2010) we proposed to study the zero-range process associated with the following family of rate functions: $$\begin{aligned} g_{\alpha }(k) = {\left\{ \begin{array}{ll} \frac{(k+1)^{1-\alpha }-1}{1-\alpha } & \text {if}\ \alpha \in [0,1) \cup (1,\infty ) \\ \ln (k+1) & \text {if}\ \alpha =1. \end{array}\right. } \end{aligned}$$ g α ( k ) = ( k + 1 ) 1 - α - 1 1 - α if α ∈ [ 0 , 1 ) ∪ ( 1 , ∞ ) ln ( k + 1 ) if α = 1 . We state a conjecture about the order of the relaxation time for those processes and provide numerical evidence throughout deterministic iterative methods and Monte-Carlo simulations.

  • Open Access

    Simulating Simple Random Walks With a Deck of Cards

    by Raphael Alves, Sabrina Estácio, Susana Frómeta, Milton Jara, Rodrigo Marinho, Luiz F. S. Marques, João V. A. Pimenta

    When we want to simulate the realization of a symmetric simple random walk on $\mathbb Z^d$, we use $(2d)$-side fair dice to decide to which neighbor it jumps at each step if $d\geq 2$ or we simply use a fair coin when $d=1$. Assume that instead of using a dice or a coin we want to do a simulation using a well shuffled deck with $K$ cards of each of the $2d$ suits. In the first step the probability of jumping to each neighbor is $(2d)^{-1}$, but from the second step it becomes biased. Of course if we continue performing this simulation, the total variation distance between its law and the law of the random walk will increase until all cards are used. In this paper we investigate the minimum number of cards $N=2d K$ that a deck must contain so that the total variation distance between the law of a $n$-step simulation and the law of a $n$-step realization of the random walk is smaller than a chosen threshold $\varepsilon \in (0,1)$. More generally, we prove that when $N=cn$ this distance converges, as $n \to \infty$, to a Gaussian profile which depends on $c\geq 2d$. Furthermore, our analysis shows that this Gaussian profile vanishes as $c \to \infty$, proving the convergence of a multivariate hypergeometric distribution to a multinomial distribution in total variation.

  • Open Access

    Thermalization And Convergence To Equilibrium Of The Noisy Voter Model

    by Enzo Aljovin, Milton Jara, Yangrui Xiang

    We investigate the convergence towards equilibrium of the noisy voter model, evolving in the complete graph with n vertices. The noisy voter model is a version of the voter model, on which individuals change their opinions randomly due to external noise. Specifically, we determine the profile of convergence, in Kantorovich distance (also known as 1-Wasserstein distance), which corresponds to the Kantorovich distance between the marginals of a Wright-Fisher diffusion and its stationary measure. In particular, we demonstrate that the model does not exhibit cut-off under natural noise intensity conditions. In addition, we study the time the model needs to forget the initial location of particles, which we interpret as the Kantorovich distance between the laws of the model with particles in fixed initial positions and in positions chosen uniformly at random. We call this process thermalization and we show that thermalization does exhibit a cut-off profile. Our approach relies on Stein's method and analytical tools from PDE theory, which may be of independent interest for the quantitative study of observables of Markov chains.

  • Open Access

    CLT for NESS of a reaction-diffusion model

    by P. Gonçalves, M. Jara, R. Marinho, O. Menezes

    We study the scaling properties of the non-equilibrium stationary states (NESS) of a reaction-diffusion model. Under a suitable smallness condition, we show that the density of particles satisfies a law of large numbers with respect to the NESS, with an explicit rate of convergence, and we also show that at mesoscopic scales the NESS is well approximated by a local equilibrium (product) measure, in the total variation distance. In addition, in dimensions $$d \le 3$$ d ≤ 3 we show a central limit theorem for the density of particles under the NESS. The corresponding Gaussian limit can be represented as an independent sum of a white noise and a massive Gaussian free field, and in particular it presents macroscopic correlations.


  • Open Access

    Gradual convergence for Langevin dynamics on a degenerate potential

    by Gerardo Barrera, Conrado da Costa, Milton Jara

    In this paper, we study an ordinary differential equation with a degenerate global attractor at the origin, to which we add a white noise with a small parameter that regulates its intensity. Under general conditions, for any fixed intensity, as time tends to infinity, the solution of this stochastic dynamics converges exponentially fast in total variation distance to a unique equilibrium distribution. We suitably accelerate the random dynamics and show that the preceding convergence is gradual, that is, the total variation distance of the accelerated random dynamics and its equilibrium distribution converges to a decreasing function, which corresponds to the total variation distance between the marginal of a stochastic differential equation that comes down from infinity and its corresponding equilibrium distribution. This completes the classification of all possible behaviors of the total variation distance between the time marginal of the aforementioned stochastic dynamics and its invariant measure for one dimensional smooth convex potentials. In addition, there is no cut-off phenomenon for this one-parameter family of random processes and asymptotics of the mixing times are derived.

  • Open Access

    Fractional Edgeworth expansions for one-dimensional heavy-tailed random variables and applications

    by Leandro Chiarini, Milton Jara, Wioletta M. Ruszel

    In this article, we study a class of lattice random variables in the domain of attraction of an $\alpha$-stable random variable with index $\alpha \in (0,2)$ which satisfy a truncated fractional Edgeworth expansion. Our results include studying the class of such fractional Edgeworth expansions under simple operations, providing concrete examples; sharp rates of convergence to an $\alpha$-stable distribution in a local central limit theorem; Green's function expansions; and finally fluctuations of a class of discrete stochastic PDE's driven by the heavy-tailed random walks belonging to the class of fractional Edgeworth expansions.

  • Open Access

    CLT for NESS of a reaction-diffusion model

    by P. Gonçalves, M. Jara, R. Marinho, O. Menezes

    We study the scaling properties of the non-equilibrium stationary states (NESS) of a reaction-diffusion model. Under a suitable smallness condition, we show that the density of particles satisfies a law of large numbers with respect to the NESS, with an explicit rate of convergence, and we also show that at mesoscopic scales the NESS is well approximated by a local equilibrium (product) measure, in the total variation distance. In addition, in dimensions $d \leq3$ we show a central limit theorem (CLT) for the density of particles under the NESS. The corresponding Gaussian limit can be represented as an independent sum of a white noise and a massive Gaussian free field, and in particular it presents macroscopic correlations.

  • Open Access

    Equilibrium fluctuations for diffusive symmetric exclusion with long jumps and infinitely extended reservoirs

    by Cedric Bernardin, Patricia Goncalves, Milton Jara, Stefano Scotta

    We provide a complete description of the equilibrium fluctuations for diffusive symmetric exclusion processes with long jumps in contact with infinitely extended reservoirs and prove that they behave as generalized Ornstein-Uhlenbeck processes with various boundary conditions, depending mainly on the strength of the reservoirs. On the way, we also give a general statement about uniqueness of the Ornstein-Uhlenbeck process originated by the microscopic dynamics of the underlying interacting particle systems and adapt it to our study.

  • Open Access

    Constructing fractional Gaussian fields from long-range divisible sandpiles on the torus

    by Leandro Chiarini, Milton Jara, Wioletta Ruszel

    In \cite{Cipriani2016}, the authors proved that, with the appropriate rescaling, the odometer of the (nearest neighbours) divisible sandpile on the unit torus converges to a bi-Laplacian field. Here, we study $\alpha$-long-range divisible sandpiles, similar to those introduced in \cite{Frometa2018}. We show that, for $\alpha \in (0,2)$, the limiting field is a fractional Gaussian field on the torus with parameter $\alpha/2$. However, for $\alpha \in [2,\infty)$, we recover the bi-Laplacian field. This provides an alternative construction of fractional Gaussian fields such as the Gaussian Free Field or membrane model using a diffusion based on the generator of L\'evy walks. The central tool for obtaining our results is a careful study of the spectrum of the fractional Laplacian on the discrete torus. More specifically, we need the rate of divergence of the eigenvalues as we let the side length of the discrete torus go to infinity. As a side result, we obtain precise asymptotics for the eigenvalues of discrete fractional Laplacians. Furthermore, we determine the order of the expected maximum of the discrete fractional Gaussian field with parameter $\gamma=\min \{\alpha,2\}$ and $\alpha \in \mathbb{R}_+\backslash\{2\}$ on a finite grid.