Change point detection in network models: preferential attachment and long range dependence

DOI10.1214/17-AAP1297zbMath1391.60015arXiv1508.02043OpenAlexW2964328082WikidataQ130161384 ScholiaQ130161384MaRDI QIDQ1751962

Shankar Bhamidi, Jimmy Jin, Andrew B. Nobel

Publication date: 25 May 2018

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.02043

zbMATH Keywords

functional central limit theorempoint processbranching processstatistical estimationchange pointpreferential attachmentJagers-Nerman stable age distribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (5)

The Bethe Hessian and information theoretic approaches for online change-point detection in network data ⋮ Correlated randomly growing graphs ⋮ Detecting structured signals in Ising models ⋮ Time‐varying β‐model for dynamic directed networks ⋮ Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point

Uses Software

• GraphScope
• OddBall

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits and influence of the seed graph in preferential attachment trees
• Spectra of large random trees
• Twitter event networks and the superstar model
• Limit theorems for sums determined by branching and other exponentially growing processes
• Scan statistics on Enron graphs
• Bayesian anomaly detection methods for social networks
• Sequential analysis. Tests and confidence intervals
• Nonparametric change-point estimation
• Functional limit theorems for dependent variables
• Degree distribution nearby the origin of a preferential attachment graph
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex Networks
• Changepoint Inference for Erdős–Rényi Random Graphs
• Finding Adam in random growing trees
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• The growth and composition of branching populations
• Minimax Methods for Multihypothesis Sequential Testing and Change-Point Detection Problems
• Partial Sums of Infinite Series, and How They Grow
• Markov Chains
• The Structure and Function of Complex Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• A general model of web graphs
• Asymptotic normality of degree counts in a preferential attachment model
• Random trees and general branching processes
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• On Optimum Methods in Quickest Detection Problems
• Networks

This page was built for publication: Change point detection in network models: preferential attachment and long range dependence