Related papers: Maximal spanning time for neighborhood growth on t…
In this paper, we introduce the stationary harmonic measure in the upper half plane. By bounding this measure, we are able to define both the discrete and continuous time diffusion limit aggregation (DLA) in the upper half plane with…
We consider a fitness-structured population model with competition and migration between nearest neighbors. Under a combination of large population and rare migration limits we are particularly interested in the asymptotic behavior of the…
We have used molecular dynamics simulations for a comprehensive study of phase separation in a two-dimensional single component off-lattice model where particles interact through the Lennard-Jones potential. Via state-of-the-art methods we…
We show that quantum circuit complexity for the unitary time evolution operator of any time-independent Hamiltonian is bounded by linear growth at early times, independent of any choices of the fundamental gates or cost metric. Deviations…
We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…
We have performed extensive simulations of random sequential adsorption and diffusion of $k$-mers, up to $k=5$ in two dimensions with particular attention to the case $k=2$. We focus on the behavior of the coverage and of vacancy dynamics…
For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…
In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…
Chaotic instability in many-body systems is commonly quantified by the largest Lyapunov exponent, yet general constraints on its magnitude in classical interacting systems remain poorly understood. Here we establish explicit,…
Gapped two-dimensional gauge theories with massless fermions generically have rich vacuum structures consisting of many degenerate vacua related by the action of topological line operators. The algebra of such operators has been used to…
The large spacing phase of the infinite random matrix chain, which represents the strongly coupled two-dimensional O(2) model on a random planar lattice, is explored. A class of solutions valid for large lattice spacings is constructed. It…
Motivated by recent experiments with ultra-cold quantum gases in optical lattices we study the decay of the staggered moment in the one-dimensional Fermi-Hubbard model starting from a perfect Neel state using exact diagonalization and the…
Given a simple graph $G$, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a…
It is shown that the ratio between the expected diameter of an L2-bounded martingale and the standard deviation of its last term cannot exceed sqrt(3). Moreover, a one-parameter family of stopping times on standard Brownian Motion is…
This paper is concerned with spreading properties of space-time heterogeneous Fisher--KPP equations in one space dimension. We focus on the case of everywhere favorable environment with three different zones, a left half-line with slow or…
In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal…
A systematic method to obtain strong coupling expansions for scattering quantities in Hamiltonian lattice field theories is presented. I develop the conceptual ideas by means of the Hamiltonian field theory analogue of the Ising model, in…
We study the unitary time evolution of the entanglement Hamiltonian of a free Fermi lattice gas in one dimension initially prepared in a domain wall configuration. To this aim, we exploit the recent development of quantum fluctuating…