相关论文: A Vectored Fragmentation Metric for Elastic Optica…

Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical…

Many optical measurement techniques, such as light scattering from wavelength-scale particles or detecting motion from a surface with an optical lever, encode information in a complex radiation pattern. Extracting all available information…

Fractal behavior and long-range dependence are widely observed in measurements and characterization of traffic flow in high-speed computer networks of different technologies and coverage levels. This paper presents the results obtained when…

Network virtualization is an efficient approach of solving the ossification problem of the Internet. It has become a promising way of supporting lots of heterogeneous network onto substrate physical network. A major challenge in network…

This paper studies the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and…

A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…

From longitudinal biomedical studies to social networks, graphs have emerged as a powerful framework for describing evolving interactions between agents in complex systems. In such studies, after pre-processing, the data can be represented…

Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…

An automatic image segmentation procedure is an inevitable part of many image analyses and computer vision which deeply affect the rest of the system; therefore, a set of interactive segmentation evaluation methods can substantially…

Percolation is an emblematic model to assess the robustness of interconnected systems when some of their components are corrupted. It is usually investigated in simple scenarios, such as the removal of the system's units in random order, or…

A network's assortativity is the tendency of vertices to bond with others based on similarities, usually excess vertex degree. In this paper we consider assortativity in weighted networks, both directed and undirected. To this end, we…

The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a…

A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. We define a measure of assortative mixing for networks and use it to show that…

Crack-templated networks, metallic frameworks fabricated from crack patterns in sacrificial thin films, can exhibit high optical transmittance, high electric conductivity, and a host of other properties attractive for applications. Despite…

Quantum communication is a growing area of research, with quantum internet being one of the most promising applications. Studying the statistical properties of this network is essential to understanding its connectivity and the efficiency…

Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing…

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

In large networks, using the length of shortest paths as the distance measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial. The second shortcoming is that a…