×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

No-exclaves percolation on random networks

Click here to flash read.

arXiv:2402.03689v2 Announce Type: replace-cross
Abstract: No-exclaves percolation (NExP) is a nonlocal percolation process in which the components are formed not only by the connected occupied nodes but also by the agglomeration of empty nodes completely surrounded by the occupied nodes. It has been studied in low dimensions, displaying such novel phenomena as the discontinuous transition to complete percolation. However, its characteristics in complex networks are still unexplored. In this paper, we study the NExP on random networks by developing mean-field solutions using the generating function formalism. Our theory allows us to determine the size of the giant no-exclaves component as well as the percolation threshold, which are in excellent agreements with Monte Carlo simulations on random networks and some real-world networks. We show that on random networks NExP exhibits three phases and two transitions between them: the phases are characterized by the presence or absence of not only the giant NExP component but also the giant unoccupied component, which is the giant connected component composed solely of unoccupied nodes. This work offers theoretical understanding on the anatomy of phase transitions in the NExP process.

Click here to read this post out
ID: 843224; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: May 8, 2024, 7:32 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 7
CC:
No creative common's license
Comments: