We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...

In this paper, a new bond-graph library is introduced, programmed as part of the Dymola object-oriented graphical modeling environment. It is shown that the embedding of bond graphs into the Dymola modeling framework adds both expression power and flexibility to the bond-graph modeling methodology. The Dymola modeling framework is summarized, and the new bond-graph library is introduced. An (ac...

We transform historically observed line outages in a power transmission network into an influence graph that statistically describes how cascades propagate in the power grid. The influence graph can predict the critical lines that are historically most involved in cascading propagation. After upgrading these critical lines, simulating the influence graph suggests that these upgrades could mitig...

We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we depart from classical purely model-based approaches and propose hybrid method that retains key modeling elements conjunction with data-driven components. More precisely, put forth neural network architecture inspired by algorithmic unfolding iterative weighted minimum mean squar...

Network sensors consist of sensor nodes in which every node covers a limited area. The most common use ofthese networks is in unreachable fields.Sink is a node that collects data from other nodes.One of the main challenges in these networks is the limitation of nodes battery (power supply). Therefore, the use oftopology control is required to decrease power consumption and increase network acce...

We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andrásfai graph, Doob graph, cocktail party graph, crown graph, prism graph, Möbius ladder. The proofs operate by finding the abelianisation of a cyclically presented...