Inés Armendáriz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Inés Armendáriz has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Michail Loulakis
School of Applied Mathematical and Physical Sciences National Technical University of Athens 15780 Athens Greece
7 shared publications - Pablo Augusto Ferrari
Universidad de Buenos Aires and IMAS-UBA-CONICET 1 , Buenos Aires
7 shared publications - Stefan Grosskinsky
University of Warwick The Alan Turing Institute
4 shared publications - Florencia Leonardi
Institute of Mathematics and Statistics, University of São Paulo (USP), São Paulo 05508-090, SP, Brazil
2 shared publications Inés
2 shared publications- Milton Jara
Instituto de Matemática Pura e Aplicada IMPA. Estrada Dona Castorina 110 22460-320 Rio de Janeiro Rio de Janeiro Brasil
2 shared publications
Latest Publications
- Open Access
Fluid limit for the coarsening phase of the condensing zero-range process
We prove a fluid limit for the coarsening phase of the condensing zero-range process on a finite number of sites. When time and occupation per site are linearly rescaled by the total number of particles, the evolution of the process is described by a piecewise linear trajectory in the simplex indexed by the sites. The linear coefficients are determined by the trace process of the underlying random walk on the subset of non-empty sites, and the trajectory reaches an absorbing configuration in finite time. A boundary of the simplex is called absorbing for the fluid limit if a trajectory started at a configuration in the boundary remains in it for all times. We identify the set of absorbing configurations and characterize the absorbing boundaries.
Open AccessFluid limit for the coarsening phase of the condensing zero-range process
We prove a fluid limit for the coarsening phase of the condensing zero-range process on a finite number of sites. When time and occupation per site are linearly rescaled by the total number of particles, the evolution of the process is described by a piecewise linear trajectory in the simplex indexed by the sites. The linear coefficients are determined by the trace process of the underlying random walk on the subset of non-empty sites, and the trajectory reaches an absorbing configuration in finite time. A boundary of the simplex is called absorbing for the fluid limit if a trajectory started at a configuration in the boundary remains in it for all times. We identify the set of absorbing configurations and characterize the absorbing boundaries.
- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (2) , 1119-1132
Group Testing With Nested Pools
In order to identify the infected individuals of a population, their samples are divided in equally sized groups called pools and a single laboratory test is applied to each pool. Individuals whose samples belong to pools that test negative are declared healthy, while each pool that tests positive is divided into smaller, equally sized pools which are tested in the next stage. In the (k + 1)-th stage all remaining samples are tested. If p < 1 -3-1/3, we minimize the expected number of tests per individual as a function of the number k + 1 of stages, and of the pool sizes in the first k stages. We show that for each p ∈ (0, 1 -3-1/3) the optimal choice is one of four possible schemes, which are explicitly described. We conjecture that for each p, the optimal choice is one of the two sequences of pool sizes (3k or 3k-14, 3k-1,..., 32, 3), with a precise description of the range of p’s where each is optimal. The conjecture is supported by overwhelming numerical evidence for p > 2-51. We also show that the cost of the best among the schemes (3k,..., 3) is of order O(p log(1/p)), comparable to the information theoretical lower bound p log2(1/p) + (1 -p) log2(1/(1 -p)), the entropy of a Bernoulli(p) random variable.
- 1 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (2) , 1119-1132
Group Testing With Nested Pools
In order to identify the infected individuals of a population, their samples are divided in equally sized groups called pools and a single laboratory test is applied to each pool. Individuals whose samples belong to pools that test negative are declared healthy, while each pool that tests positive is divided into smaller, equally sized pools which are tested in the next stage. In the (k + 1)-th stage all remaining samples are tested. If p < 1 -3-1/3, we minimize the expected number of tests per individual as a function of the number k + 1 of stages, and of the pool sizes in the first k stages. We show that for each p ∈ (0, 1 -3-1/3) the optimal choice is one of four possible schemes, which are explicitly described. We conjecture that for each p, the optimal choice is one of the two sequences of pool sizes (3k or 3k-14, 3k-1,..., 32, 3), with a precise description of the range of p’s where each is optimal. The conjecture is supported by overwhelming numerical evidence for p > 2-51. We also show that the cost of the best among the schemes (3k,..., 3) is of order O(p log(1/p)), comparable to the information theoretical lower bound p log2(1/p) + (1 -p) log2(1/(1 -p)), the entropy of a Bernoulli(p) random variable.
- 4 October 2021
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 387 (3) , 1515-1547
Gaussian Random Permutation and the Boson Point Process
- 4 October 2021
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 387 (3) , 1515-1547
Gaussian Random Permutation and the Boson Point Process
- Open Access
Gaussian random permutation and the boson point process
We construct an infinite volume spatial random permutation $(\mathsf X,\sigma)$, where $\mathsf X\subset\mathbb R^d$ is locally finite and $\sigma:\mathsf X\to \mathsf X$ is a permutation, associated to the formal Hamiltonian $$ H(\mathsf X,\sigma) = \sum_{x\in \mathsf X} \|x-\sigma(x)\|^2. $$ The measures are parametrized by the point density $\rho$ and the temperature $\alpha$. Spatial random permutations are naturally related to boson systems through a representation originally due to Feynman (1953). Let $\rho_c=\rho_c(\alpha)$ be the critical density for Bose-Einstein condensation in Feynman's representation. Each finite cycle of $\sigma$ induces a loop of points of~$\mathsf X$. For $\rho\le \rho_c$ we define $(\mathsf X, \sigma)$ as a Poisson process of finite unrooted loops of a random walk with Gaussian increments that we call Gaussian loop soup, analogous to the Brownian loop soup of Lawler and Werner (2004). We also construct Gaussian random interlacements, a Poisson process of doubly infinite trajectories of random walks with Gaussian increments analogous to the Brownian random interlacements of Sznitman (2010). For $d\ge 3$ and $\rho>\rho_c$ we define $(\mathsf X,\sigma)$ as the superposition of independent realizations of the Gaussian loop soup at density $\rho_c$ and the Gaussian random interlacements at density $\rho-\rho_c$. In either case we call $(\mathsf X, \sigma)$ a Gaussian random permutation at density $\rho$ and temperature $\alpha$. The resulting measure satisfies a Markov property and it is Gibbs for the Hamiltonian $H$. Its point marginal $\mathsf X$ has the same distribution as the boson point process introduced by Shirai-Takahashi (2003) in the subcritical case, and by Tamura-Ito (2007) in the supercritical case.Open AccessGaussian random permutation and the boson point process
We construct an infinite volume spatial random permutation $(\mathsf X,\sigma)$, where $\mathsf X\subset\mathbb R^d$ is locally finite and $\sigma:\mathsf X\to \mathsf X$ is a permutation, associated to the formal Hamiltonian $$ H(\mathsf X,\sigma) = \sum_{x\in \mathsf X} \|x-\sigma(x)\|^2. $$ The measures are parametrized by the point density $\rho$ and the temperature $\alpha$. Spatial random permutations are naturally related to boson systems through a representation originally due to Feynman (1953). Let $\rho_c=\rho_c(\alpha)$ be the critical density for Bose-Einstein condensation in Feynman's representation. Each finite cycle of $\sigma$ induces a loop of points of~$\mathsf X$. For $\rho\le \rho_c$ we define $(\mathsf X, \sigma)$ as a Poisson process of finite unrooted loops of a random walk with Gaussian increments that we call Gaussian loop soup, analogous to the Brownian loop soup of Lawler and Werner (2004). We also construct Gaussian random interlacements, a Poisson process of doubly infinite trajectories of random walks with Gaussian increments analogous to the Brownian random interlacements of Sznitman (2010). For $d\ge 3$ and $\rho>\rho_c$ we define $(\mathsf X,\sigma)$ as the superposition of independent realizations of the Gaussian loop soup at density $\rho_c$ and the Gaussian random interlacements at density $\rho-\rho_c$. In either case we call $(\mathsf X, \sigma)$ a Gaussian random permutation at density $\rho$ and temperature $\alpha$. The resulting measure satisfies a Markov property and it is Gibbs for the Hamiltonian $H$. Its point marginal $\mathsf X$ has the same distribution as the boson point process introduced by Shirai-Takahashi (2003) in the subcritical case, and by Tamura-Ito (2007) in the supercritical case. - Open Access
Zero-range processes with rapidly growing rates
We provide two methods to construct zero-range processes with superlinear rates on ${\mathbb Z}^d$. In the first method these rates can grow very fast, if either the dynamics and the initial distribution are translation invariant or if only nearest neigbour translation invariant jumps are permitted, in the one-dimensional lattice. In the second method the rates cannot grow as fast but more general dynamics are allowed.Open AccessZero-range processes with rapidly growing rates
We provide two methods to construct zero-range processes with superlinear rates on ${\mathbb Z}^d$. In the first method these rates can grow very fast, if either the dynamics and the initial distribution are translation invariant or if only nearest neigbour translation invariant jumps are permitted, in the one-dimensional lattice. In the second method the rates cannot grow as fast but more general dynamics are allowed. - 16 August 2016
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 169 (1-2) , 105-175
Metastability in a condensing zero-range process in the thermodynamic limit
- 16 August 2016
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 169 (1-2) , 105-175
Metastability in a condensing zero-range process in the thermodynamic limit
- Open Access
Metastability in a condensing zero-range process in the thermodynamic limit
Zero-range processes with decreasing jump rates are known to exhibit condensation, where a finite fraction of all particles concentrates on a single lattice site when the total density exceeds a critical value. We study such a process on a one-dimensional lattice with periodic boundary conditions in the thermodynamic limit with fixed, super-critical particle density. We show that the process exhibits metastability with respect to the condensate location, i.e. the suitably accelerated process of the rescaled location converges to a limiting Markov process on the unit torus. This process has stationary, independent increments and the rates are characterized by the scaling limit of capacities of a single random walker on the lattice. Our result extends previous work for fixed lattices and diverging density in [J. Beltran, C. Landim, Probab. Theory Related Fields, 152(3-4):781-807, 2012], and we follow the martingale approach developed there and in subsequent publications. Besides additional technical difficulties in estimating error bounds for transition rates, the thermodynamic limit requires new estimates for equilibration towards a suitably defined distribution in metastable wells, corresponding to a typical set of configurations with a particular condensate location. The total exit rates from individual wells turn out to diverge in the limit, which requires an intermediate regularization step using the symmetries of the process and the regularity of the limit generator. Another important novel contribution is a coupling construction to provide a uniform bound on the exit rates from metastable wells, which is of a general nature and can be adapted to other models.
Open AccessMetastability in a condensing zero-range process in the thermodynamic limit
Zero-range processes with decreasing jump rates are known to exhibit condensation, where a finite fraction of all particles concentrates on a single lattice site when the total density exceeds a critical value. We study such a process on a one-dimensional lattice with periodic boundary conditions in the thermodynamic limit with fixed, super-critical particle density. We show that the process exhibits metastability with respect to the condensate location, i.e. the suitably accelerated process of the rescaled location converges to a limiting Markov process on the unit torus. This process has stationary, independent increments and the rates are characterized by the scaling limit of capacities of a single random walker on the lattice. Our result extends previous work for fixed lattices and diverging density in [J. Beltran, C. Landim, Probab. Theory Related Fields, 152(3-4):781-807, 2012], and we follow the martingale approach developed there and in subsequent publications. Besides additional technical difficulties in estimating error bounds for transition rates, the thermodynamic limit requires new estimates for equilibration towards a suitably defined distribution in metastable wells, corresponding to a typical set of configurations with a particular condensate location. The total exit rates from individual wells turn out to diverge in the limit, which requires an intermediate regularization step using the symmetries of the process and the regularity of the limit generator. Another important novel contribution is a coupling construction to provide a uniform bound on the exit rates from metastable wells, which is of a general nature and can be adapted to other models.
- 1 October 2015
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 125 (10) , 3879-3892
Phase transition for the dilute clock model
- 1 October 2015
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 125 (10) , 3879-3892
Phase transition for the dilute clock model
- Open Access
Phase transition for the dilute clock model
We prove that phase transition occurs in the dilute ferromagnetic nearest-neighbour $q$-state clock model in $\mathbb{Z}^d$, for every $q\geq 2$ and $d\geq 2$. This follows from the fact that the Edwards-Sokal random-cluster representation of the clock model stochastically dominates a supercritical Bernoulli bond percolation probability, a technique that has been applied to show phase transition for the low-temperature Potts model. The domination involves a combinatorial lemma which is one of the main points of this article.Open AccessPhase transition for the dilute clock model
We prove that phase transition occurs in the dilute ferromagnetic nearest-neighbour $q$-state clock model in $\mathbb{Z}^d$, for every $q\geq 2$ and $d\geq 2$. This follows from the fact that the Edwards-Sokal random-cluster representation of the clock model stochastically dominates a supercritical Bernoulli bond percolation probability, a technique that has been applied to show phase transition for the low-temperature Potts model. The domination involves a combinatorial lemma which is one of the main points of this article. - Open Access
- 23 December 2014
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 158 (6) , 1213-1233
Finite Cycle Gibbs Measures on Permutations of ${{\mathbb Z}^d}$ Z d- 23 December 2014
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 158 (6) , 1213-1233
Open AccessFinite Cycle Gibbs Measures on Permutations of ${{\mathbb Z}^d}$ Z d