Related papers: The $\ell_{\infty}$ Directed Spanning Forest
We present an accurate local density-functional for electronic-structure calculations within the density functional theory (DFT). The functional is derived by analyzing the structure of the standard perturbative expansion of the correlation…
When a simply connected domain $D\subset{\mathbb{R}}^d$ ($d\ge 2$) is approximated in a "good" way by embedded connected weighted graphs, we prove that the transfer current matrix (defined on the edges of the graph viewed as an electrical…
A system of soft ellipsoid molecules confined between two planar walls is studied using classical Density Functional Theory (DFT). Both the isotropic and nematic phases are considered. The excess free energy is evaluated using two different…
Sliced-Wasserstein distance (SW) and its variant, Max Sliced-Wasserstein distance (Max-SW), have been used widely in the recent years due to their fast computation and scalability even when the probability measures lie in a very high…
The 1+1 dimensional directed polymers in a Poissonean random environment is studied. For two polymers of maximal length with the same origin and distinct end points we establish that the point of last branching is governed by the exponent…
We present a new algorithm for finding an $\epsilon$-approximate fixed point of an $\ell_\infty$-contracting function $f : [0, 1]^d \rightarrow [0, 1]^d$. Our algorithm is based on the query-efficient algorithm by Chen, Li, and Yannakakis…
We prove that the wired uniform spanning forest exhibits mean-field behaviour on a very large class of graphs, including every transitive graph of at least quintic volume growth and every bounded degree nonamenable graph. Several of our…
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…
Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part of which relies on a criterion proposed by Fontes, Isopi,…
We consider the $n$-dimensional random temporal hypercube, i.e., the $n$-dimensional hypercube graph with its edges endowed with i.i.d. continuous random weights. We say that a vertex $w$ is accessible from another vertex $v$ if and only if…
Despite the latest prevailing success of deep neural networks (DNNs), several concerns have been raised against their usage, including the lack of intepretability the gap between DNNs and other well-established machine learning models, and…
We study percolation of two-sided level sets for the discrete Gaussian free field (DGFF) in 2D. For a DGFF $\varphi$ defined in a box $B_N$ with side length $N$, for $C$ large enough, there exist low crossings in the set of vertices $z$…
As recently discovered [PRL ${\bf 109}$ 190601(2012)], Anderson localization in a bulk disordered system triggers the emergence of a coherent forward scattering (CFS) peak in momentum space, which twins the well-known coherent…
The time evolution of entanglement tracks how information propagates in interacting quantum systems. We study entanglement entropy in CFT$_2$ with a time-dependent Hamiltonian. We perturb by operators with time-dependent source functions…
We introduce and investigate a simple model to describe recent experiments by Douady and Daerr on flowing sand. The model reproduces experimentally observed compact avalanches, whose opening angle decreases linearly as a threshold is…
In this paper we prove a scaling limit result for the component of the root in the Wired Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the latter tree arises as the local weak limit of the Minimal…
We study the stochastic dynamics of strongly-coupled excitable elements on a tree network. The peripheral nodes receive independent random inputs which may induce large spiking events propagating through the branches of the tree and leading…
In the stochastic network model of Britton and Lindholm [Dynamic random networks in dynamic populations. Journal of Statistical Physics, 2010], the number of individuals evolves according to a supercritical linear birth and death process,…
We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…
We consider the level-sets of continuous Gaussian fields on $\mathbb{R}^d$ above a certain level $-\ell\in \mathbb{R}$, which defines a percolation model as $\ell$ varies. We assume that the covariance kernel satisfies certain regularity,…