English
Related papers

Related papers: Connectivity transitions in networks with super-li…

200 papers

Acceptance of an innovation can occur through mutliple exposures to individuals who have already accepted it. Presented here is a model to trace the evolution of an innovation in a social network with a preference $\lambda$, amidst…

Physics and Society · Physics 2014-08-22 Varsha S. Kulkarni

Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like Trophic Analysis and non-normality. We propose a simple growing network model where the…

Physics and Society · Physics 2024-05-13 Niall Rodgers , Peter Tino , Samuel Johnson

It is commonly believed that real networks are scale-free and fraction of nodes $P(k)$ with degree $k$ satisfies the power law $P(k) \propto k^{-\gamma} \text{ for } k > k_{min} > 0$. Preferential attachment is the mechanism that has been…

Data Structures and Algorithms · Computer Science 2023-06-22 Raheel Anwar , Muhammad Irfan Yousuf , Muhammad Abid

We study structural properties of growing networks where both addition and deletion of nodes are possible. Our model network evolves via two independent processes. With rate r, a node is added to the system and this node links to a randomly…

Statistical Mechanics · Physics 2007-07-12 E. Ben-Naim , P. L. Krapivsky

We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a sublinear function of the indegree of the older vertex at that time. It is well known…

Probability · Mathematics 2018-05-04 Carina Betken , Hanna Döring , Marcel Ortgiese

We introduce a class of generative network models that insert edges by connecting the starting and terminal vertices of a random walk on the network graph. Within the taxonomy of statistical network models, this class is distinguished by…

Methodology · Statistics 2018-07-11 Benjamin Bloem-Reddy , Peter Orbanz

We highlight intriguing features of complex networks that are grown by \emph{redirection}. In this mechanism, a target node is chosen uniformly at random from the pre-existing network nodes and the new node attaches either to this initial…

Physics and Society · Physics 2025-01-14 P. L. Krapivsky , S. Redner

We investigate a class of growing graphs embedded into the $d$-dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on…

Probability · Mathematics 2019-11-13 Peter Gracar , Arne Grauer , Lukas Lüchtrath , Peter Mörters

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary…

Data Structures and Algorithms · Computer Science 2020-07-01 Gabriel Cardona , Joan Carles Pons , Celine Scornavacca

Based on the empirical analysis of the dependency network in 18 Java projects, we develop a novel model of network growth which considers both: an attachment mechanism and the addition of new nodes with a heterogeneous distribution of their…

Physics and Society · Physics 2015-05-19 Claudio J. Tessone , Markus M. Geipel , F. Schweitzer

There has lately been increased interest in describing complex systems not merely as single networks but rather as collections of networks that are coupled to one another. We introduce an analytically tractable model that enables one to…

Physics and Society · Physics 2019-06-05 Juan Fernández-Gracia , Jukka-Pekka Onnela

Random spanning trees are among the most prominent determinantal point processes. We give four examples of random spanning trees on ladder-like graphs whose rungs form stationary renewal processes or regenerative processes of order two,…

Probability · Mathematics 2017-04-04 Achim Klenke

We study a supremacy distribution in evolving Barabasi-Albert networks. The supremacy $s_i$ of a node $i$ is defined as a total number of all nodes that are younger than $i$ and can be connected to it by a directed path. For a network with…

Statistical Mechanics · Physics 2009-11-10 Janusz A. Holyst , Agata Fronczak , Piotr Fronczak

The rate at which nodes in evolving social networks acquire links (friends, citations) shows complex temporal dynamics. Preferential attachment and link copying models, while enabling elegant analysis, only capture rich-gets-richer effects,…

Social and Information Networks · Computer Science 2017-09-07 Mayank Singh , Rajdeep Sarkar , Pawan Goyal , Animesh Mukherjee , Soumen Chakrabarti

We present analytical results for the effect of preferential node deletion on the structure of networks that evolve via node addition and preferential attachment. To this end, we consider a preferential-attachment-preferential-deletion…

Physics and Society · Physics 2025-06-24 Barak Budnick , Ofer Biham , Eytan Katzav

Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks, to distinguish different networks, and to see when one…

Combinatorics · Mathematics 2020-04-10 Remie Janssen , Yukihiro Murakami

We introduce and study the permanence properties of the class of linear transfers between probability measures. This class contains all cost minimizing mass transports, but also martingale mass transports, the Schrodinger bridge associated…

Analysis of PDEs · Mathematics 2018-10-29 Malcolm Bowles , Nassif Ghoussoub

A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…

Probability · Mathematics 2024-01-30 Miguel González , Carmen Minuesa , Manuel Mota , Inés del Puerto , Alfonso Ramos

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

Probability · Mathematics 2014-02-06 Bénédicte Haas , Robin Stephenson

We study the structure of genealogical trees associated with explosive Crump-Mode-Jagers branching processes (stopped at the explosion time), proving criteria for the associated tree to contain a node of infinite degree (a star) or an…

Probability · Mathematics 2023-11-27 Tejas Iyer , Bas Lodewijks
‹ Prev 1 4 5 6 7 8 10 Next ›