Max-linear models in random environment

Klüppelberg, Claudia; Sönmez, Ercan

doi:10.1016/j.jmva.2022.104999

Cited by 1 publication

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Considering the latter communities with the same minimum tail index (that are not necessarily distributed the same way) as the "columns" and taking into account that their order does not matter, one can conclude that (10) is always fulfilled for maxima over communities. Sums over rows of A (0) require the independence or weak dependence of the most heavy-tailed "column" series (see, namely, conditions (A1) and (A2) in [15,16]) additionally to (10). The number of the most heavy-tailed "column" series may be random.…”

Section: Network Communities As "Column" Series Of a (0)mentioning

confidence: 99%

“…Conditional independence is tightly linked to graphical models [8,10,[68][69][70]. Nodes in graphical models are associated with variables, and the set of edges encodes the conditional independence relations.…”

Section: Testing Of Dependence On Graphsmentioning

confidence: 99%

“…Heavytailed distributions are accepted as realistic models for many phenomena in random networks and graphs. Among the recent applications, we find graphical models that are used to model extremal dependence or causality between events [8,9], including a bond percolation; see [10] among others. The distributions of various extremal characteristics of random discrete structures, such as the maximum number of common neighbors of a set of vertices in the graph, the maximum codegree, and the maximum number of cliques sharing a given vertex in binomial random hypergraphs, are derived in [11,12].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Extreme Value Statistics for Evolving Random Networks

Markovich

Vaičiulis

2023

Mathematics

View full text Add to dashboard Cite

Our objective is to survey recent results concerning the evolution of random networks and related extreme value statistics, which are a subject of interest due to numerous applications. Our survey concerns the statistical methodology but not the structure of random networks. We focus on the problems arising in evolving networks mainly due to the heavy-tailed nature of node indices. Tail and extremal indices of the node influence characteristics like in-degrees, out-degrees, PageRanks, and Max-linear models arising in the evolving random networks are discussed. Related topics like preferential and clustering attachments, community detection, stationarity and dependence of graphs, information spreading, finding the most influential leading nodes and communities, and related methods are surveyed. This survey tries to propose possible solutions to unsolved problems, like testing the stationarity and dependence of random graphs using known results obtained for random sequences. We provide a discussion of unsolved or insufficiently developed problems like the distribution of triangle and circle counts in evolving networks, or the clustering attachment and the local dependence of the modularity, the impact of node or edge deletion at each step of evolution on extreme value statistics, among many others. Considering existing techniques of community detection, we pay attention to such related topics as coloring graphs and anomaly detection by machine learning algorithms based on extreme value theory. In order to understand how one can compute tail and extremal indices on random graphs, we provide a structured and comprehensive review of their estimators obtained for random sequences. Methods to calculate the PageRank and PageRank vector are shortly presented. This survey aims to provide a better understanding of the directions in which the study of random networks has been done and how extreme value analysis developed for random sequences can be applied to random networks.

show abstract

Section: Network Communities As "Column" Series Of a (0)mentioning

confidence: 99%