36 citations · 73 across the 19 of their papers we have counts for
20 papers
A Strength and Sparsity Preserving Algorithm for Generating Weighted, Directed Networks with Predetermined Assortativity
Yelie Yuan, Jun Yan, Panpan Zhang
Degree-preserving rewiring is a widely used technique for generating unweighted networks with given assortativity, but for weighted networks, it is unclear how an analog would pres…
Generating General Preferential Attachment Networks with R Package wdnet
Yelie Yuan, Tiandong Wang, Jun Yan +1
Preferential attachment (PA) network models have a wide range of applications in various scientific disciplines. Efficient generation of large-scale PA networks helps uncover their…
An Efficient Algorithm for Generating Directed Networks with Predetermined Assortativity Measures
Tiandong Wang, Jun Yan, Yelie Yuan +1
Assortativity coefficients are important metrics to analyze both directed and undirected networks. In general, it is not guaranteed that the fitted model will always agree with the…
PageRank centrality and algorithms for weighted, directed networks with applications to World Input-Output Tables
Panpan Zhang, Tiandong Wang, Jun Yan
PageRank (PR) is a fundamental tool for assessing the relative importance of the nodes in a network. In this paper, we propose a measure, weighted PageRank (WPR), extended from the…
Several topological indices of random caterpillars
Panpan Zhang, Xiaojing Wang
In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thoug…
Regional and Sectoral Structures and Their Dynamics of Chinese Economy: A Network Perspective from Multi-Regional Input-Output Tables
Tao Wang, Shiying Xiao, Jun Yan +1
A multi-regional input-output table (MRIOT) containing the transactions among the region-sectors in an economy defines a weighted and directed network. Using network analysis tools…
Assortativity measures for weighted and directed networks
Yelie Yuan, Jun Yan, Panpan Zhang
Assortativity measures the tendency of a vertex in a network being connected by other vertexes with respect to some vertex-specific features. Classical assortativity coefficients a…
Clustering US States by Time Series of COVID-19 New Case Counts with Non-negative Matrix Factorization
Jianmin Chen, Jun Yan, Panpan Zhang
The spreading pattern of COVID-19 differ a lot across the US states under different quarantine measures and reopening policies. We proposed to cluster the US states into distinct c…
Functional data analysis: An application to COVID-19 data in the United States
Chen Tang, Tiandong Wang, Panpan Zhang
The COVID-19 pandemic so far has caused huge negative impacts on different areas all over the world, and the United States (US) is one of the most affected countries. In this paper…
The degree Gini index of several classes of random trees and their poissonized counterparts---an evidence for a duality theory
Carly Domicolo, Panpan Zhang, Hosam Mahmoud
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional ev…
The Zagreb index of several random models
Panpan Zhang
In this article, we investigate the Zagreb index, a kind of graph-based topological index, of several random networks, including a class of networks extended from random recursive…
Characterizing several properties of high-dimensional random Apollonian networks
Panpan Zhang
In this article, we investigate several properties of high-dimensional random Apollonian networks (HDRANs), including two types of degree profiles, the small-world effect (clusteri…
Distributions in the constant-differentials Pólya process
Hosam M. Mahmoud, Panpan Zhang
We study a class of unbalanced constant-differentials Pólya processes on white and blue balls. We show that the number of white balls, the number of blue balls, and the total numbe…
The degree profile and Gini index of random caterpillar trees
Panpan Zhang, Dipak K. Dey
In this paper, we investigate the degree profile and Gini index of random caterpillar trees (RCTs). We consider RCTs which evolve in two different manners: uniform and nonuniform.…
Clique-based Method for Social Network Clustering
Guang Ouyang, Dipak K. Dey, Panpan Zhang
In this article, we develop a clique-based method for social network clustering. We introduce a new index to evaluate the quality of clustering results, and propose an efficient al…
A Mixed-Membership Model for Social Network Clustering
Guang Ouyang, Dipak K. Dey, Panpan Zhang
We propose a simple mixed membership model for social network clustering in this paper. A flexible function is adopted to measure affinities among a set of entities in a social net…
On several properties of plane-oriented recursive trees
Panpan Zhang
In this paper, several properties of plain-oriented recursive trees (PORTs) are uncovered. Specifically, we investigate the degree profile of a PORT by determining the exact probab…
Characterizations of asymptotic distributions of continuous-time Pólya processes
Chen Chen, Panpan Zhang
We propose an elementary but effective approach to studying a general class of Poissonized tenable and balanced urns on two colors. We characterize the asymptotic behavior of the p…
On nodes of small degrees and degree profile in preferential dynamic attachment circuits
Panpan Zhang, Hosam Mahmoud
We investigate the joint distribution of nodes of small degrees and the degree profile in preferential dynamic attachment circuits. In particular, we study the joint asymptotic dis…
On connectivity in a general random intersection graph
Jun Zhao
There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graph $\mathbb{G}(n,\overrightarrow{a}, \…