相关论文: Blocking duality for $p$-modulus on networks and a…

One of the main properties of modulus on graphs is Fulkerson duality. In this paper, we study Fulkerson duality for spanning tree modulus. We introduce a new notion of Beurling partition, and we identify two important ones, which correspond…

F. Gehring and W. Ziemer proved that the p-modulus of the family of paths connecting two continua is dual to the p^*-modulus of the corresponding family of separating hypersurfaces. In this paper we show that a similar result holds in…

The concept of $p$-modulus gives a way to measure the richness of a family of objects on a graph. In this paper, we investigate the families of connecting walks between two fixed nodes and show how to use $p$-modulus to form a parametrized…

The notion of $p$-modulus of a family of objects on a graph is a measure of the richness of such families. We develop the notion of minimal subfamilies using the method of Lagrangian duality for $p$-modulus. We show that minimal subfamilies…

In this paper, we establish the theory of $p$-modulus of a family of infinite paths on an infinite-rooted tree and then explore its interpretation and properties. One key result is the formulation of $p$-modulus on the infinite tree as a…

This paper presents new results for the modulus of families of walks on a graph---a discrete analog of the modulus of curve families due to Beurling and Ahlfors. Particular attention is paid to the dependence of the modulus on its…

On a static graph, the p-modulus of a family of paths reflects both the lengths of these paths as well as their diversity; a family of many short, disjoint paths has larger modulus than a family of a few long overlapping paths. In this…

An old idea in optimization theory says that since the gradient is a dual vector it may not be subtracted from the weights without first being mapped to the primal space where the weights reside. We take this idea seriously in this paper…

This manuscript describes the notions of blocker and interdiction applied to well-known optimization problems. The main interest of these two concepts is the capability to analyze the existence of a combinatorial structure after some…

We prove a duality relation for the moduli of the family of curves connecting two sets and the family of surfaces separating the sets, in the setting of a complete metric space equipped with a doubling measure and supporting a Poincar\'e…

Complex networks have recently attracted much interest due to their prevalence in nature and our daily lives [1, 2]. A critical property of a network is its resilience to random breakdown and failure [3-6], typically studied as a…

A generalization of modularity, called block modularity, is defined. This is a quality function which evaluates a label assignment against an arbitrary block pattern. Therefore, unlike standard modularity or its variants, arbitrary network…

Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs are not well developed yet. In this paper, we propose a…

The application of the network approach to the urban case poses several questions in terms of how to deal with metric distances, what kind of graph representation to use, what kind of measures to investigate, how to deepen the correlation…

Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the vertices within clusters but sparse connections between…

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a…

Complex networks topologies present interesting and surprising properties, such as community structures, which can be exploited to optimize communication, to find new efficient and context-aware routing algorithms or simply to understand…

We study the structure of loops in networks using the notion of modulus of loop families. We introduce a new measure of network clustering by quantifying the richness of families of (simple) loops. Modulus tries to minimize the expected…

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $\Gamma_1,\Gamma_2$. A cycle in a doubly group-labeled graph is $(\Gamma_1,\Gamma_2)$-non-zero if it is non-zero in both…

The concept of effective resistance, originally introduced in electrical circuit theory, has been extended to the setting of graphs by interpreting each edge as a resistor. In this context, the effective resistance between two vertices…