相关论文: Near critical preferential attachment networks hav…
We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…
Preferential attachment schemes, where the selection mechanism is linear and possibly time-dependent, are considered, and an infinite-dimensional large deviation principle for the sample path evolution of the empirical degree distribution…
We study the size and the lifetime distributions of scale-free random branching tree in which $k$ branches are generated from a node at each time step with probability $q_k\sim k^{-\gamma}$. In particular, we focus on finite-size trees in a…
We investigate the higher-order connectivity of scale-free networks using algebraic topology. We model scale-free networks as preferential attachment graphs, and we study the algebraic-topological properties of their clique complexes. We…
The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…
The (two) core of a hypergraph is the maximal collection of hyperedges within which no vertex appears only once. It is of importance in tasks such as efficiently solving a large linear system over GF[2], or iterative decoding of low-density…
We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses…
One of the best-known models in network science is preferential attachment. In this model, the probability of attaching to a node depends on the degree of all nodes in the population, and thus depends on global information. In many…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
The classical preferential attachment model is sensitive to the choice of the initial configuration of the network. As the number of initial nodes and their degree grow, so does the time needed for an equilibrium degree distribution to be…
On a large finite connected graph let edges $e$ become "open" at independent random Exponential times of arbitrary rates $w_e$. Under minimal assumptions, the time at which a giant component starts to emerge is weakly concentrated around…
Understanding what types of phenomena lead to discontinuous phase transitions in the connectivity of random networks is an outstanding challenge. Here we show that a simple stochastic model of graph evolution leads to a discontinuous…
We study the emergence of a giant component in a spatial network where the distribution of the metric distances between the nodes is scale-invariant, and the interaction between the nodes has a long-range power-law behavior. The nodes are…
We study a model for the evolution of chemical species under a combination of population dynamics on a short time scale and a selection mechanism on a longer time scale. Least fit nodes are replaced by new nodes whose links are attached to…
Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…
We study the near-critical behavior of the sparse Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$ on $n\gg1$ vertices, where the connection probability $p$ satisfies $np = 1+\theta(b_n^2/n)^{1/3}$, with $n^{3/10}\ll {b_n}\ll n^{1/2}$, and…
In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…
The study of temporal networks in discrete time has yielded numerous insights into time-dependent networked systems in a wide variety of applications. For many complex systems, however, it is useful to develop continuous-time models of…
Complex networks have been mostly characterized from the point of view of the degree distribution of their nodes and a few other motifs (or modules), with a special attention to triangles and cliques. The most exotic phenomena have been…
We consider vertex percolation on pseudo-random $d-$regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in $\frac{n}{d}$) sized component, at…