Related papers: Asymptotics of height change on toroidal Temperley…
The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian…
We study perturbations of the Erdos-Renyi model for which the statistical weight of a graph depends on the abundance of certain geometrical patterns. Using the formal correspondance with an exactly solvable effective model, we show the…
We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…
We prove the existence of a limit shape for the dimer model on planar periodic bipartite graphs with an arbitrary fundamental domain and arbitrary periodic weights. This proof is based on a variational principle that uses the locality of…
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…
Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or…
We consider the zero-average Gaussian free field on a certain class of finite $d$-regular graphs for fixed $d\geq 3$. This class includes $d$-regular expanders of large girth and typical realisations of random $d$-regular graphs. We show…
We study a class of close-packed dimer models on the square lattice, in the presence of small but extensive perturbations that make them non-determinantal. Examples include the 6-vertex model close to the free-fermion point, and the dimer…
L\'evy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
Nonperturbative, in inverse Thouless conductance 1/g, corrections to distributions of level velocities and level curvatures in quasi-one-dimensional disordered conductors with a topology of a ring subject to a constant vector potential are…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
We study the dimer model on special subgraphs of the square hexagon lattice called "tower graphs" of size $N$. Using integrable probability techniques, we confirm that as $N \rightarrow \infty$, the local statistics are translation…
Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…
It is widely believed that the celebrated 2D Ising model at criticality has a universal and conformally invariant scaling limit, which is used in deriving many of its properties. However, no mathematical proof of universality and conformal…
The Discrete Gaussian model is the lattice Gaussian free field conditioned to be integer-valued. In two dimensions, at sufficiently high temperature, we show that its macroscopic scaling limit on the torus is a multiple of the Gaussian free…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…
We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…
Species survival in the $(3, 1)$ May-Leonard system is determined by the mobility, with a critical mobility threshold between long-term coexistence and extinction. We show experimentally that the critical mobility threshold is determined by…