Related papers: Large deviation principle for the streams and the …
Flow-based generative models have been employed for sampling the Boltzmann distribution, but their application to high-dimensional systems is hindered by the significant computational cost of obtaining the Jacobian of the flow. To overcome…
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…
We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on $N$ vertices. The processes are allowed to spread with different rates, start from vertex subsets of different…
An upper bound is derived for $\Delta$ for a cold dilute fluid of equal amounts of two species of fermion in the unitary regime $k_f a \to \infty$ (where $k_f$ is the Fermi momentum and $a$ the scattering length, and $\Delta$ is a pairing…
In [2], it was claimed that the time constant $\mu_{d}(e_{1})$ for the first-passage percolation model on $\mathbb Z^{d}$ is $\mu_{d}(e_{1}) \sim \log d/(2ad)$ as $d\to \infty$, if the passage times $(\tau_{e})_{e\in \mathbb E^{d}}$ are…
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We…
We consider the first passage percolation model on the square lattice with an edge weight distribution F. In this paper, we consider the number of optimal paths for two points separated by a long distance. We show that there is a phase…
We consider a two-dimensional Hamiltonian system perturbed by a small diffusion term, whose coefficient is state-dependent and non-degenerate. As a result, the process consists of the fast motion along the level curves and slow motion…
The large deviation principle is proved for a class of $L^2$-valued processes that arise from the coarse-graining of a random field. Coarse-grained processes of this kind form the basis of the analysis of local mean-field models in…
We study the large deviation function for the empirical measure of diffusing particles at one fixed position. We find that the large deviation function exhibits anomalous system size dependence in systems that satisfy the following…
This paper concerns maximal flows on $\mathbb{Z}^2$ traveling from a convex set to infinity, the flows being restricted by a random capacity. For every compact convex set $A$, we prove that the maximal flow $\Phi(nA)$ between $nA$ and…
We study a system of hard rods of finite size in one space dimension, which move by Brownian noise while avoiding overlap. We consider a scaling in which the number of particles tends to infinity while the volume fraction of the rods…
We prove a Large Deviations Principle (LDP) for systems of diffusions (particles) interacting through their ranks, when the number of particles tends to infinity. We show that the limiting particle density is given by the unique solution of…
In the Equal Maximum Flow Problem (EMFP), we aim for a maximum flow where we require the same flow value on all edges in some given subsets of the edge set. In this paper, we study the closely related Almost Equal Maximum Flow Problems…
To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and…
We give a new proof of the large deviation principle from the hydrodynamic limit for the Ginzberg-Landau model studied in Donsker and Varadhan (1989) using techniques from the theory of stochastic control and weak convergence methods. The…
In this paper, we will introduce the `grid method' to prove that the extreme case of oscillation occurs for the averages obtained by sampling a flow along the sequence of times of the form $\{n^\alpha: n\in \mathbb{N}\}$, where $\alpha$ is…
We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a $1/2$-approximation for estimating the value of MAX-CUT can be trivially achieved with $O(1)$ words…
We consider the independent set problem in the semi-streaming model. For any input graph $G=(V, E)$ with $n$ vertices, an independent set is a set of vertices with no edges between any two elements. In the semi-streaming model, $G$ is…
Motivated by the challenge of analyzing data sets with periodic boundary conditions to investigate transportation properties, we introduce a concept of circular max-flow for graphs mapped onto the circle. Unlike classical max-flow…