SearcharxivSearch

arXiv subjects

Ariel Yadin

Publications and source records attributed to Ariel Yadin.

At least 19 recordsLinked to original sources

Gaussian fluctuations for Internal DLA on cylinders

Internal DLA is a discrete random growth model describing growing clusters of particles. Its limiting shape and fluctuations are well understood when the underlying graph is the $d$-dimensional lattice or the cylinder $\mathbb{Z}_N \times \mathbb{Z}$. In the latter geometry, the average fluctuations of IDLA have been shown to converge to the GFF. In this note we generalise this result by showing that, for any vertex-transitive base graph $V_N$ satisfying an eigenvalue convergence condition, the average fluctuations of IDLA on the cylinder $V_N \times \mathbb{Z}$ are given by a GFF. On the way, we present an improved bound on the clusters' maximal fluctuations, which is of independent interest and which implies a shape theorem for IDLA on $V_N \times \mathbb{Z}$ for any vertex-transitive base graph $V_N$.

math.PR

Groups with a finite Busemann boundary are virtually cyclic

This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the underlying group is virtually cyclic. Together with previous works, this completes the full characterization of groups with finite metric-functional boundaries. The main new notion introduced is that of annihilators.

math.GR

Phase transition for recurrence of stationary random walks on lamplighter groups

We introduce and study a class of random walks on lamplighter groups $H\wr G$, where $H$ is a nontrivial finitely generated group and $G$ is an infinite finitely generated group, called \textbf{stationary random walks}. At each step, the walk switches the lamp at its current position, moves in the base group with a drift towards the identity, and switches the lamp again at the new position. We show that when $G$ is virtually-$\mathbb{Z}$ and $H$ is finite, these walks exhibit a phase transition between recurrence and transience, while when~$G$ is not virtually-$\mathbb{Z}$ or $H$ is infinite, they are always transient. In the case $G=\mathbb{Z}$, we determine the exact critical parameter and provide a quantitative description of this phase transition.

math.PR

Completely Syndetic Sets in Discrete Groups

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually nilpotent ones admit a partition into two CS sets, we show that virtually abelian groups do not. We also characterize CS subsets of the group of integers Z, and as a result characterize subsets of Z whose closure in the Stone-Cech compactification contains the smallest two sided ideal. Finally, we show that CS sets can have an arbitrarily small density.

math.GR

Detecting virtual homomorphisms via Banach metrics

We introduce the notion of "Banach metrics" on finitely generated infinite groups. This extends the notion of a Cayley graph (as a metric space). Our motivation comes from trying to detect the existence of virtual homomorphisms into Z, the additive group of integers. We show that detection of such homomorphisms through metric functional boundaries of Cayley graphs isn't always possible. However, we prove that it is always possible to do so through a metric functional boundary of some Banach metric on the group.

math.GR

Groups with finitely many Busemann points

We show that an infinite finitely generated group G is virtually-Z if and only if every Cayley graph of G contains only finitely many Busemann points in its horofunction boundary. This complements a previous result of the second named author and M. Tointon.

math.GR

Ensuring Reliable Robot Task Performance through Probabilistic Rare-Event Verification and Synthesis

Providing guarantees on the safe operation of robots against edge cases is challenging as testing methods such as traditional Monte-Carlo require too many samples to provide reasonable statistics. Built upon recent advancements in rare-event sampling, we present a model-based method to verify if a robotic system satisfies a Signal Temporal Logic (STL) specification in the face of environment variations and sensor/actuator noises. Our method is efficient and applicable to both linear and nonlinear and even black-box systems with arbitrary, but known, uncertainty distributions. For linear systems with Gaussian uncertainties, we exploit a feature to find optimal parameters that minimize the probability of failure. We demonstrate illustrative examples on applying our approach to real-world autonomous robotic systems.

cs.RO

Existence of phase transition for percolation using the Gaussian Free Field

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of Bernoulli percolation on infinite quasi-transitive graphs (in particular, Cayley graphs) with super-linear growth is strictly smaller than 1, thus answering a conjecture of Benjamini and Schramm. The proof relies on a new technique consisting in expressing certain functionals of the Gaussian Free Field (GFF) in terms of connectivity probabilities for percolation model in a random environment. Then, we integrate out the randomness in the edge-parameters using a multi-scale decomposition of the GFF. We believe that a similar strategy could lead to proofs of the existence of a phase transition for various other models.

math.PR

Polynomially growing harmonic functions on connected groups

