23,011 research outputs found

    The two-star model: exact solution in the sparse regime and condensation transition

    Full text link
    The 22-star model is the simplest exponential random graph model that displays complex behavior, such as degeneracy and phase transition. Despite its importance, this model has been solved only in the regime of dense connectivity. In this work we solve the model in the finite connectivity regime, far more prevalent in real world networks. We show that the model undergoes a condensation transition from a liquid to a condensate phase along the critical line corresponding, in the ensemble parameters space, to the Erd\"os-R\'enyi graphs. In the fluid phase the model can produce graphs with a narrow degree statistics, ranging from regular to Erd\"os-R\'enyi graphs, while in the condensed phase, the "excess" degree heterogeneity condenses on a single site with degree N\sim\sqrt{N}. This shows the unsuitability of the two-star model, in its standard definition, to produce arbitrary finitely connected graphs with degree heterogeneity higher than Erd\"os-R\'enyi graphs and suggests that non-pathological variants of this model may be attained by softening the global constraint on the two-stars, while keeping the number of links hardly constrained.Comment: 20 pages, 3 figure

    Approximating subset kk-connectivity problems

    Get PDF
    A subset TVT \subseteq V of terminals is kk-connected to a root ss in a directed/undirected graph JJ if JJ has kk internally-disjoint vsvs-paths for every vTv \in T; TT is kk-connected in JJ if TT is kk-connected to every sTs \in T. We consider the {\sf Subset kk-Connectivity Augmentation} problem: given a graph G=(V,E)G=(V,E) with edge/node-costs, node subset TVT \subseteq V, and a subgraph J=(V,EJ)J=(V,E_J) of GG such that TT is kk-connected in JJ, find a minimum-cost augmenting edge-set FEEJF \subseteq E \setminus E_J such that TT is (k+1)(k+1)-connected in JFJ \cup F. The problem admits trivial ratio O(T2)O(|T|^2). We consider the case T>k|T|>k and prove that for directed/undirected graphs and edge/node-costs, a ρ\rho-approximation for {\sf Rooted Subset kk-Connectivity Augmentation} implies the following ratios for {\sf Subset kk-Connectivity Augmentation}: (i) b(ρ+k)+(3TTk)2H(3TTk)b(\rho+k) + {(\frac{3|T|}{|T|-k})}^2 H(\frac{3|T|}{|T|-k}); (ii) ρO(TTklogk)\rho \cdot O(\frac{|T|}{|T|-k} \log k), where b=1 for undirected graphs and b=2 for directed graphs, and H(k)H(k) is the kkth harmonic number. The best known values of ρ\rho on undirected graphs are min{T,O(k)}\min\{|T|,O(k)\} for edge-costs and min{T,O(klogT)}\min\{|T|,O(k \log |T|)\} for node-costs; for directed graphs ρ=T\rho=|T| for both versions. Our results imply that unless k=To(T)k=|T|-o(|T|), {\sf Subset kk-Connectivity Augmentation} admits the same ratios as the best known ones for the rooted version. This improves the ratios in \cite{N-focs,L}

    Exact results for fixation probability of bithermal evolutionary graphs

    Full text link
    One of the most fundamental concepts of evolutionary dynamics is the "fixation" probability, i.e. the probability that a mutant spreads through the whole population. Most natural communities are geographically structured into habitats exchanging individuals among each other and can be modeled by an evolutionary graph (EG), where directed links weight the probability for the offspring of one individual to replace another individual in the community. Very few exact analytical results are known for EGs. We show here how by using the techniques of the fixed point of Probability Generating Function, we can uncover a large class of of graphs, which we term bithermal, for which the exact fixation probability can be simply computed

    Adaptive Network Dynamics and Evolution of Leadership in Collective Migration

    Full text link
    The evolution of leadership in migratory populations depends not only on costs and benefits of leadership investments but also on the opportunities for individuals to rely on cues from others through social interactions. We derive an analytically tractable adaptive dynamic network model of collective migration with fast timescale migration dynamics and slow timescale adaptive dynamics of individual leadership investment and social interaction. For large populations, our analysis of bifurcations with respect to investment cost explains the observed hysteretic effect associated with recovery of migration in fragmented environments. Further, we show a minimum connectivity threshold above which there is evolutionary branching into leader and follower populations. For small populations, we show how the topology of the underlying social interaction network influences the emergence and location of leaders in the adaptive system. Our model and analysis can describe other adaptive network dynamics involving collective tracking or collective learning of a noisy, unknown signal, and likewise can inform the design of robotic networks where agents use decentralized strategies that balance direct environmental measurements with agent interactions.Comment: Submitted to Physica D: Nonlinear Phenomen

    Structural transition in interdependent networks with regular interconnections

    Get PDF
    Networks are often made up of several layers that exhibit diverse degrees of interdependencies. A multilayer interdependent network consists of a set of graphs GG that are interconnected through a weighted interconnection matrix B B , where the weight of each inter-graph link is a non-negative real number p p . Various dynamical processes, such as synchronization, cascading failures in power grids, and diffusion processes, are described by the Laplacian matrix Q Q characterizing the whole system. For the case in which the multilayer graph is a multiplex, where the number of nodes in each layer is the same and the interconnection matrix B=pI B=pI , being I I the identity matrix, it has been shown that there exists a structural transition at some critical coupling, p p^* . This transition is such that dynamical processes are separated into two regimes: if p>p p > p^* , the network acts as a whole; whereas when p<p p<p^* , the network operates as if the graphs encoding the layers were isolated. In this paper, we extend and generalize the structural transition threshold p p^* to a regular interconnection matrix B B (constant row and column sum). Specifically, we provide upper and lower bounds for the transition threshold p p^* in interdependent networks with a regular interconnection matrix B B and derive the exact transition threshold for special scenarios using the formalism of quotient graphs. Additionally, we discuss the physical meaning of the transition threshold p p^* in terms of the minimum cut and show, through a counter-example, that the structural transition does not always exist. Our results are one step forward on the characterization of more realistic multilayer networks and might be relevant for systems that deviate from the topological constrains imposed by multiplex networks.Comment: 13 pages, APS format. Submitted for publicatio
    corecore