Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.01149

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs

Júlia Komjáthy·John Lapinskas·Johannes Lengler
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the spread of information in finite and infinite inhomogeneous spatial random graphs. We assume that each edge has a transmission cost that is a product of an i.i.d. random variable L and a penalty factor: edges between vertices of expected degrees w_1 and w_2 are penalised by a factor of (w_1w_2)^μfor all μ>0. We study this process for scale-free percolation, for (finite and infinite) Geometric Inhomogeneous Random Graphs, and for Hyperbolic Random Graphs, all with power law degree distributions with exponent τ> 1. For τ< 3, we find a threshold behaviour, depending on how fast the cumulative distribution function of L decays at zero. If it decays at most polynomially with exponent smaller than (3-τ)/(2μ) then explosion happens, i.e., with positive probability we can reach infinitely many vertices with finite cost (for the infinite models), or reach a linear fraction of all vertices with bounded costs (for the finite models). On the other hand, if the cdf of L decays at zero at least polynomially with exponent larger than (3-τ)/(2μ), then no explosion happens. This behaviour is arguably a better representation of information spreading processes in social networks than the case without penalising factor, in which explosion always happens unless the cdf of L is doubly exponentially flat around zero. Finally, we extend the results to other penalty functions, including arbitrary polynomials in w_1 and w_2. In some cases the interesting phenomenon occurs that the model changes behaviour (from explosive to conservative and vice versa) when we reverse the role of w_1 and w_2. Intuitively, this could corresponds to reversing the flow of information: gathering information might take much longer than sending it out.

Explore related subjects

math.PRcs.SImath.COq-bio.PE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Júlia Komjáthy, John Lapinskas, Johannes Lengler. 2020-04-02. Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. https://arxiv.org/abs/2004.01149

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

KEEP EXPLORING

Related papers

arXiv2026

Bounded weak solutions to cross-diffusion semiconductor model with electron-hole scattering

Semiconductor model is a system of parabolic partial differential equations with cross-diffusion phenomenon. Previous results showed that a weak solution exists and is not bounded in general. So semiconductor model was categorized as a cross-diffusion system without bounded weak solutions. In this work, we show that once the initial value is bounded, there exists a weak solution that is also bounded. The entropy method is a major tool in global existence analysis of cross-diffusion systems. We notice that traditional entropies in volume-filling cases may not provide required positive semi-definiteness result for the existence proof. In this situation, a transformation of variables technique has been applied. The product between Hessian matrix of the entropy and replacement diffusion matrix is positive semi-definite, then we apply the entropy method to show semiconductor model has a bounded weak solution.

math.PR↗
arXiv2026

Global existence and uniqueness analysis of cross-diffusion multispecies chemotaxis system with volume-filling

The system of multispecies chemotaxis equations is a cross-diffusion system with volume-filling. In this work, we show that a weak solution of the two species chemotaxis system exists. The entropy method is a major tool in existence analysis of cross-diffusion systems. Previous investigations indicate that traditional entropies in volume-filling cases may not be able to provide required gradient estimates. In this situation, we upgrade existing matrix computation methods to derive gradient estimates. Due to the cross-diffusion phenomenon, the uniqueness of the weak solution to a cross-diffusion system is very difficult to prove in general. In this work, we apply the distance functional to show that when parameters of the chemotaxis system are identical, the weak solution is unique.

math.PR↗
arXiv2026

Self-normalized scaled quadratic variation

The concept of a scaled quadratic variation was originally introduced by E. Gladyshev in 1961 for processes with Gaussian increments. Using certain deterministic scaling, arrived at from the covariance of the process, Gladyshev showed that the sum of scaled square increments along the dyadic partition sequence converges almost surely to a finite limit. In this paper, we propose a pathwise counterpart in which the deterministic normalization is replaced by a self-normalizing factor built from the $p$-th variation of the path along a given sequence of partitions. The resulting quantity requires no probabilistic assumption and no knowledge of a covariance structure, and its scale is both path-dependent and sensitive to the partition sequence. Under a mild regularity condition on the limiting $p$-th variation, we show that the self-normalized and the classical deterministic normalizations are comparable, and for fractional Brownian motion the two agree up to a multiplicative constant. We establish a switching behaviour in the index, and prove that for $p \ge 2$ the self-normalized scaled quadratic variation obeys a smooth-transformation formula under $C^2$ maps; at $p=2$ this recovers the known transformation rule for quadratic variation. Since only squared increments are scaled, the construction polarizes, yielding a matrix-valued scaled quadratic variation for every $p \geq 1$ for $\mathbb R^d$ valued paths. We conclude with examples beyond the Gaussian setting.

math.PR↗