Related papers: The L2 strong maximum principle on arbitrary count…
This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
Optimality principles in nonequilibrium transport networks are linked to a thermodynamic formalism based on generalized transport potentials endowed with Legendre duality and related contact structure. This allows quantifying the distance…
We implement the Ising model on a structural connectivity matrix describing the brain at a coarse scale. Tuning the model temperature to its critical value, i.e. at the susceptibility peak, we find a maximal amount of total information…
We introduce and solve a model which considers two coupled networks growing simultaneously. The dynamics of the networks is governed by the new arrival of network elements (nodes) making preferential attachments to pre-existing nodes in…
We consider a dissipative flow network that obeys the standard linear nodal flow conservation, and where flows on edges are driven by potential difference between adjacent nodes. We show that in the case when the flow is a monotonically…
A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $F$ of colored vertices, with all remaining vertices being non-colored. At each time step, a colored vertex with exactly one non-colored neighbor forces this…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…
A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…
Effective graph resistance is a fundamental structural metric in network science, widely used to quantify global connectivity, compare network architectures, and assess robustness in flow-based systems. Despite its importance, current…
We undertake a systematic investigation of the maxima and minima of the eigenfunctions associated with the first nontrivial eigenvalue of the Laplacian on a metric graph equipped with standard (continuity--Kirchhoff) vertex conditions. This…
This paper addresses the energy accumulation problem, in terms of the $H_2$ norm, of linearly coupled dynamical networks. An interesting outer-coupling relationship is constructed, under which the $H_2$ norm of the newly constructed network…
Many decision-making algorithms draw inspiration from the inner workings of individual biological systems. However, it remains unclear whether collective behavior among biological species can also lead to solutions for computational tasks.…
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as a burning source, while fire simultaneously spreads from…
We show that for any liquid or solid with strong correlation between its $NVT$ virial and potential-energy equilibrium fluctuations, the temperature is a product of a function of excess entropy per particle and a function of density,…
We study the validity of the comparison and maximum principles, and their relation with principal eigenvalues, for a class of degenerate nonlinear operators that are extremal among operators with one dimensional fractional diffusion.
Complex network states are characterized by the interplay between system's structure and dynamics. One way to represent such states is by means of network density matrices, whose von Neumann entropy characterizes the number of distinct…
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from…