Results 11 to 20 of about 120,423 (316)
A Study of Problems Modelled as Network Equilibrium Flows [PDF]
, 2021 This thesis presents an investigation into selfish routing games from three main perspectives. These three areas are tied together by a common thread that runs through the main text of this thesis, namely selfish routing games and network equilibrium ...
O'Neill, S.
core +1 more source
Constrained flows in networks [PDF]
Theoretical Computer ScienceThe support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of these problems are NP-hard because they generalize linkage problems for digraphs.
Bang-Jensen, Jørgen +2 more
openaire +5 more sources
Asymmetric flow networks [PDF]
European Journal of Operational Research, 2014 This research is supported by the Spanish Ministerio de Economía y Competitividad under projects ECO2009-11213 and ECO2009-07939, co-funded by the ERDF. Both authors also bene t from the Basque Government s funding to Grupos Consolidados GIC07/146-IT-377-07 and GIC07/22-IT-223 ...
Norma Olaizola, Federico Valenciano
openaire +4 more sources
Journal of Graph Theory, 2023 AbstractIn this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labelling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex, meaning that the sum of the labels on the incoming edges of this vertex equals the sum of those on the ...
openaire +4 more sources
Social Choice and Welfare, 2018 In this paper we propose an in-depth analysis of a method, called the flow network method, which associates with any network a complete and quasi-transitive binary relation on its vertices. Such a method, originally proposed by Gvozdik (1987), is based on the concept of maximum flow.
Daniela Bubboloni, Michele Gori
openaire +4 more sources
A Theorem on Flows in Networks [PDF]
Pacific Journal of Mathematics, 1957 The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, [4].
openaire +3 more sources
Applied Network Science, 2021 Evidence from 184 countries over the span of 25 years is gathered and analyzed to understand North–North, South–South, and North–South international migration flows. Conceptually, the analysis borrows from network theory and Migration Systems Theory (MST)
Diego F. Leal, Nicolas L. Harder
doaj +1 more source
Laplacians for flow networks [PDF]
SIAM Journal on Discrete Mathematics, 2011 We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
Taylor, Joshua A., Hover, Franz S.
openaire +2 more sources
Multiscale Modeling & Simulation, 2014 We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the transported quantity in the neighboring cells.
Pierre Degond +2 more
openaire +4 more sources
CoRR, 2023 This paper introduces Bayesian Flow Networks (BFNs), a new class of generative model in which the parameters of a set of independent distributions are modified with Bayesian inference in the light of noisy data samples, then passed as input to a neural network that outputs a second, interdependent distribution.
Alex Graves +3 more
openaire +2 more sources