Related papers: 2-FREE-FLOOD-IT is polynomial
We propose a new Monte Carlo scheme to study the late-time dynamics of a 2-dim hard sphere fluid, modeled by a tethered network of hard spheres. Fluidity is simulated by breaking and reattaching the flexible tethers. We study the diffusion…
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…
We present new lower bounds that show that a polynomial number of passes are necessary for solving some fundamental graph problems in the streaming model of computation. For instance, we show that any streaming algorithm that finds a…
A dynamical systems approach to turbulence envisions the flow as a trajectory through a high-dimensional state space transiently visiting the neighbourhoods of unstable simple invariant solutions (E. Hopf, Commun. Appl. Maths 1, 303, 1948).…
In streamed graph drawing, a planar graph, G, is given incrementally as a data stream and a straight-line drawing of G must be updated after each new edge is released. To preserve the mental map, changes to the drawing should be minimized…
We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian.…
The fluid dynamics of a relativistic fireball with longitudinal and transverse expansion is described using a background-fluctuation splitting. Symmetry representations of azimuthal rotations and longitudinal boosts are used for a…
We propose a flower shape billiard in order to study the irregular parameter dependence of chaotic normal diffusion. Our model is an open system consisting of periodically distributed obstacles of flower shape, and it is strongly chaotic…
There are numerous physical situations in which a hole or leak is introduced in an otherwise closed chaotic system. The leak can have a natural origin, it can mimic measurement devices, and it can also be used to reveal dynamical properties…
We study the evolution, under convex Hamiltonian flows on cotangent bundles of compact manifolds, of certain distinguished subsets of the phase space. These subsets are generalizations of Lagrangian graphs, we call them pseudographs. They…
Diffusion-based classifiers such as those relying on the Personalized PageRank and the Heat kernel, enjoy remarkable classification accuracy at modest computational requirements. Their performance however is affected by the extent to which…
A strongly polynomial algorithm is developed for finding an integer-valued feasible $st$-flow of given flow-amount which is decreasingly minimal on a specified subset $F$ of edges in the sense that the largest flow-value on $F$ is as small…
For simulating incompressible flows by projection methods. it is generally accepted that the pressure-correction stage is the most time-consuming part of the flow solver. The objective of the present work is to develop a fast hybrid…
This work discusses the homogenization analysis for diffusion processes on scale-free metric graphs, using weak variational formulations. The oscillations of the diffusion coefficient along the edges of a metric graph induce internal…
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply,…
Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…
We devise a policy-iteration algorithm for deterministic two-player discounted and mean-payoff games, that runs in polynomial time with high probability, on any input where each payoff is chosen independently from a sufficiently random…
Diffusion is a fundamental graph procedure and has been a basic building block in a wide range of theoretical and empirical applications such as graph partitioning and semi-supervised learning on graphs. In this paper, we study…
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the…
The present research proposes a new memory-efficient method using diffusion models to inject turbulent inflow conditions into Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS) for various flow problems. A guided diffusion…