SearcharxivSearch

arXiv · 2609.10839

How Robust is Scale-Free Structure? Phase Transitions in Preferential Attachment Model under Attack?

Abstract

Will an attack on a network affect its structure in a major way? In this work we study this question by investigating a dynamic preferential attachment-type graph in which an attacker interferes with the growth mechanism. We show that our model of an attack exhibits a phase transition. If the skill of the attacker is low, the network preserves its scale-free structure inherited from the underlying preferential attachment structure (even though the tail of the degree distribution becomes lighter due to the attack). When the skill of the attacker increases and crosses a critical boundary, the scale-free property is destroyed. The skill of the attacker is expressed as the probability that, at a given step, the attacker succeeds in preventing adding an edge to the network and, instead, causes a deletion (in a preferential manner) of an edge. In all cases we describe the tail behaviour of the degree distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoyun Gong, Gennady Samorodnitsky. 2026-09-09. How Robust is Scale-Free Structure? Phase Transitions in Preferential Attachment Model under Attack?. https://arxiv.org/abs/2609.10839

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR