Related papers: Large deviation principle for the streams and the …
We derive a conservation law on a network made of two incoming branches and a single outgoing one from a discrete traffic flow model. The continuous model is obtained from the discrete one by letting the number of vehicles tend to infinity…
We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…
Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session network coding (MISNC) problem. However, it is still hard to solve using conventional…
Two-dimensional turbulent flows, and to some extent, geophysical flows, are systems with a large number of degrees of freedom, which, albeit fluctuating, exhibit some degree of organization: coherent structures emerge spontaneously at large…
Sampling a probability distribution with an unknown normalization constant is a fundamental problem in computational science and engineering. This task may be cast as an optimization problem over all probability measures, and an initial…
We present an $\tilde{O}\left(m^{\frac{10}{7}}U^{\frac{1}{7}}\right)$-time algorithm for the maximum $s$-$t$ flow problem and the minimum $s$-$t$ cut problem in directed graphs with $m$ arcs and largest integer capacity $U$. This matches…
In many physical situations involving diverse length scales, waves or rays representing them travel through media characterized by spatially smooth, random, modest refactive index variations. "Primary" diffraction (by individual…
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the…
This paper proposes a new mathematical formulation for flow measurement based on the inverse source problem for wave equations with partial boundary measurement. Inspired by the design of acoustic Doppler current profilers (ADCPs), we…
Reduced-order modelling and system identification can help us figure out the elementary degrees of freedom and the underlying mechanisms from the high-dimensional and nonlinear dynamics of fluid flow. Machine learning has brought new…
Current is a characteristic feature of nonequilibrium systems. In stochastic systems, these currents exhibit fluctuations constrained by the rate of dissipation in accordance with the recently discovered thermodynamic uncertainty relation.…
We investigate the maximum entropy principle for general field theory, including a metric tensor $g_{ \mu \nu }$, a vector field $A_{ \mu }$, and a scalar field $\varphi$ as the fundamental fields, and find (i) imposing an ordinary…
We discuss the O(2N) vector model in three dimensions. While this model flows to the Wilson-Fisher fixed point when fine tuned, working in a double-scaling limit of large N and large charge allows us to study the model away from the…
In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of $\mathbb Z^2$ (a.k.a. dimer configurations or domino tilings) and developed a large deviation theory for the associated height…
We consider a continuous time Markov chain on a countable state space and prove a joint large deviation principle for the empirical measure and the empirical flow, which accounts for the total number of jumps between pairs of states. We…
We consider the branching random walk drifting to $-\infty$ and we investigate large deviations-type estimates for the first passage time. We prove the corresponding law of large numbers and the central limit theorem.
We investigate the shallow flow of viscous fluid into and out of a channel whose gap width increases as a power-law ($x^n$), where $x$ is the downstream axis. The fluid flows slowly, while injected at a rate in the form of $t^\alpha$, where…
We consider the standard first passage percolation model on $\mathbb Z^ d$ with a distribution $G$ taking two values $0<a<b$. We study the maximal flow through the cylinder $[0,n]^ {d-1}\times [0,hn]$ between its top and bottom as well as…
In this paper, we present an improved algorithm for the maximum flow problem on general networks with $n$ vertices and $m$ arcs. We show how to solve the problem in $O(mn)$ time, when $m = O(n^{2-\epsilon})$, for some $0 <\epsilon \leq 1$.…