English
Related papers

Related papers: The asymptotic shape theorem for the frog model on…

200 papers

The existence of many-body mobility edges in closed quantum systems has been the focus of intense debate after the emergence of the description of the many-body localization phenomenon. Here we propose that this issue can be settled in…

Strongly Correlated Electrons · Physics 2019-05-01 Xing Bo Wei , Chen Cheng , Gao Xianlong , Rubem Mondaini

We study word metrics on Z^d by developing tools that are fine enough to measure dependence on the generating set. We obtain counting and distribution results for the words of length n. With this, we show that counting measure on spheres…

Group Theory · Mathematics 2011-04-25 Moon Duchin , Samuel Lelièvre , Christopher Mooney

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation.…

Quantum Physics · Physics 2012-07-11 Bálint Kollár , Tamás Kiss , Jaroslav Novotný , Igor Jex

We introduced in a previous paper a general notion of asymptotic morphism of a given local net of observables, which allows to describe the sectors of a corresponding scaling limit net. Here, as an application, we illustrate the general…

Mathematical Physics · Physics 2019-10-02 Roberto Conti , Gerardo Morsella

We introduce and analyze a class of interacting particle systems on the real line that combine features of the stochastic rat race and (deterministic) follow-the-leader models. The particle system evolves as a continuous-time pure jump…

Probability · Mathematics 2026-01-07 Sayan Banerjee , Amarjit Budhiraja , Dilshad Imon

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Combinatorics · Mathematics 2020-06-05 C. Dalfó , M. A. Fiol , N. López , J. Ryan

Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…

Probability · Mathematics 2023-06-08 Emma Horton , Alexander R. Watson

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

Group Theory · Mathematics 2025-12-23 Arjun Agarwal , Rachel Chen , Rohan Garg , Jared Kettinger

We study the motility-induced aggregation of active Brownian particles (ABPs) on a porous, circular wall. We observe that the morphology of aggregated dense-phase on a static wall depends on the wall porosity, particle motility, and the…

Soft Condensed Matter · Physics 2020-10-06 Suchismita Das , Sounok Ghosh , Raghunath Chelakkot

The finite dihedral group generated by one rotation and one flip is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…

Quantum Physics · Physics 2018-10-02 Wenjing Dai , Jiabin Yuan , Dan Li

We study the behaviour of continuous automorphism groups of quantum spin systems on the lattice. Whereas the shift is norm asymptotically abelian continuous automorphism groups can lead only to delocalization but not to norm asymptotic…

Mathematical Physics · Physics 2024-05-31 Heide Narnhofer

Networks of coupled degrade-and-fire (DF) oscillators are simple dynamical models of assemblies of interacting self-repressing genes. For mean-field interactions, which most mathematical studies have assumed so far, every trajectory must…

Adaptation and Self-Organizing Systems · Physics 2016-05-25 Alex Blumenthal , Bastien Fernandez

The growth of bacterial flagellar filaments is a self-assembly process where flagellin molecules are transported through the narrow core of the flagellum and are added at the distal end. To model this situation, we generalize a growth…

Biological Physics · Physics 2015-12-18 Maximilian Schmitt , Holger Stark

An individual-based model of an infinite system of point particles in $\mathbb{R}^d$ is proposed and studied. In this model, each particle at random produces a finite number of new particles and disappears afterwards. The phase space for…

Dynamical Systems · Mathematics 2015-10-27 Agnieszka Tanaś

Understanding information exchange and aggregation on networks is a central problem in theoretical economics, probability and statistics. We study a standard model of economic agents on the nodes of a social network graph who learn a binary…

Probability · Mathematics 2014-05-01 Elchanan Mossel , Allan Sly , Omer Tamuz

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle

We initiate the study of the \emph{twisted conjugacy growth series} of a finitely generated group, the formal power series associated to the twisted conjugacy growth function. Our main result is that, for a virtually abelian group, this…

Group Theory · Mathematics 2025-07-10 Alex Evetts , Maarten Lathouwers

Assume $(X, \omega)$ is a compact symplectic manifold with a Hamiltonian compact Lie group action and the zero in the Lie algebra is a regular value of the moment map $\mu$. We prove that a finite energy symplectic vortex exponentially…

Symplectic Geometry · Mathematics 2017-07-27 Bohui Chen , Bai-Ling Wang , Rui Wang

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…

Probability · Mathematics 2024-02-29 Michael Farber , Alexander Gnedin , Wajid Mannan