Results 21 to 30 of about 275,010 (282)
Flow generated by slow steady rotation of a permeable sphere in a micro-polar fluid
Alexandria Engineering Journal, 2017 The analytical study of the flow generated by the slow steady rotation of a permeable sphere in an incompressible micro-polar fluid is considered. Both the flows internal and external to the sphere are coupled.
P. Aparna +3 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2008 Abstract In this paper we introduce the concept of k-flow-critical graphs. These are graphs that do not admit a k-flow but such that any smaller graph obtained from it by contraction of edges or of pairs of vertices is k-flowable. Any minimal counter-example for Tutte's 3-Flow and 5-Flow Conjectures must be 3-flow-critical and 5-flow-critical ...
Cândida Nunes da Silva +1 more
openaire +1 more source
Flows on graphs with random capacities [PDF]
Physical Review E, 2006 We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities.
Antal, T., Krapivsky, P. L.
openaire +3 more sources
Complete algebraic vector fields on affine surfaces [PDF]
, 2019 Let $\AAutH (X)$ be the subgroup of the group $\AutH (X)$ of holomorphic automorphisms of a normal affine algebraic surface $X$ generated by elements of flows associated with complete algebraic vector fields.
Kaliman, Shulim +2 more
core +2 more sources
Macroscopic network circulation for planar graphs [PDF]
, 2020 The analysis of networks, aimed at suitably defined functionality, often focuses on partitions into subnetworks that capture desired features. Chief among the relevant concepts is a 2-partition, that underlies the classical Cheeger inequality, and ...
Ariaei, Fariba +3 more
core +1 more source
European Journal of Combinatorics, 2022 A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a vertex of degree three. In this paper, we study the structure and extreme edge density of $3$-flow-critical graphs. We
Jiaao Li +4 more
openaire +2 more sources
Fast flowing populations are not well mixed [PDF]
, 2017 In evolutionary dynamics, well-mixed populations are almost always associated with all-to-all interactions; mathematical models are based on complete graphs. In most cases, these models do not predict fixation probabilities in groups of individuals mixed
A Lapin +45 more
core +3 more sources
Algorithms, 2014 We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages to ...
Tamás Fleiner
doaj +1 more source
CoRR, 2019 We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs.
Jenny Liu +4 more
openaire +3 more sources
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs [PDF]
, 2010 We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems.
Christiano, Paul +4 more
core +4 more sources