Related papers: Extremes in Random Graphs Models of Complex Networ…
A central issue in the theory of extreme values focuses on suitable conditions such that the well-known results for the limiting distributions of the maximum of i.i.d. sequences can be applied to stationary ones. In this context, the…
We investigate the problem of enforcing a desired centrality measure in complex networks, while still keeping the original pattern of the network. Specifically, by representing the network as a graph with suitable nodes and weighted edges,…
We compute the stationary in-degree probability, $P_{in}(k)$, for a growing network model with directed edges and arbitrary out-degree probability. In particular, under preferential linking, we find that if the nodes have a light tail…
Continuous mixtures of distributions are widely employed in the statistical literature as models for phenomena with highly divergent outcomes; in particular, many familiar heavy-tailed distributions arise naturally as mixtures of…
Random graph (RG) models play a central role in the complex networks analysis. They help to understand, control, and predict phenomena occurring, for instance, in social networks, biological networks, the Internet, etc. Despite a large…
Graph Neural Networks (GNNs) have achieved tremendous success in a variety of real-world applications by relying on the fixed graph data as input. However, the initial input graph might not be optimal in terms of specific downstream tasks,…
Identifying emerging influential or popular node/item in future on network is a current interest of the researchers. Most of previous works focus on identifying leaders in time evolving networks on the basis of network structure or node's…
The connectivity of a network contains information about the relationships between nodes, which can denote interactions, associations, or dependencies. We show that this information can be analyzed by measuring the uncertainty (and…
We provide a comprehensive review of causal dependence through a max-linear structural equation model. Such models express each node variable as a max-linear function of its parental node variables in a directed acyclic graph and some…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
Motivated by the empirical observation of power-law distributions in the credits (e.g., ``likes'') of viral posts in social media, we introduce a high-dimensional tail index regression model and propose methods for estimation and inference…
We study the typical behavior of a generalized version of Google's PageRank algorithm on a large family of inhomogeneous random digraphs. This family includes as special cases directed versions of classical models such as the…
The PageRank algorithm enables to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter $\alpha \in ]0,1[$. Using extensive numerical simulations of large web networks, with a special…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank…
Factor models have large potencial in the modeling of several natural and human phenomena. In this paper we consider a multivariate time series $\mb{Y}_n$, ${n\geq 1}$, rescaled through random factors $\mb{T}_n$, ${n\geq 1}$, extending some…
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical…
A problem closely related to epidemiology, where a subgraph of 'infected' links is defined inside a larger network, is investigated. This subgraph is generated from the underlying network by a random variable, which decides whether a link…
We consider network models where information items flow %are sent from a source to a sink node. We start with a model where routing is constrained by energy available on nodes in finite supply (like in Smartdust) and efficiency is related…
Recursive max-linear vectors model causal dependence between its components by expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph and some exogenous innovation. Motivated by extreme…