Zobrazeno 1 - 10
of 168
pro vyhledávání: '"Belur, Madhu N."'
In a network consisting of n nodes, our goal is to identify the most central k nodes with respect to the proposed definitions of centrality. Depending on the specific application, there exist several metrics for quantifying k-centrality, and the subs
Externí odkaz:
http://arxiv.org/abs/2406.05512
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic connectivity both local and globally over all simple, undirected, unweighte
Externí odkaz:
http://arxiv.org/abs/2110.01918
Autor:
Kumar, Sandeep, Belur, Madhu N.
SISO passive systems with just one type of memory/storage element (either only inductive or only capacitative) are known to have real poles and zeros, and further, with the zeros interlacing poles (ZIP). Due to a variety of definitions of the notion
Externí odkaz:
http://arxiv.org/abs/2007.13599
In this paper, we study structural controllability of a linear time invariant (LTI) composite system consisting of several subsystems. We assume that the neighbourhood of each subsystem is unconstrained, i.e., any subsystem can interact with any othe
Externí odkaz:
http://arxiv.org/abs/1711.05975
Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function
This paper deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the set of all matchings. After proving the NP-hardness of the problem using
Externí odkaz:
http://arxiv.org/abs/1710.10037
This paper solves the sparsest feedback selection problem for linear time invariant structured systems, a long-standing open problem in structured systems. We consider structurally cyclic systems with dedicated inputs and outputs. We prove that findi
Externí odkaz:
http://arxiv.org/abs/1706.07928
This paper addresses optimal feedback selection for generic arbitrary pole placement of structured systems when each feedback edge is associated with a cost. Given a structured system and a feedback cost matrix, our aim is to find a feasible feedback
Externí odkaz:
http://arxiv.org/abs/1706.06911
This paper is about minimum cost constrained selection of inputs and outputs for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states that each o
Externí odkaz:
http://arxiv.org/abs/1705.09600
This paper looks at two problems, minimum constrained input selection and minimum cost constrained input selection for state space structured systems. The input matrix is constrained in the sense that the set of states that each input can influence i
Externí odkaz:
http://arxiv.org/abs/1704.04608