Related papers: Greedy lattice animals: geometry and criticality (…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
We determine the shape of all sum-free sets in $\{1,2,\ldots,n\}^2$ of size close to the maximum $\frac{3}{5}n^2$, solving a problem of Elsholtz and Rackham. We show that all such asymptotic maximum sum-free sets lie completely in the…
Kalu\v{z}a, Kopeck\'a and the author have shown that the best Lipschitz constant for mappings taking a given $n^{d}$-element set in the integer lattice $\mathbb{Z}^{d}$, with $n\in \mathbb{N}$, surjectively to the regular $n$ times $n$ grid…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
The E. coli chemosensory lattice, consisting of receptors, kinases, and adaptor proteins, is an important test case for biochemical signal processing. Kinase output is characterized by precise adaptation to a wide range of background ligand…
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…
We demonstrate that the standard O(n) symmetric $\phi^{4}$ field theory does not correctly describe the leading finite-size effects near the critical point of spin systems on a $d$-dimensional lattice with $d > 4$. We show that these…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
I will review recent progress on addressing large N gauge theories on the lattice. The focus will be put on the use of large N volume independence as an effective tool to compute non-perturbative dynamics at, otherwise unreachable, large…
Let $\# K$ be a number of integer lattice points contained in a set $K$. In this paper we prove that for each $d\in {\mathbb N}$ there exists a constant $C(d)$ depending on $d$ only, such that for any origin-symmetric convex body $K \subset…
We consider a subcritical Galton--Watson tree conditioned on having $n$ vertices with outdegree in a fixed set $\Omega$. Under mild regularity assumptions we prove various limits related to the maximal offspring of a vertex as $n$ tends to…
Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…
A detailed study of the mean-field solution of Langevin equations with multiplicative noise is presented. Three different regimes depending on noise-intensity (weak, intermediate, and strong-noise) are identified by performing a…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
We characterize positive critical Hardy weights for general Laplacians on weighted graphs. We then apply this result to fractional Laplacians on general graphs and use the characterization to identify an optimal Hardy weight under suitable…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
I summarise what lattice methods can contribute to our understanding of the phenomenology of QCD at large Nc and describe some recent work on the physics of SU(Nc) gauge theories. These non-perturbative calculations show that there is…
A perturbed lattice is a point process $\Pi=\{x+Y_x:x\in \mathbb{Z}^d\}$ where the lattice points in $\mathbb{Z}^d$ are perturbed by i.i.d.\ random variables $\{Y_x\}_{x\in \mathbb{Z}^d}$. A random point process $\Pi$ is said to be rigid if…
Certain types of neurons, called "grid cells", have been shown to fire on a triangular grid when an animal is navigating on a two-dimensional environment, whereas recent studies suggest that the face-centred-cubic (FCC) lattice is the good…