Category Ranking
98%
Total Visits
921
Avg Visit Duration
2 minutes
Citations
20
Article Abstract
In this paper, we consider a dynamic version of the Chung-Lu random graph in which the edges alternate between being present and absent. The main contribution concerns a technique by which one can estimate the underlying dynamics from partial information, in particular from snapshots of the total number of edges present. The efficacy of our inference method is demonstrated through a series of numerical experiments.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1103/6w2h-p1sr | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Parameter estimation in a dynamic Chung-Lu random graph.
Phys Rev E
July 2025
University of Amsterdam, Korteweg-de Vries Institute for Mathematics, The Netherlands.
In this paper, we consider a dynamic version of the Chung-Lu random graph in which the edges alternate between being present and absent. The main contribution concerns a technique by which one can estimate the underlying dynamics from partial information, in particular from snapshots of the total number of edges present. The efficacy of our inference method is demonstrated through a series of numerical experiments.
View Article and Find Full Text PDFScalable Estimation of Epidemic Thresholds via Node Sampling.
Sankhya Ser A
July 2021
Statistics, North Carolina State University, Raleigh, NC USA.
Infectious or contagious diseases can be transmitted from one person to another through social contact networks. In today's interconnected global society, such contagion processes can cause global public health hazards, as exemplified by the ongoing Covid-19 pandemic. It is therefore of great practical relevance to investigate the network transmission of contagious diseases from the perspective of statistical inference.
View Article and Find Full Text PDFAsymptotic entropy of the Gibbs state of complex networks.
Sci Rep
January 2021
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, ul. Bałtycka 5, 44-100, Gliwice, Poland.
In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature.
View Article and Find Full Text PDF