相关论文: A combinatorial property of flows on a cycle

Analyzing field data from pumping tests, we show that as with many other natural phenomena, groundwater flow exhibits a complex dynamics described by 1/f power spectrum. This result is theoretically studied within an agent perspective.…

Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow…

Generative flows models enjoy the properties of tractable exact likelihood and efficient sampling, which are composed of a sequence of invertible functions. In this paper, we incorporate matrix exponential into generative flows. Matrix…

Existence and uniqueness of global in time measure solution for the multidimensional aggregation equation is analyzed. Such a system can be written as a continuity equation with a velocity field computed through a self-consistent…

The main inspiration for this paper is a paper by Elek where he introduces combinatorial cost for graph sequences. We show that having cost equal to 1 and hyperfiniteness are coarse invariants. We also show `cost-1' for box spaces behaves…

Unconditional flow-matching trains diffusion models to transport samples from a source distribution to a target distribution by enforcing that the flows between sample pairs are unique. However, in conditional settings (e.g.,…

Microscopic flows are almost universally linear, laminar and stationary because Reynolds number, $Re$, is usually very small. That impedes mixing in micro-fluidic devices, which sometimes limits their performance. Here we show that truly…

Let $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \emph{cut condition} if for any cut in…

The appearance of numerous period-doubling cascades is among the most prominent features of {\bf parametrized maps}, that is, smooth one-parameter families of maps $F:R \times {\mathfrak M} \to {\mathfrak M}$, where ${\mathfrak M}$ is a…

We consider the problem of finding a feasible single-commodity flow in a strongly connected network with fixed supplies and demands, provided that the sum of supplies equals the sum of demands and the minimum arc capacity is at least this…

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

We prove that if $X|_\Lambda$ has the weak specification property robustly, where $\Lambda$ is an isolated set, then $\Lambda$ is a hyperbolic topologically mixing set and, as a consequence, if $X$ is a vector field that has the weak…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

We construct a complete invariant for non-wandering surface flows with finitely many singular points but without locally dense orbits. Precisely, we show that a flow $v$ with finitely many singular points on a compact connected surface $S$…

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

The property of cyclicity of a linear operator, or equivalently the property of simplicity of its spectrum, is an important spectral characteristic that appears in many problems of functional analysis and applications to mathematical…

Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erd\H{o}s. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result,…