相关论文: Maximal stream and minimal cutset for first passag…

We consider the standard first passage percolation model in the rescaled lattice $\mathbb{Z}^d$ for $d\geq 2$ and a bounded domain $\Omega$ in $\mathbb R ^d$. We denote by $\Gamma^1$ and $\Gamma^2$ two disjoint subsets of $\partial \Omega$…

We consider the standard first passage percolation model in the rescaled lattice $\mathbb Z^d/n$ for $d\geq 2$ and a bounded domain $\Omega$ in $\mathbb R^d$. We denote by $\Gamma^1$ and $\Gamma^2$ two disjoint subsets of $\partial \Omega$…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled graph $\mathbb {Z}^d/n$ for $d\geq2$ and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb {R}^d$. Let $\Gamma ^1$ and $\Gamma ^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model on Z^d with a distribution G on R+ that admits an exponential moment. We study the maximal flow between a compact convex subset A of R^d and infinity. The study of maximal flow is…

We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the subcritical…

We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the specific application of finding minimum cuts in streams is less…

We consider the standard first passage percolation on $\mathbb{Z}^{d}$: with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten…

The seminal work of Ahn, Guha, and McGregor in 2012 introduced the graph sketching technique and used it to present the first streaming algorithms for various graph problems over dynamic streams with both insertions and deletions of edges.…

We present an algorithm for the maximum matching problem in dynamic (insertion-deletions) streams with *asymptotically optimal* space complexity: for any $n$-vertex graph, our algorithm with high probability outputs an $\alpha$-approximate…

We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams and dynamic streams and present new upper and lower bound results for both…

In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given…

We prove that any semi-streaming algorithm for $(1-\epsilon)$-approximation of maximum bipartite matching requires \[ \Omega(\frac{\log{(1/\epsilon)}}{{\log{(1/\beta)}}}) \] passes, where $\beta \in (0,1)$ is the largest parameter so that…

We prove a lower bound on the space complexity of two-pass semi-streaming algorithms that approximate the maximum matching problem. The lower bound is parameterized by the density of Ruzsa-Szemeredi graphs: * Any two-pass semi-streaming…

The max-flow min-cut theorem is a cornerstone result in combinatorial optimization. Calegari et al. (arXiv:0802.3208) initialized the study of quantum max-flow min-cut conjecture, which connects the rank of a tensor network and the min-cut.…

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…

We study in this paper, the first passage percolation on a random graph model, the configuration model. We first introduce, the notions of weighted diameter, which is the maximum of the weighted lengths of all optimal paths between any two…

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…

We consider the classic maximal and maximum independent set problems in three models of graph streams: In the edge-arrival model we see a stream of edges which collectively define a graph, this model has been well-studied for a variety of…