Related papers: Ridge Network in Crumpled Paper
We uncover the global organization of clustering in real complex networks. As it happens with other fundamental properties of networks such as the degree distribution, we find that real networks are neither completely random nor ordered…
The community structure and motif-modular-network hierarchy are of great importance for understanding the relationship between structures and functions. In this paper, we investigate the distribution of clique-degree, which is an extension…
The analysis in this paper helps to explain the formation of growing networks with degree distributions that follow extended exponential or power-law tails. We present a generic model in which edge dynamics are driven by a continuous…
In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes…
In this paper we study the one dimensional random geometric graph when the location of the nodes are independent and exponentially distributed. We derive exact results and the limit theorems for the connectivity and other properties…
Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet,…
The neural network-based approach, presented in this paper, was developed for the analysis of peak profiles and for the prediction of base profile characteristics, such as width, asymmetry, asymptotic ("peak tales"), etc. of the observed…
A simple phenomenological relationship between the ridge distribution in $\Delta\eta$ and the single-particle distribution in $\eta$ can be established from the PHOBOS data on both distributions. The implication points to the possibility…
The shear strength and stick-slip behavior of a rough rock joint are analyzed using the complex network approach. We develop a network approach on correlation patterns of void spaces of an evolvable rough fracture (crack type II).…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
Optically active networks show feature-rich emission that depends on the fine details of their geometry, and find diverse applications in random lasers, sensing devices and photonics processors. In these and other systems, a thorough and…
We investigate degree correlations in two online social networks where users are connected through different types of links. We find that, while subnetworks in which links have a positive connotation, such as endorsement and trust, are…
We study structural properties of trees grown by preferential attachment. In this mechanism, nodes are added sequentially and attached to existing nodes at a rate that is strictly proportional to the degree. We classify nodes by their depth…
Percolation theory has been largely used in the study of structural properties of complex networks such as the robustness, with remarkable results. Nevertheless, a purely topological description is not sufficient for a correct…
Depinning of two-dimensional liquid ridges and three-dimensional drops on an inclined substrate is studied within the lubrication approximation. The structures are pinned to wetting heterogeneities arising from variations of the strength of…
Network (or graph) sparsification compresses a graph by removing inessential edges. By reducing the data volume, it accelerates or even facilitates many downstream analyses. Still, the accuracy of many sparsification methods, with…