In order to provide high quality network management, traffic scheduling and network security, we need the per flow traffic information. However, in a highspeed net link, the flows number is so large that it is infeasible to gather and process all flows’ information accurately and efficiently. Several studies showed that a small percentage of flows account for most of the total network throughpu...

It is well-known that each nonnegative integral flow of a directed graph can be decomposed into a sum of nonnegative graph circuit flows, which cannot be further decomposed into nonnegative integral sub-flows. This is equivalent to saying that indecomposable flows of graphs are those graph circuit flows. Turning from graphs to signed graphs, the indecomposable flows are much richer than that of...

We study different renormalization group flows for scale-dependent effective actions, including exact and proper-time renormalization group flows. These flows have a simple one-loop structure. They differ in their dependence on the full field-dependent propagator, which is linear for exact flows. We investigate the inherent approximations of flows with a nonlinear dependence on the propagator. ...

We propose a new quantile regression framework to predict the entire future probability distribution of capital flows emerging markets, based on changes in global financial conditions, domestic structural characteristics, and policies. The approach allows us differentiate between impact median versus tails predicted density flows, short- medium-term effects. find that FX- macroprudential interv...

Aggregation of data flows has two major advantages. One is the reduction of state complexity within the network, the other is the saving of resources by statistical multiplexing between the aggregated flows. In this paper, we show a simple, yet effective scheme to aggregate real-time flows which require a statistical guarantee on experienced loss and a deterministic guarantee on the maximum del...

For hyperbolic flows over basic sets we study the asymptotic of the number of closed trajectories γ with periods Tγ lying in exponentially shrinking intervals (x−e−δx, x+ e), δ > 0, x → +∞. A general result is established which concerns hyperbolic flows admitting symbolic models whose corresponding Ruelle transfer operators satisfy some spectral estimates. This result applies to a variety of hy...

In this article we introduce the flow polynomial of a digraph and use it to study nowherezero flows from a commutative algebraic perspective. Using Hilbert’s Nullstellensatz, we establish a relation between nowhere-zero flows and dual flows. For planar graphs this gives a relation between nowhere-zero flows and flows of their planar duals. It also yields an appealing proof that every bridgeless...

We study different renormalisation group flows for scale dependent effective actions, including exact and proper-time renormalisation group flows. These flows have a simple one loop structure. They differ in their dependence on the full field-dependent propagator, which is linear for exact flows. We investigate the inherent approximations of flows with a non-linear dependence on the propagator....

We study the Bäcklund transformations of integrable geometric curve flows in certain geometries. These curve flows include the KdV and Camassa-Holm flows in the two-dimensional centro-equiaffine geometry, the mKdV and modified Camassa-Holm flows in the two-dimensional Euclidean geometry, the Schrödinger and extended Harry-Dym flows in the three-dimensional Euclidean geometry and the Sawada-Kote...