We study the connection between the dimension of certain spaces of harmonic functions on a group and its geometric and algebraic properties. Our main result shows that (for sufficiently "nice" random walk measures) a connected, compactly generated, locally compact group has polynomial volume growth if and only if the space of linear growth harmonic functions has finite dimension. This characterization is interesting in light of the fact that Gromov's theorem regarding finitely generated groups of polynomial growth does not have an analog in the connected case. That is, there are examples of connected groups of polynomial growth that are not nilpotent by compact. Also, the analogous result for the discrete case has only been established for solvable groups, and is still open for general finitely generated groups.

math.GR

Universal inequalities for Dirichlet eigenvalues on discrete groups

We prove universal inequalities for Laplacian eigenvalues with Dirichlet boundary conditions on subsets of certain discrete groups. The study of universal inequalities on Riemannian manifolds was initiated by Weyl, Polya, Yau, and others. Here we focus on a version by Cheng and Yang. Specifically, we prove Yang-type universal inequalities for Cayley graphs of finitely generated amenable groups, as well as for the d-regular tree (simple random walk on the free group).

math.DG

Condensation of random walks and the Wulff crystal

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $β$. We prove that, for all $β>0$, the random walk condensates to a set of diameter $(t/β)^{1/3}$ in dimension $d=2$, up to a multiplicative constant. In all dimensions $d\ge 3$, we also prove that the volume is bounded above by $(t/β)^{d/(d+1)}$ and the diameter is bounded below by $(t/β)^{1/(d+1)}$. Similar results hold for a random walk conditioned to have local time greater than $β$ everywhere in its range when $β$ is larger than some explicit constant, which in dimension two is the logarithm of the connective constant.

math.PR

Upper bounds on the growth rate of Diffusion Limited Aggregation

We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is required. We apply this to many examples including transitive graphs of polynomial growth, graphs of exponential growth, non-amenable graphs, super-critical percolation on Z^d, high dimensional pre-Sierpinski carpets. We also observe that a careful analysis shows that Kesten's original bound on Z^3 can be improved from t^{2/3} to (t log t)^{1/2} .

math.PR

Furstenberg Entropy of Intersectional Invariant Random Subgroups

We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic stationary action. This generalizes results of Bowen. The stationary actions we construct arise via invariant random subgroups (IRSs), based on ideas of Bowen and Kaimanovich. We provide a general framework for constructing a continuum of ergodic IRSs for a discrete group under some algebraic conditions, which gives a continuum of entropy values. Our tools apply for example, for certain extensions of the group of finitely supported permutations and lamplighter groups, hence establishing full realization results for these groups. For the free group, we construct the IRSs via a geometric construction of subgroups, by describing their Schreier graphs. The analysis of the entropy of these spaces is obtained by studying the random walk on the appropriate Schreier graphs.

math.DS

Horofunctions on graphs of linear growth

We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.

math.MG

Polynomials and harmonic functions on discrete groups

Alexopoulos proved that on a finitely generated virtually nilpotent group, the restriction of a harmonic function of polynomial growth to a torsion-free nilpotent subgroup of finite index is always a polynomial in the Mal'cev coordinates of that subgroup. For general groups, vanishing of higher-order discrete derivatives gives a natural notion of polynomial maps, which has been considered by Leibman and others. We provide a simple proof of Alexopoulos's result using this notion of polynomials, under the weaker hypothesis that the space of harmonic functions of polynomial growth of degree at most k is finite dimensional. We also prove that for a finitely generated group the Laplacian maps the polynomials of degree k surjectively onto the polynomials of degree k - 2. We then present some corollaries. In particular, we calculate precisely the dimension of the space of harmonic functions of polynomial growth of degree at most k on a virtually nilpotent group, extending an old result of Heilbronn for the abelian case, and refining a more recent result of Hua and Jost.

math.GR

Minimal growth harmonic functions on lamplighter groups

We study the minimal possible growth of harmonic functions on lamplighters. We find that $(\mathbb{Z}/2)\wr \mathbb{Z}$ has no sublinear harmonic functions, $(\mathbb{Z}/2)\wr \mathbb{Z}^2$ has no sublogarithmic harmonic functions, and neither has the repeated wreath product $(\dotsb(\mathbb{Z}/2\wr\mathbb{Z}^2)\wr\mathbb{Z}^2)\wr\dotsb\wr\mathbb{Z}^2$. These results have implications on attempts to quantify the Derriennic-Kaimanovich-Vershik theorem.

math.PR

Indicable groups and $p_c<1$

A conjecture of Benjamini & Schramm from 1996 states that any finitely generated group that is not a finite extension of Z has a non-trivial percolation phase. Our main results prove this conjecture for certain groups, and in particular prove that any group with a non-trivial homomorphism into the additive group of real numbers satisfies the conjecture. We use this to reduce the conjecture to the case of hereditary just-infinite groups. The novelty here is mainly in the methods used, combining the methods of EIT and evolving sets, and using the algebraic properties of the group to apply these methods.

math.PR