Results 31 to 40 of about 447,603 (295)
Efficient robust routing for single commodity network flows [PDF]
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed ...
Chen, Yongxin +3 more
core +2 more sources
A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph [PDF]
Graph-based algorithms have demonstrated state-of-the-art performance in the nearest neighbor search (NN-Search) problem. These empirical successes urge the need for theoretical results that guarantee the search quality and efficiency of these algorithms.
Anshumali Shrivastava +2 more
semanticscholar +1 more source
Relative Tutte polynomials of tensor products of colored graphs [PDF]
The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the identified edges. A
Brylawski, Chmutov, G. HETYEI, Y. DIAO
core +1 more source
The piezoelectric-actuated flexure-based compliant platform is commonly adopted in many fields of micro and nanotechnology. In this paper, bond graph modeling, and kinematic and dynamic characteristics of a piezoelectric-actuated micro-/nano compliant ...
Chao Lin +4 more
doaj +1 more source
Control and Optimization Algorithms for Lattice Power Grids With Multiple Grid-Forming Converters
The growth of renewable energies, together with their power converter interfaces, reshapes power systems into more-electronics power systems. Along with this paradigm shift is the requirement of grid formation by grid-tied power converters.
Daniel Wei Zhang +2 more
doaj +1 more source
Connectivity for bridge-alterable graph classes [PDF]
A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable.
McDiarmid, Colin
core +1 more source
In this article we report on a novel way to incorporate complex network structure into the analysis of interacting particle systems. More precisely, it is well-known that in well-mixed/homogeneous/all-to-all-coupled systems, one may derive mean-field ...
Christian Kuehn
doaj +1 more source
Hodge theory-based biomolecular data analysis
Hodge theory reveals the deep intrinsic relations of differential forms and provides a bridge between differential geometry, algebraic topology, and functional analysis.
Ronald Koh Joon Wei +3 more
doaj +1 more source
A graph theory-based algorithm for the reduction of atmospheric chemical mechanisms. [PDF]
The atmospheric chemistry of volatile organic compounds (VOC) has a major influence on atmospheric pollutants and particle formation. Accurate modeling of this chemistry is essential for air quality models.
Wiser F +11 more
europepmc +2 more sources
Failure Localization in Power Systems via Tree Partitions [PDF]
Cascading failures in power systems propagate non-locally, making the control and mitigation of outages extremely hard. In this work, we use the emerging concept of the tree partition of transmission networks to provide an analytical characterization of ...
Guo, Linqi +4 more
core +5 more sources

