English
Related papers

Related papers: Dynamic Networks that Drive the Process of Irrever…

200 papers

This paper considers random graph approach to simulate irreversible step-growth polymerization. We study generalization of approach developed by Kryven~I. by introducing different types of bonds each with its own weight representing…

Probability · Mathematics 2022-05-11 S. G. Kobelkov , A. A. Mishchenko

The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…

Combinatorics · Mathematics 2019-08-21 Ivan Kryven

Percolation, the formation of a macroscopic connected component, is a key feature in the description of complex networks. The dynamical properties of a variety of systems can be understood in terms of percolation, including the robustness…

Statistical Mechanics · Physics 2013-06-24 Shane Squires , Katherine Sytwu , Diego Alcala , Thomas Antonsen , Edward Ott , Michelle Girvan

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Probability · Mathematics 2025-12-18 Remco van der Hofstad

Polymerization and formation of crosslinked polymer networks are important processes in manufacturing, materials fabrication, and in the case of hydrated polymer networks, synthesis of biomedical materials, drug delivery, and tissue…

Soft Condensed Matter · Physics 2022-12-15 Sam C. P. Norris , Andrea M. Kasko , Tom Chou , Maria R. D'Orsogna

We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…

Disordered Systems and Neural Networks · Physics 2019-08-21 Christoph Norrenbrock , Mitchell M. Mkrtchian , Alexander K. Hartmann

We show that choosing appropriate distributions of the randomness, the search for optimal paths links diverse problems of disordered media like directed percolation, invasion percolation, directed and non-directed spanning polymers. We also…

Statistical Mechanics · Physics 2009-11-10 Alex Hansen , Janos Kertesz

We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…

Disordered Systems and Neural Networks · Physics 2009-11-11 M. Boguna , M. A. Serrano

Knowing how and when trends are formed is a frequently visited research goal. In our work, we focus on the progression of trends through (social) networks. We use a random graph (RG) model to mimic the progression of a trend through the…

Social and Information Networks · Computer Science 2015-11-06 Marijn ten Thij , Sandjai Bhulai

We develop an algorithm for systematic design of a large artificial neural network using a progression property. We find that some non-linear functions, such as the rectifier linear unit and its derivatives, hold the property. The…

Neural and Evolutionary Computing · Computer Science 2017-10-24 Saikat Chatterjee , Alireza M. Javid , Mostafa Sadeghi , Partha P. Mitra , Mikael Skoglund

The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…

Data Structures and Algorithms · Computer Science 2022-03-29 Andreas Galanis , Leslie Ann Goldberg , James Stewart

We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…

Disordered Systems and Neural Networks · Physics 2023-04-10 Michel Bauer , Denis Bernard

The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for directed graphs with arbitrary bivariate degree distributions. In…

Combinatorics · Mathematics 2016-07-28 Ivan Kryven

We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…

Statistical Mechanics · Physics 2009-11-10 Alain Barrat , Marc Barthelemy , Alessandro Vespignani

This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…

Statistical Mechanics · Physics 2009-10-28 N. Provatas , M. Haataja , E. Seppälä , S. Majaniemi , J. Åström , M. Alava , T. Ala-Nissila

Widely used closed product-form networks have emerged recently as a primary model of stochastic growth of sub-cellular structures, e.g., cellular filaments. In the baseline model, homogeneous monomers attach and detach stochastically to…

Probability · Mathematics 2020-07-30 Predrag Jelenkovic , Jane Kondev , Lishibanya Mohapatra , Petar Momcilovic

Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…

Polymerization of dendritic actin networks underlies important mechanical processes in cell biology such as the protrusion of lamellipodia, propulsion of growth cones in dendrites of neurons, intracellular transport of organelles and…

Biological Physics · Physics 2021-03-17 Rohan Abeyaratne , Prashant K. Purohit

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

Probability · Mathematics 2022-10-25 Nils Detering , Thilo Meyer-Brandis , Konstantinos Panagiotou

We study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with innovation of new…

Molecular Networks · Quantitative Biology 2007-05-23 D. V. Foster , S. A. Kauffman , J. E. S. Socolar
‹ Prev 1 2 3 10 Next ›