New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Group Study

by: Consuelo Herman DDS
Consuelo Herman DDS
GPA 3.78


Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Class Notes
25 ?




Popular in Course

Popular in Engineering Mechanical & Aero

This 8 page Class Notes was uploaded by Consuelo Herman DDS on Tuesday September 8, 2015. The Class Notes belongs to MAE 298 at University of California - Davis taught by Staff in Fall. Since its upload, it has received 29 views. For similar materials see /class/187472/mae-298-university-of-california-davis in Engineering Mechanical & Aero at University of California - Davis.

Similar to MAE 298 at UCD


Reviews for Group Study


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 09/08/15
MAE 298 Lecture 4 April 11 2006 Exploring network robustness Recall Preferential Attachment random graphs The Barabasi and Albert model A discrete time process 0 Start with single isolated node a At each time step a new node arrives o This node makes m connections to already existing nodes Why m edges 0 We are interested in the limit of large graph size Probability o Probability incoming node attaches to node j P7 t l 1 djZjdj o Probability incoming node attaches to any node of of degree k nodes of degree k nodes x degree of that node degree sum over all nodes km 2 km 2k dk Zmn Network evolution Process on the degree sequence 0 Note that pk will change in time So we show denote this explicitly pm a Also when a node of degree k gains an attachment it becomes a node of degree k 1 a When the new node arrives it increases by one the number of nodes of degree m Recursion for pm k 1k 2m mm1m2 2 W Z k2k1m3 39pm k2k1k 39 m1 2mm1 pk k2k1k Forkgtgt1 Pk N 76 3 Simulating PA Basic code for simulating PA with m 1 using R runPA H functionN100 outLinki is the parent of i outLink H numericN numlinksi is number totallinks in and out for node i numLinks H numericN1 fori in 2N p H samplec1i1size1probnumLinks1i1 outLinki H p numLinksp H numLinksp1 returnlistoutLink numLinks Visualizing a PA graph m 1 at n 5000 7 9 quot r f 70 V l i a m M quotiiWV y 399 V iquot I r 1 AA 1 IV quot Exploring PA networks Demo o R Graphviz We will use these as tools to explore Network robustness defined here as maintaining connectivity despite node and edge deletion o Rest of lecture will be interactive demo


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Jennifer McGill UCSF Med School

"Selling my MCAT study guides and notes has been a great source of side revenue while I'm in school. Some months I'm making over $500! Plus, it makes me happy knowing that I'm helping future med students with their MCAT."

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.