Related papers: Rapid mixing from spectral independence beyond the…
We derive core-level spectra for doped free-standing bilayer graphene. Numerical results are presented for all nine combinations of the doping concentrations $10^{12}\rm{cm}^{-2}$, $10^{13}\rm{cm}^{-2}$, and $10^{14}\rm{cm}^{-2}$ in the two…
We consider an energy conserving linear dynamics that we perturb by a Glauber dynamics with random site dependent intensity. We prove hydrodynamic limits for this non-reversible system in random media. The diffusion coefficient turns out to…
External magnetic field profiles leading to equidistant and partially equidistant bilayer graphene spectra within the tight-binding model are obtained. This is achieved by implementing the integral and differential versions of the…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
We show polylogarithmic mixing time bounds for the alternating-scan sampler for positively weighted restricted Boltzmann machines. This is done via analysing the same chain and the Glauber dynamics for ferromagnetic two-spin systems, where…
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk…
We calculate the optical spectra of silicon and germanium in the adiabatic time-dependent density functional formalism, making use of kinetic energy density-dependent (meta-GGA) exchange-correlation functionals. We find excellent agreement…
We consider a nonlocal evolution equation representing the continuum limit of a large ensemble of interacting particles on graphs forced by noise. The two principle ingredients of the continuum model are a nonlocal term and Q-Wiener process…
We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…
We study the problem of optimal mixing of a passive scalar $\rho$ advected by an incompressible flow on the two dimensional unit square. The scalar $\rho$ solves the continuity equation with a divergence-free velocity field $u$ with…
This paper presents a general framework for modeling dependence in multivariate time series. Its fundamental approach relies on decomposing each signal in a system into various frequency components and then studying the dependence…
We design an efficient sampling algorithm to generate samples from the hardcore model on random regular bipartite graphs as long as $\lambda \lesssim \frac{1}{\sqrt{\Delta}}$, where $\Delta$ is the degree. Combined with recent work of…
Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…
Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index $\tau-1>0$. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially…
Let $X$ be a (repetitive) infinite connected simple graph with a finite upper bound $\Delta$ on the vertex degrees. The main theorem states that $X$ admits a (repetitive) limit aperiodic vertex coloring by $\Delta$ colors. This refines a…
Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…
Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…
The classical Weisfeiler-Leman algorithm aka color refinement is fundamental for graph learning with kernels and neural networks. Originally developed for graph isomorphism testing, the algorithm iteratively refines vertex colors. On many…
We show how to couple phase-oscillators on a graph so that collective dynamics "searches" for the coloring of that graph as it relaxes toward the dynamical equilibrium. This translates a combinatorial optimization problem (graph coloring)…
This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…